./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/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 56f043bec3037ec37b4a132611abd4a337934428 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 07:25:19,323 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:25:19,324 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:25:19,330 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:25:19,331 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:25:19,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:25:19,332 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:25:19,333 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:25:19,334 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:25:19,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:25:19,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:25:19,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:25:19,336 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:25:19,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:25:19,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:25:19,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:25:19,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:25:19,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:25:19,341 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:25:19,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:25:19,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:25:19,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:25:19,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:25:19,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:25:19,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:25:19,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:25:19,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:25:19,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:25:19,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:25:19,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:25:19,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:25:19,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:25:19,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:25:19,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:25:19,349 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:25:19,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:25:19,350 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 07:25:19,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:25:19,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:25:19,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:25:19,361 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 07:25:19,361 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 07:25:19,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:25:19,362 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:25:19,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:25:19,363 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:25:19,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:25:19,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:25:19,364 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_bcf87227-ab36-4531-ba4d-22a51e84843a/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-10 07:25:19,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:25:19,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:25:19,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:25:19,396 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:25:19,397 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:25:19,397 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:25:19,431 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/data/6594b7412/57296f8e0b7d4897adbf7418cbd73f5c/FLAGe54253ae6 [2018-11-10 07:25:19,830 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:25:19,831 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:25:19,836 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/data/6594b7412/57296f8e0b7d4897adbf7418cbd73f5c/FLAGe54253ae6 [2018-11-10 07:25:19,847 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/data/6594b7412/57296f8e0b7d4897adbf7418cbd73f5c [2018-11-10 07:25:19,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:25:19,850 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 07:25:19,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:25:19,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:25:19,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:25:19,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:25:19" (1/1) ... [2018-11-10 07:25:19,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e7f328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:19, skipping insertion in model container [2018-11-10 07:25:19,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:25:19" (1/1) ... [2018-11-10 07:25:19,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:25:19,876 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:25:19,982 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:25:19,984 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:25:20,000 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:25:20,008 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:25:20,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20 WrapperNode [2018-11-10 07:25:20,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:25:20,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:25:20,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:25:20,009 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:25:20,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... [2018-11-10 07:25:20,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:25:20,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:25:20,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:25:20,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:25:20,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/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-10 07:25:20,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:25:20,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:25:20,100 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:25:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 07:25:20,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 07:25:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:25:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:25:20,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:25:20,271 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:25:20,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:25:20 BoogieIcfgContainer [2018-11-10 07:25:20,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:25:20,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:25:20,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:25:20,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:25:20,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:25:19" (1/3) ... [2018-11-10 07:25:20,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329e977d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:25:20, skipping insertion in model container [2018-11-10 07:25:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:25:20" (2/3) ... [2018-11-10 07:25:20,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329e977d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:25:20, skipping insertion in model container [2018-11-10 07:25:20,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:25:20" (3/3) ... [2018-11-10 07:25:20,277 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 07:25:20,284 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:25:20,289 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:25:20,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:25:20,316 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 07:25:20,316 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:25:20,316 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:25:20,316 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:25:20,316 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:25:20,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:25:20,317 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:25:20,317 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:25:20,317 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:25:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-11-10 07:25:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:25:20,340 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,341 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-10 07:25:20,343 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1514281487, now seen corresponding path program 1 times [2018-11-10 07:25:20,349 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,474 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-10 07:25:20,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,489 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-11-10 07:25:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,525 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2018-11-10 07:25:20,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:25:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,533 INFO L225 Difference]: With dead ends: 95 [2018-11-10 07:25:20,534 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 07:25:20,536 INFO L605 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-10 07:25:20,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 07:25:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2018-11-10 07:25:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-10 07:25:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2018-11-10 07:25:20,567 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2018-11-10 07:25:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,568 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2018-11-10 07:25:20,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2018-11-10 07:25:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 07:25:20,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,568 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-10 07:25:20,569 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,569 INFO L82 PathProgramCache]: Analyzing trace with hash 503164237, now seen corresponding path program 1 times [2018-11-10 07:25:20,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,607 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-10 07:25:20,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,609 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand 3 states. [2018-11-10 07:25:20,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,652 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2018-11-10 07:25:20,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 07:25:20,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,653 INFO L225 Difference]: With dead ends: 130 [2018-11-10 07:25:20,653 INFO L226 Difference]: Without dead ends: 80 [2018-11-10 07:25:20,653 INFO L605 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-10 07:25:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-10 07:25:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-11-10 07:25:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 07:25:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-11-10 07:25:20,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 22 [2018-11-10 07:25:20,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,659 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2018-11-10 07:25:20,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-11-10 07:25:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:25:20,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,660 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,660 INFO L82 PathProgramCache]: Analyzing trace with hash -301701102, now seen corresponding path program 1 times [2018-11-10 07:25:20,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,696 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-10 07:25:20,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,697 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 3 states. [2018-11-10 07:25:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,723 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2018-11-10 07:25:20,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:25:20,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,725 INFO L225 Difference]: With dead ends: 121 [2018-11-10 07:25:20,725 INFO L226 Difference]: Without dead ends: 84 [2018-11-10 07:25:20,725 INFO L605 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-10 07:25:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-10 07:25:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-10 07:25:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 07:25:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2018-11-10 07:25:20,732 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 23 [2018-11-10 07:25:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,732 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2018-11-10 07:25:20,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2018-11-10 07:25:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:25:20,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,733 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,733 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1581564780, now seen corresponding path program 1 times [2018-11-10 07:25:20,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,760 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-10 07:25:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,761 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand 3 states. [2018-11-10 07:25:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,773 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2018-11-10 07:25:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:25:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,774 INFO L225 Difference]: With dead ends: 153 [2018-11-10 07:25:20,774 INFO L226 Difference]: Without dead ends: 151 [2018-11-10 07:25:20,774 INFO L605 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-10 07:25:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-10 07:25:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-11-10 07:25:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-10 07:25:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-11-10 07:25:20,781 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 23 [2018-11-10 07:25:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,781 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-11-10 07:25:20,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,782 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-11-10 07:25:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 07:25:20,782 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,782 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,783 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1702285266, now seen corresponding path program 1 times [2018-11-10 07:25:20,783 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,810 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-10 07:25:20,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,811 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 3 states. [2018-11-10 07:25:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,828 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2018-11-10 07:25:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 07:25:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,830 INFO L225 Difference]: With dead ends: 251 [2018-11-10 07:25:20,830 INFO L226 Difference]: Without dead ends: 153 [2018-11-10 07:25:20,830 INFO L605 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-10 07:25:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-10 07:25:20,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-11-10 07:25:20,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 07:25:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 263 transitions. [2018-11-10 07:25:20,838 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 263 transitions. Word has length 23 [2018-11-10 07:25:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,839 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 263 transitions. [2018-11-10 07:25:20,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 263 transitions. [2018-11-10 07:25:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:25:20,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,840 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1783654526, now seen corresponding path program 1 times [2018-11-10 07:25:20,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:25:20,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,877 INFO L87 Difference]: Start difference. First operand 151 states and 263 transitions. Second operand 3 states. [2018-11-10 07:25:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,895 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2018-11-10 07:25:20,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:25:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,896 INFO L225 Difference]: With dead ends: 226 [2018-11-10 07:25:20,896 INFO L226 Difference]: Without dead ends: 155 [2018-11-10 07:25:20,897 INFO L605 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-10 07:25:20,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-10 07:25:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-10 07:25:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 07:25:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 263 transitions. [2018-11-10 07:25:20,905 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 263 transitions. Word has length 24 [2018-11-10 07:25:20,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,905 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 263 transitions. [2018-11-10 07:25:20,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 263 transitions. [2018-11-10 07:25:20,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:25:20,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,906 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,907 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1231449092, now seen corresponding path program 1 times [2018-11-10 07:25:20,907 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,925 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-10 07:25:20,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,926 INFO L87 Difference]: Start difference. First operand 153 states and 263 transitions. Second operand 3 states. [2018-11-10 07:25:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,949 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2018-11-10 07:25:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:25:20,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,950 INFO L225 Difference]: With dead ends: 285 [2018-11-10 07:25:20,950 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 07:25:20,950 INFO L605 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-10 07:25:20,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 07:25:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 205. [2018-11-10 07:25:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 07:25:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 351 transitions. [2018-11-10 07:25:20,959 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 351 transitions. Word has length 24 [2018-11-10 07:25:20,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:20,960 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 351 transitions. [2018-11-10 07:25:20,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 351 transitions. [2018-11-10 07:25:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 07:25:20,961 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:20,961 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:20,961 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:20,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash 220331842, now seen corresponding path program 1 times [2018-11-10 07:25:20,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:20,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:20,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:20,976 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-10 07:25:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:20,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:20,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:20,977 INFO L87 Difference]: Start difference. First operand 205 states and 351 transitions. Second operand 3 states. [2018-11-10 07:25:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:20,990 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2018-11-10 07:25:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:20,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 07:25:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:20,991 INFO L225 Difference]: With dead ends: 485 [2018-11-10 07:25:20,991 INFO L226 Difference]: Without dead ends: 291 [2018-11-10 07:25:20,992 INFO L605 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-10 07:25:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-11-10 07:25:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-11-10 07:25:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-11-10 07:25:21,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 491 transitions. [2018-11-10 07:25:21,002 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 491 transitions. Word has length 24 [2018-11-10 07:25:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,002 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 491 transitions. [2018-11-10 07:25:21,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 491 transitions. [2018-11-10 07:25:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:25:21,003 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,003 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,004 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash -479570073, now seen corresponding path program 1 times [2018-11-10 07:25:21,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,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-10 07:25:21,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,022 INFO L87 Difference]: Start difference. First operand 289 states and 491 transitions. Second operand 3 states. [2018-11-10 07:25:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,051 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2018-11-10 07:25:21,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:25:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,053 INFO L225 Difference]: With dead ends: 433 [2018-11-10 07:25:21,054 INFO L226 Difference]: Without dead ends: 295 [2018-11-10 07:25:21,054 INFO L605 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-10 07:25:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-11-10 07:25:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-11-10 07:25:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-11-10 07:25:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 491 transitions. [2018-11-10 07:25:21,063 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 491 transitions. Word has length 25 [2018-11-10 07:25:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,063 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 491 transitions. [2018-11-10 07:25:21,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 491 transitions. [2018-11-10 07:25:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:25:21,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,064 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,065 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1759433751, now seen corresponding path program 1 times [2018-11-10 07:25:21,065 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,092 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-10 07:25:21,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,093 INFO L87 Difference]: Start difference. First operand 293 states and 491 transitions. Second operand 3 states. [2018-11-10 07:25:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,112 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2018-11-10 07:25:21,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:25:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,115 INFO L225 Difference]: With dead ends: 541 [2018-11-10 07:25:21,115 INFO L226 Difference]: Without dead ends: 539 [2018-11-10 07:25:21,115 INFO L605 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-10 07:25:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-11-10 07:25:21,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2018-11-10 07:25:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-11-10 07:25:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2018-11-10 07:25:21,129 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 25 [2018-11-10 07:25:21,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,129 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2018-11-10 07:25:21,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2018-11-10 07:25:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 07:25:21,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,130 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,130 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1524416295, now seen corresponding path program 1 times [2018-11-10 07:25:21,131 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,149 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-10 07:25:21,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,150 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand 3 states. [2018-11-10 07:25:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,172 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2018-11-10 07:25:21,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 07:25:21,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,175 INFO L225 Difference]: With dead ends: 949 [2018-11-10 07:25:21,175 INFO L226 Difference]: Without dead ends: 563 [2018-11-10 07:25:21,176 INFO L605 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-10 07:25:21,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-11-10 07:25:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2018-11-10 07:25:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-10 07:25:21,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2018-11-10 07:25:21,192 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 25 [2018-11-10 07:25:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,193 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2018-11-10 07:25:21,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2018-11-10 07:25:21,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:25:21,194 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,194 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,194 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1292342647, now seen corresponding path program 1 times [2018-11-10 07:25:21,195 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,224 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-10 07:25:21,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,225 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand 3 states. [2018-11-10 07:25:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,243 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2018-11-10 07:25:21,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:25:21,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,246 INFO L225 Difference]: With dead ends: 841 [2018-11-10 07:25:21,247 INFO L226 Difference]: Without dead ends: 571 [2018-11-10 07:25:21,247 INFO L605 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-10 07:25:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-11-10 07:25:21,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2018-11-10 07:25:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-11-10 07:25:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 919 transitions. [2018-11-10 07:25:21,264 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 919 transitions. Word has length 26 [2018-11-10 07:25:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,265 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 919 transitions. [2018-11-10 07:25:21,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 919 transitions. [2018-11-10 07:25:21,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:25:21,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,266 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,266 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,266 INFO L82 PathProgramCache]: Analyzing trace with hash 12478969, now seen corresponding path program 1 times [2018-11-10 07:25:21,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,284 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-10 07:25:21,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,286 INFO L87 Difference]: Start difference. First operand 569 states and 919 transitions. Second operand 3 states. [2018-11-10 07:25:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,313 INFO L93 Difference]: Finished difference Result 1645 states and 2649 transitions. [2018-11-10 07:25:21,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:25:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,316 INFO L225 Difference]: With dead ends: 1645 [2018-11-10 07:25:21,317 INFO L226 Difference]: Without dead ends: 1099 [2018-11-10 07:25:21,318 INFO L605 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-10 07:25:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-11-10 07:25:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2018-11-10 07:25:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-10 07:25:21,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1735 transitions. [2018-11-10 07:25:21,349 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1735 transitions. Word has length 26 [2018-11-10 07:25:21,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,349 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1735 transitions. [2018-11-10 07:25:21,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1735 transitions. [2018-11-10 07:25:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 07:25:21,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,351 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1023596219, now seen corresponding path program 1 times [2018-11-10 07:25:21,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,377 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-10 07:25:21,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,379 INFO L87 Difference]: Start difference. First operand 1097 states and 1735 transitions. Second operand 3 states. [2018-11-10 07:25:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,404 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2018-11-10 07:25:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 07:25:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,408 INFO L225 Difference]: With dead ends: 1341 [2018-11-10 07:25:21,408 INFO L226 Difference]: Without dead ends: 1339 [2018-11-10 07:25:21,409 INFO L605 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-10 07:25:21,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-10 07:25:21,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1097. [2018-11-10 07:25:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-11-10 07:25:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1719 transitions. [2018-11-10 07:25:21,442 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1719 transitions. Word has length 26 [2018-11-10 07:25:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,443 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1719 transitions. [2018-11-10 07:25:21,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1719 transitions. [2018-11-10 07:25:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:25:21,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,445 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,446 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash 387062460, now seen corresponding path program 1 times [2018-11-10 07:25:21,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,480 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-10 07:25:21,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,481 INFO L87 Difference]: Start difference. First operand 1097 states and 1719 transitions. Second operand 3 states. [2018-11-10 07:25:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,533 INFO L93 Difference]: Finished difference Result 1981 states and 3161 transitions. [2018-11-10 07:25:21,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 07:25:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,538 INFO L225 Difference]: With dead ends: 1981 [2018-11-10 07:25:21,539 INFO L226 Difference]: Without dead ends: 1979 [2018-11-10 07:25:21,539 INFO L605 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-10 07:25:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-11-10 07:25:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1561. [2018-11-10 07:25:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-10 07:25:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2391 transitions. [2018-11-10 07:25:21,585 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2391 transitions. Word has length 27 [2018-11-10 07:25:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,585 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2391 transitions. [2018-11-10 07:25:21,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2391 transitions. [2018-11-10 07:25:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 07:25:21,587 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,587 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,588 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -624054790, now seen corresponding path program 1 times [2018-11-10 07:25:21,588 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,604 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-10 07:25:21,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,605 INFO L87 Difference]: Start difference. First operand 1561 states and 2391 transitions. Second operand 3 states. [2018-11-10 07:25:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,654 INFO L93 Difference]: Finished difference Result 3677 states and 5657 transitions. [2018-11-10 07:25:21,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 07:25:21,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,660 INFO L225 Difference]: With dead ends: 3677 [2018-11-10 07:25:21,660 INFO L226 Difference]: Without dead ends: 2139 [2018-11-10 07:25:21,662 INFO L605 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-10 07:25:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-11-10 07:25:21,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2018-11-10 07:25:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-11-10 07:25:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3239 transitions. [2018-11-10 07:25:21,722 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3239 transitions. Word has length 27 [2018-11-10 07:25:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,722 INFO L481 AbstractCegarLoop]: Abstraction has 2137 states and 3239 transitions. [2018-11-10 07:25:21,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3239 transitions. [2018-11-10 07:25:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:25:21,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,725 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,725 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -885750866, now seen corresponding path program 1 times [2018-11-10 07:25:21,726 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,764 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-10 07:25:21,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,765 INFO L87 Difference]: Start difference. First operand 2137 states and 3239 transitions. Second operand 3 states. [2018-11-10 07:25:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:21,815 INFO L93 Difference]: Finished difference Result 3229 states and 4889 transitions. [2018-11-10 07:25:21,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:21,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:25:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:21,823 INFO L225 Difference]: With dead ends: 3229 [2018-11-10 07:25:21,823 INFO L226 Difference]: Without dead ends: 2187 [2018-11-10 07:25:21,825 INFO L605 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-10 07:25:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-11-10 07:25:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2185. [2018-11-10 07:25:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-11-10 07:25:21,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3271 transitions. [2018-11-10 07:25:21,909 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3271 transitions. Word has length 28 [2018-11-10 07:25:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:21,909 INFO L481 AbstractCegarLoop]: Abstraction has 2185 states and 3271 transitions. [2018-11-10 07:25:21,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3271 transitions. [2018-11-10 07:25:21,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:25:21,911 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:21,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:21,911 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:21,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:21,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2129352752, now seen corresponding path program 1 times [2018-11-10 07:25:21,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:21,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:21,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:21,952 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-10 07:25:21,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:21,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:21,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:21,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:21,953 INFO L87 Difference]: Start difference. First operand 2185 states and 3271 transitions. Second operand 3 states. [2018-11-10 07:25:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:22,027 INFO L93 Difference]: Finished difference Result 3853 states and 5865 transitions. [2018-11-10 07:25:22,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:22,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:25:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:22,040 INFO L225 Difference]: With dead ends: 3853 [2018-11-10 07:25:22,040 INFO L226 Difference]: Without dead ends: 3851 [2018-11-10 07:25:22,041 INFO L605 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-10 07:25:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-11-10 07:25:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3145. [2018-11-10 07:25:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-10 07:25:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4583 transitions. [2018-11-10 07:25:22,118 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4583 transitions. Word has length 28 [2018-11-10 07:25:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:22,119 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 4583 transitions. [2018-11-10 07:25:22,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4583 transitions. [2018-11-10 07:25:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 07:25:22,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:22,122 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:22,123 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:22,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1118235502, now seen corresponding path program 1 times [2018-11-10 07:25:22,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:22,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:22,140 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-10 07:25:22,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:22,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:22,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:22,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:22,141 INFO L87 Difference]: Start difference. First operand 3145 states and 4583 transitions. Second operand 3 states. [2018-11-10 07:25:22,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:22,227 INFO L93 Difference]: Finished difference Result 7309 states and 10665 transitions. [2018-11-10 07:25:22,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:22,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 07:25:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:22,239 INFO L225 Difference]: With dead ends: 7309 [2018-11-10 07:25:22,239 INFO L226 Difference]: Without dead ends: 4235 [2018-11-10 07:25:22,243 INFO L605 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-10 07:25:22,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-10 07:25:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4233. [2018-11-10 07:25:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2018-11-10 07:25:22,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6087 transitions. [2018-11-10 07:25:22,355 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6087 transitions. Word has length 28 [2018-11-10 07:25:22,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:22,355 INFO L481 AbstractCegarLoop]: Abstraction has 4233 states and 6087 transitions. [2018-11-10 07:25:22,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6087 transitions. [2018-11-10 07:25:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:25:22,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:22,359 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:22,359 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:22,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1585640975, now seen corresponding path program 1 times [2018-11-10 07:25:22,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:22,375 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-10 07:25:22,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:22,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:22,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:22,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:22,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:22,376 INFO L87 Difference]: Start difference. First operand 4233 states and 6087 transitions. Second operand 3 states. [2018-11-10 07:25:22,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:22,450 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2018-11-10 07:25:22,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:22,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:25:22,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:22,460 INFO L225 Difference]: With dead ends: 6349 [2018-11-10 07:25:22,460 INFO L226 Difference]: Without dead ends: 4299 [2018-11-10 07:25:22,464 INFO L605 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-10 07:25:22,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2018-11-10 07:25:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2018-11-10 07:25:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2018-11-10 07:25:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6087 transitions. [2018-11-10 07:25:22,579 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6087 transitions. Word has length 29 [2018-11-10 07:25:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:22,579 INFO L481 AbstractCegarLoop]: Abstraction has 4297 states and 6087 transitions. [2018-11-10 07:25:22,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6087 transitions. [2018-11-10 07:25:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:25:22,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:22,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:22,583 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:22,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:22,584 INFO L82 PathProgramCache]: Analyzing trace with hash 305777297, now seen corresponding path program 1 times [2018-11-10 07:25:22,584 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:22,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:22,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:22,596 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-10 07:25:22,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:22,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:22,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:22,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:22,597 INFO L87 Difference]: Start difference. First operand 4297 states and 6087 transitions. Second operand 3 states. [2018-11-10 07:25:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:22,704 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2018-11-10 07:25:22,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:22,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:25:22,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:22,716 INFO L225 Difference]: With dead ends: 7437 [2018-11-10 07:25:22,717 INFO L226 Difference]: Without dead ends: 7435 [2018-11-10 07:25:22,719 INFO L605 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-10 07:25:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-11-10 07:25:22,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6281. [2018-11-10 07:25:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2018-11-10 07:25:22,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8647 transitions. [2018-11-10 07:25:22,861 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8647 transitions. Word has length 29 [2018-11-10 07:25:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:22,861 INFO L481 AbstractCegarLoop]: Abstraction has 6281 states and 8647 transitions. [2018-11-10 07:25:22,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:22,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8647 transitions. [2018-11-10 07:25:22,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:25:22,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:22,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:22,868 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:22,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:22,868 INFO L82 PathProgramCache]: Analyzing trace with hash -705339953, now seen corresponding path program 1 times [2018-11-10 07:25:22,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:22,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:22,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:22,880 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-10 07:25:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:22,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:22,882 INFO L87 Difference]: Start difference. First operand 6281 states and 8647 transitions. Second operand 3 states. [2018-11-10 07:25:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:23,033 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2018-11-10 07:25:23,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:23,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 07:25:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:23,047 INFO L225 Difference]: With dead ends: 14477 [2018-11-10 07:25:23,047 INFO L226 Difference]: Without dead ends: 8331 [2018-11-10 07:25:23,057 INFO L605 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-10 07:25:23,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2018-11-10 07:25:23,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 8329. [2018-11-10 07:25:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-11-10 07:25:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11271 transitions. [2018-11-10 07:25:23,300 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11271 transitions. Word has length 29 [2018-11-10 07:25:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:23,301 INFO L481 AbstractCegarLoop]: Abstraction has 8329 states and 11271 transitions. [2018-11-10 07:25:23,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11271 transitions. [2018-11-10 07:25:23,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:25:23,308 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:23,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:23,308 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:23,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:23,308 INFO L82 PathProgramCache]: Analyzing trace with hash 889377059, now seen corresponding path program 1 times [2018-11-10 07:25:23,308 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:23,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:23,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:23,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:23,344 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-10 07:25:23,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:23,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:23,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:23,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:23,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:23,345 INFO L87 Difference]: Start difference. First operand 8329 states and 11271 transitions. Second operand 3 states. [2018-11-10 07:25:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:23,464 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2018-11-10 07:25:23,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:23,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:25:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:23,477 INFO L225 Difference]: With dead ends: 12493 [2018-11-10 07:25:23,477 INFO L226 Difference]: Without dead ends: 8459 [2018-11-10 07:25:23,484 INFO L605 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-10 07:25:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2018-11-10 07:25:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8457. [2018-11-10 07:25:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2018-11-10 07:25:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 11271 transitions. [2018-11-10 07:25:23,670 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 11271 transitions. Word has length 30 [2018-11-10 07:25:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:23,670 INFO L481 AbstractCegarLoop]: Abstraction has 8457 states and 11271 transitions. [2018-11-10 07:25:23,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:23,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 11271 transitions. [2018-11-10 07:25:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:25:23,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:23,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:23,677 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:23,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash -390486619, now seen corresponding path program 1 times [2018-11-10 07:25:23,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:23,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:23,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:23,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:23,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:23,694 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-10 07:25:23,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:23,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:23,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:23,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:23,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:23,695 INFO L87 Difference]: Start difference. First operand 8457 states and 11271 transitions. Second operand 3 states. [2018-11-10 07:25:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:23,891 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2018-11-10 07:25:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:23,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:25:23,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:23,912 INFO L225 Difference]: With dead ends: 14349 [2018-11-10 07:25:23,912 INFO L226 Difference]: Without dead ends: 14347 [2018-11-10 07:25:23,916 INFO L605 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-10 07:25:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2018-11-10 07:25:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 12553. [2018-11-10 07:25:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2018-11-10 07:25:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 16263 transitions. [2018-11-10 07:25:24,152 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 16263 transitions. Word has length 30 [2018-11-10 07:25:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:24,153 INFO L481 AbstractCegarLoop]: Abstraction has 12553 states and 16263 transitions. [2018-11-10 07:25:24,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:24,153 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 16263 transitions. [2018-11-10 07:25:24,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 07:25:24,167 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:24,167 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:24,168 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:24,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:24,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1401603869, now seen corresponding path program 1 times [2018-11-10 07:25:24,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:24,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:24,192 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-10 07:25:24,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:24,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:24,193 INFO L87 Difference]: Start difference. First operand 12553 states and 16263 transitions. Second operand 3 states. [2018-11-10 07:25:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:24,406 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2018-11-10 07:25:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:24,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 07:25:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:24,421 INFO L225 Difference]: With dead ends: 28685 [2018-11-10 07:25:24,421 INFO L226 Difference]: Without dead ends: 16395 [2018-11-10 07:25:24,430 INFO L605 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-10 07:25:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2018-11-10 07:25:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16393. [2018-11-10 07:25:24,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2018-11-10 07:25:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 20743 transitions. [2018-11-10 07:25:24,627 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 20743 transitions. Word has length 30 [2018-11-10 07:25:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:24,627 INFO L481 AbstractCegarLoop]: Abstraction has 16393 states and 20743 transitions. [2018-11-10 07:25:24,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 20743 transitions. [2018-11-10 07:25:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 07:25:24,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:24,634 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:24,634 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:24,635 INFO L82 PathProgramCache]: Analyzing trace with hash 780032484, now seen corresponding path program 1 times [2018-11-10 07:25:24,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:24,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:24,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-10 07:25:24,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:24,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:24,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:24,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:24,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:24,657 INFO L87 Difference]: Start difference. First operand 16393 states and 20743 transitions. Second operand 3 states. [2018-11-10 07:25:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:24,798 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2018-11-10 07:25:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:24,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 07:25:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:24,813 INFO L225 Difference]: With dead ends: 24589 [2018-11-10 07:25:24,813 INFO L226 Difference]: Without dead ends: 16651 [2018-11-10 07:25:24,821 INFO L605 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-10 07:25:24,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2018-11-10 07:25:25,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 16649. [2018-11-10 07:25:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-11-10 07:25:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 20743 transitions. [2018-11-10 07:25:25,092 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 20743 transitions. Word has length 31 [2018-11-10 07:25:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:25,093 INFO L481 AbstractCegarLoop]: Abstraction has 16649 states and 20743 transitions. [2018-11-10 07:25:25,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 20743 transitions. [2018-11-10 07:25:25,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 07:25:25,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:25,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:25,100 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:25,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:25,100 INFO L82 PathProgramCache]: Analyzing trace with hash -499831194, now seen corresponding path program 1 times [2018-11-10 07:25:25,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:25,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:25,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:25,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:25,115 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-10 07:25:25,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:25,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:25,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:25,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:25,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:25,116 INFO L87 Difference]: Start difference. First operand 16649 states and 20743 transitions. Second operand 3 states. [2018-11-10 07:25:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:25,339 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2018-11-10 07:25:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:25,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 07:25:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:25,364 INFO L225 Difference]: With dead ends: 27661 [2018-11-10 07:25:25,364 INFO L226 Difference]: Without dead ends: 27659 [2018-11-10 07:25:25,369 INFO L605 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-10 07:25:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2018-11-10 07:25:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25097. [2018-11-10 07:25:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-11-10 07:25:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 30471 transitions. [2018-11-10 07:25:25,659 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 30471 transitions. Word has length 31 [2018-11-10 07:25:25,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:25,659 INFO L481 AbstractCegarLoop]: Abstraction has 25097 states and 30471 transitions. [2018-11-10 07:25:25,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 30471 transitions. [2018-11-10 07:25:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 07:25:25,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:25,674 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:25,675 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:25,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:25,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1510948444, now seen corresponding path program 1 times [2018-11-10 07:25:25,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:25,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:25,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:25,691 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-10 07:25:25,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:25,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:25,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:25,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:25,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:25,692 INFO L87 Difference]: Start difference. First operand 25097 states and 30471 transitions. Second operand 3 states. [2018-11-10 07:25:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:26,063 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2018-11-10 07:25:26,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:26,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 07:25:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:26,094 INFO L225 Difference]: With dead ends: 56845 [2018-11-10 07:25:26,094 INFO L226 Difference]: Without dead ends: 32267 [2018-11-10 07:25:26,121 INFO L605 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-10 07:25:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2018-11-10 07:25:26,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32265. [2018-11-10 07:25:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2018-11-10 07:25:26,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 37895 transitions. [2018-11-10 07:25:26,549 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 37895 transitions. Word has length 31 [2018-11-10 07:25:26,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:26,549 INFO L481 AbstractCegarLoop]: Abstraction has 32265 states and 37895 transitions. [2018-11-10 07:25:26,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:26,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 37895 transitions. [2018-11-10 07:25:26,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 07:25:26,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:26,558 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:26,558 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:26,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1685318296, now seen corresponding path program 1 times [2018-11-10 07:25:26,558 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:26,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:26,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:26,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:26,596 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-10 07:25:26,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:26,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:26,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:26,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:26,597 INFO L87 Difference]: Start difference. First operand 32265 states and 37895 transitions. Second operand 3 states. [2018-11-10 07:25:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:26,990 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2018-11-10 07:25:26,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:26,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 07:25:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:27,010 INFO L225 Difference]: With dead ends: 48397 [2018-11-10 07:25:27,011 INFO L226 Difference]: Without dead ends: 32779 [2018-11-10 07:25:27,020 INFO L605 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-10 07:25:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2018-11-10 07:25:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 32777. [2018-11-10 07:25:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2018-11-10 07:25:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 37895 transitions. [2018-11-10 07:25:27,413 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 37895 transitions. Word has length 32 [2018-11-10 07:25:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:27,413 INFO L481 AbstractCegarLoop]: Abstraction has 32777 states and 37895 transitions. [2018-11-10 07:25:27,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 37895 transitions. [2018-11-10 07:25:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 07:25:27,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:27,422 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:27,422 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:27,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash 405454618, now seen corresponding path program 1 times [2018-11-10 07:25:27,422 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:27,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:27,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:27,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:27,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:27,456 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-10 07:25:27,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:27,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:27,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:27,457 INFO L87 Difference]: Start difference. First operand 32777 states and 37895 transitions. Second operand 3 states. [2018-11-10 07:25:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:27,972 INFO L93 Difference]: Finished difference Result 53259 states and 60936 transitions. [2018-11-10 07:25:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:27,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 07:25:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:28,010 INFO L225 Difference]: With dead ends: 53259 [2018-11-10 07:25:28,010 INFO L226 Difference]: Without dead ends: 53257 [2018-11-10 07:25:28,019 INFO L605 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-10 07:25:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2018-11-10 07:25:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 50185. [2018-11-10 07:25:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50185 states. [2018-11-10 07:25:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50185 states to 50185 states and 56839 transitions. [2018-11-10 07:25:28,697 INFO L78 Accepts]: Start accepts. Automaton has 50185 states and 56839 transitions. Word has length 32 [2018-11-10 07:25:28,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:28,697 INFO L481 AbstractCegarLoop]: Abstraction has 50185 states and 56839 transitions. [2018-11-10 07:25:28,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 50185 states and 56839 transitions. [2018-11-10 07:25:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 07:25:28,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:25:28,719 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:25:28,719 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:25:28,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:25:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash -605662632, now seen corresponding path program 1 times [2018-11-10 07:25:28,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 07:25:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 07:25:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:28,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:25:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:25:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:25:28,742 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-10 07:25:28,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:25:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 07:25:28,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 07:25:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 07:25:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 07:25:28,743 INFO L87 Difference]: Start difference. First operand 50185 states and 56839 transitions. Second operand 3 states. [2018-11-10 07:25:29,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:25:29,475 INFO L93 Difference]: Finished difference Result 112649 states and 125447 transitions. [2018-11-10 07:25:29,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 07:25:29,476 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 07:25:29,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:25:29,476 INFO L225 Difference]: With dead ends: 112649 [2018-11-10 07:25:29,476 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:25:29,527 INFO L605 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-10 07:25:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:25:29,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:25:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:25:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:25:29,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-10 07:25:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:25:29,528 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:25:29,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 07:25:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:25:29,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:25:29,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:25:29,560 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:25:29,560 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-10 07:25:29,560 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L421 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,561 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 07:25:29,562 INFO L428 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-10 07:25:29,563 INFO L428 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-10 07:25:29,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:25:29 BoogieIcfgContainer [2018-11-10 07:25:29,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:25:29,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:25:29,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:25:29,570 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:25:29,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:25:20" (3/4) ... [2018-11-10 07:25:29,574 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:25:29,580 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:25:29,580 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:25:29,584 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 07:25:29,585 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 07:25:29,585 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:25:29,631 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bcf87227-ab36-4531-ba4d-22a51e84843a/bin-2019/uautomizer/witness.graphml [2018-11-10 07:25:29,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:25:29,632 INFO L168 Benchmark]: Toolchain (without parser) took 9782.47 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 921.2 MB). Free memory was 960.3 MB in the beginning and 709.7 MB in the end (delta: 250.7 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,634 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:25:29,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,634 INFO L168 Benchmark]: Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,635 INFO L168 Benchmark]: RCFGBuilder took 241.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,635 INFO L168 Benchmark]: TraceAbstraction took 9297.60 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 765.5 MB). Free memory was 1.1 GB in the beginning and 729.1 MB in the end (delta: 400.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,635 INFO L168 Benchmark]: Witness Printer took 61.74 ms. Allocated memory is still 2.0 GB. Free memory was 729.1 MB in the beginning and 709.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:25:29,637 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.71 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -182.4 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9297.60 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 765.5 MB). Free memory was 1.1 GB in the beginning and 729.1 MB in the end (delta: 400.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 61.74 ms. Allocated memory is still 2.0 GB. Free memory was 729.1 MB in the beginning and 709.7 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. SAFE Result, 9.2s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1433 SDslu, 1995 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50185occurred in iteration=30, 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: 3.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 10271 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 42564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...