./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/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 c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 04:32:37,274 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:32:37,275 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:32:37,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:32:37,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:32:37,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:32:37,285 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:32:37,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:32:37,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:32:37,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:32:37,289 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:32:37,289 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:32:37,290 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:32:37,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:32:37,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:32:37,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:32:37,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:32:37,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:32:37,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:32:37,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:32:37,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:32:37,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:32:37,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:32:37,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:32:37,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:32:37,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:32:37,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:32:37,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:32:37,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:32:37,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:32:37,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:32:37,305 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:32:37,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:32:37,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:32:37,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:32:37,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:32:37,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 04:32:37,317 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:32:37,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:32:37,318 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 04:32:37,318 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 04:32:37,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:32:37,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:32:37,319 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:32:37,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:32:37,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:32:37,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:32:37,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:32:37,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:32:37,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:32:37,321 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 04:32:37,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:32:37,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:32:37,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 04:32:37,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 04:32:37,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 04:32:37,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:32:37,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 04:32:37,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 04:32:37,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:32:37,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 04:32:37,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 04:32:37,323 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_3772421c-fa4f-44a8-9397-caae8a14431d/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-11-23 04:32:37,352 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:32:37,362 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:32:37,365 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:32:37,366 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:32:37,367 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:32:37,367 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:32:37,418 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/data/0ffb6284a/d598b05895714408af507727f98de6a5/FLAG5c35bf223 [2018-11-23 04:32:37,770 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:32:37,770 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:32:37,777 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/data/0ffb6284a/d598b05895714408af507727f98de6a5/FLAG5c35bf223 [2018-11-23 04:32:37,788 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/data/0ffb6284a/d598b05895714408af507727f98de6a5 [2018-11-23 04:32:37,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:32:37,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:32:37,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:32:37,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:32:37,795 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:32:37,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:37,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37, skipping insertion in model container [2018-11-23 04:32:37,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:37,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:32:37,821 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:32:37,948 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:32:37,950 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:32:37,974 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:32:37,985 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:32:37,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37 WrapperNode [2018-11-23 04:32:37,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:32:37,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:32:37,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:32:37,986 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:32:37,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:37,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:32:38,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:32:38,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:32:38,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:32:38,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... [2018-11-23 04:32:38,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:32:38,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:32:38,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:32:38,061 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:32:38,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/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-23 04:32:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 04:32:38,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 04:32:38,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:32:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:32:38,101 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 04:32:38,101 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 04:32:38,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:32:38,309 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 04:32:38,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:32:38 BoogieIcfgContainer [2018-11-23 04:32:38,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:32:38,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 04:32:38,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 04:32:38,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 04:32:38,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:32:37" (1/3) ... [2018-11-23 04:32:38,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740aa873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:32:38, skipping insertion in model container [2018-11-23 04:32:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:32:37" (2/3) ... [2018-11-23 04:32:38,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@740aa873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:32:38, skipping insertion in model container [2018-11-23 04:32:38,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:32:38" (3/3) ... [2018-11-23 04:32:38,315 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 04:32:38,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 04:32:38,329 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 04:32:38,340 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 04:32:38,360 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:32:38,360 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 04:32:38,360 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 04:32:38,360 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 04:32:38,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:32:38,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:32:38,361 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 04:32:38,361 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:32:38,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 04:32:38,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-23 04:32:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 04:32:38,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,377 INFO L402 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-23 04:32:38,379 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-11-23 04:32:38,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,516 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-23 04:32:38,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,531 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-11-23 04:32:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,570 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-11-23 04:32:38,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 04:32:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,580 INFO L225 Difference]: With dead ends: 111 [2018-11-23 04:32:38,580 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 04:32:38,583 INFO L631 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-23 04:32:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 04:32:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-11-23 04:32:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 04:32:38,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-11-23 04:32:38,615 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-11-23 04:32:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:38,616 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-11-23 04:32:38,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-11-23 04:32:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 04:32:38,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,617 INFO L402 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-23 04:32:38,617 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-11-23 04:32:38,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,665 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-23 04:32:38,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,667 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-11-23 04:32:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,702 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-11-23 04:32:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 04:32:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,703 INFO L225 Difference]: With dead ends: 157 [2018-11-23 04:32:38,703 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 04:32:38,704 INFO L631 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-23 04:32:38,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 04:32:38,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-11-23 04:32:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 04:32:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-11-23 04:32:38,711 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-11-23 04:32:38,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:38,711 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-11-23 04:32:38,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:38,711 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-11-23 04:32:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:32:38,712 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,712 INFO L402 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-23 04:32:38,712 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-11-23 04:32:38,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,751 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-23 04:32:38,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,752 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-11-23 04:32:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,774 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-11-23 04:32:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 04:32:38,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,775 INFO L225 Difference]: With dead ends: 144 [2018-11-23 04:32:38,776 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 04:32:38,776 INFO L631 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-23 04:32:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 04:32:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-11-23 04:32:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 04:32:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-11-23 04:32:38,784 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-11-23 04:32:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:38,784 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-11-23 04:32:38,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-11-23 04:32:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:32:38,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,785 INFO L402 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-23 04:32:38,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-11-23 04:32:38,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,827 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-23 04:32:38,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,828 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-11-23 04:32:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,843 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-11-23 04:32:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 04:32:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,845 INFO L225 Difference]: With dead ends: 184 [2018-11-23 04:32:38,845 INFO L226 Difference]: Without dead ends: 182 [2018-11-23 04:32:38,846 INFO L631 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-23 04:32:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-23 04:32:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-11-23 04:32:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 04:32:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-11-23 04:32:38,857 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-11-23 04:32:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:38,857 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-11-23 04:32:38,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-11-23 04:32:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 04:32:38,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,862 INFO L402 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-23 04:32:38,862 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-11-23 04:32:38,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,893 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-23 04:32:38,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,894 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-11-23 04:32:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,907 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-11-23 04:32:38,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 04:32:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,908 INFO L225 Difference]: With dead ends: 304 [2018-11-23 04:32:38,908 INFO L226 Difference]: Without dead ends: 184 [2018-11-23 04:32:38,909 INFO L631 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-23 04:32:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-23 04:32:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-11-23 04:32:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 04:32:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-11-23 04:32:38,919 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-11-23 04:32:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:38,919 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-11-23 04:32:38,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-11-23 04:32:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:32:38,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:38,920 INFO L402 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-23 04:32:38,920 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:38,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-11-23 04:32:38,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:38,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:38,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:38,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:38,963 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-23 04:32:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:38,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:38,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:38,964 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-11-23 04:32:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:38,990 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-11-23 04:32:38,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:38,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 04:32:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:38,992 INFO L225 Difference]: With dead ends: 273 [2018-11-23 04:32:38,992 INFO L226 Difference]: Without dead ends: 186 [2018-11-23 04:32:38,993 INFO L631 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-23 04:32:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-23 04:32:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-11-23 04:32:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 04:32:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-11-23 04:32:39,000 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-11-23 04:32:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,001 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-11-23 04:32:39,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-11-23 04:32:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:32:39,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,002 INFO L402 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-23 04:32:39,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-11-23 04:32:39,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,028 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-23 04:32:39,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,029 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-11-23 04:32:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,040 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-11-23 04:32:39,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 04:32:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,042 INFO L225 Difference]: With dead ends: 348 [2018-11-23 04:32:39,042 INFO L226 Difference]: Without dead ends: 346 [2018-11-23 04:32:39,042 INFO L631 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-23 04:32:39,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-11-23 04:32:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-11-23 04:32:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-23 04:32:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-11-23 04:32:39,051 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-11-23 04:32:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,051 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-11-23 04:32:39,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-11-23 04:32:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:32:39,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,053 INFO L402 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-23 04:32:39,053 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-11-23 04:32:39,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,075 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-23 04:32:39,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,077 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-11-23 04:32:39,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,106 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-11-23 04:32:39,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 04:32:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,108 INFO L225 Difference]: With dead ends: 592 [2018-11-23 04:32:39,108 INFO L226 Difference]: Without dead ends: 354 [2018-11-23 04:32:39,109 INFO L631 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-23 04:32:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-23 04:32:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-11-23 04:32:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-11-23 04:32:39,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-11-23 04:32:39,119 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-11-23 04:32:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,120 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-11-23 04:32:39,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,120 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-11-23 04:32:39,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 04:32:39,121 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,121 INFO L402 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-23 04:32:39,121 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,122 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-11-23 04:32:39,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,154 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-23 04:32:39,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,156 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-11-23 04:32:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,174 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-11-23 04:32:39,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 04:32:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,176 INFO L225 Difference]: With dead ends: 528 [2018-11-23 04:32:39,176 INFO L226 Difference]: Without dead ends: 358 [2018-11-23 04:32:39,176 INFO L631 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-23 04:32:39,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-23 04:32:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-11-23 04:32:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-23 04:32:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-11-23 04:32:39,185 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-11-23 04:32:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,185 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-11-23 04:32:39,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-11-23 04:32:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 04:32:39,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,186 INFO L402 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-23 04:32:39,187 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-11-23 04:32:39,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,214 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-23 04:32:39,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,216 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-11-23 04:32:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,237 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-11-23 04:32:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 04:32:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,240 INFO L225 Difference]: With dead ends: 668 [2018-11-23 04:32:39,240 INFO L226 Difference]: Without dead ends: 666 [2018-11-23 04:32:39,240 INFO L631 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-23 04:32:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-23 04:32:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-11-23 04:32:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-23 04:32:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-11-23 04:32:39,252 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-11-23 04:32:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,253 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-11-23 04:32:39,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-11-23 04:32:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 04:32:39,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,254 INFO L402 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-23 04:32:39,255 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-11-23 04:32:39,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,294 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-23 04:32:39,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,295 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-11-23 04:32:39,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,318 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-11-23 04:32:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 04:32:39,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,320 INFO L225 Difference]: With dead ends: 1164 [2018-11-23 04:32:39,320 INFO L226 Difference]: Without dead ends: 690 [2018-11-23 04:32:39,321 INFO L631 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-23 04:32:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-11-23 04:32:39,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-11-23 04:32:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-11-23 04:32:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-11-23 04:32:39,337 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-11-23 04:32:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,337 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-11-23 04:32:39,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-11-23 04:32:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 04:32:39,338 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,338 INFO L402 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-23 04:32:39,338 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-11-23 04:32:39,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,356 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-23 04:32:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,357 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-11-23 04:32:39,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,379 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-11-23 04:32:39,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 04:32:39,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,381 INFO L225 Difference]: With dead ends: 1032 [2018-11-23 04:32:39,381 INFO L226 Difference]: Without dead ends: 698 [2018-11-23 04:32:39,382 INFO L631 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-23 04:32:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-11-23 04:32:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-11-23 04:32:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-11-23 04:32:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-11-23 04:32:39,395 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-11-23 04:32:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,396 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-11-23 04:32:39,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-11-23 04:32:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 04:32:39,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,397 INFO L402 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-23 04:32:39,397 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,398 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-11-23 04:32:39,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,423 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-23 04:32:39,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,424 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-11-23 04:32:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,448 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-11-23 04:32:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 04:32:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,452 INFO L225 Difference]: With dead ends: 1292 [2018-11-23 04:32:39,452 INFO L226 Difference]: Without dead ends: 1290 [2018-11-23 04:32:39,452 INFO L631 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-23 04:32:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-11-23 04:32:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-11-23 04:32:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-23 04:32:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-11-23 04:32:39,472 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-11-23 04:32:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,472 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-11-23 04:32:39,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,473 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-11-23 04:32:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 04:32:39,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,474 INFO L402 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-23 04:32:39,474 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-11-23 04:32:39,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,494 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-23 04:32:39,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,495 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-11-23 04:32:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,520 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-11-23 04:32:39,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-23 04:32:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,524 INFO L225 Difference]: With dead ends: 2300 [2018-11-23 04:32:39,524 INFO L226 Difference]: Without dead ends: 1354 [2018-11-23 04:32:39,526 INFO L631 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-23 04:32:39,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-11-23 04:32:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-11-23 04:32:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-23 04:32:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-11-23 04:32:39,553 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-11-23 04:32:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,553 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-11-23 04:32:39,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-11-23 04:32:39,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:32:39,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,555 INFO L402 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-23 04:32:39,555 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-11-23 04:32:39,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,586 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-23 04:32:39,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,588 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-11-23 04:32:39,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,611 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-11-23 04:32:39,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 04:32:39,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,615 INFO L225 Difference]: With dead ends: 2028 [2018-11-23 04:32:39,615 INFO L226 Difference]: Without dead ends: 1370 [2018-11-23 04:32:39,616 INFO L631 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-23 04:32:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-23 04:32:39,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-11-23 04:32:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-11-23 04:32:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-11-23 04:32:39,643 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-11-23 04:32:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,644 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-11-23 04:32:39,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-11-23 04:32:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:32:39,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,645 INFO L402 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-23 04:32:39,646 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,646 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-11-23 04:32:39,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,670 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-23 04:32:39,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,671 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-11-23 04:32:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,709 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-11-23 04:32:39,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 04:32:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,714 INFO L225 Difference]: With dead ends: 2508 [2018-11-23 04:32:39,714 INFO L226 Difference]: Without dead ends: 2506 [2018-11-23 04:32:39,715 INFO L631 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-23 04:32:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-11-23 04:32:39,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-11-23 04:32:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-11-23 04:32:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-11-23 04:32:39,754 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-11-23 04:32:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,754 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-11-23 04:32:39,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-11-23 04:32:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 04:32:39,757 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,757 INFO L402 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-23 04:32:39,757 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-11-23 04:32:39,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,794 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-23 04:32:39,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,796 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-11-23 04:32:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:39,834 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-11-23 04:32:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:39,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 04:32:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:39,840 INFO L225 Difference]: With dead ends: 4556 [2018-11-23 04:32:39,840 INFO L226 Difference]: Without dead ends: 2666 [2018-11-23 04:32:39,843 INFO L631 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-23 04:32:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-11-23 04:32:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-11-23 04:32:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-11-23 04:32:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-11-23 04:32:39,932 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-11-23 04:32:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:39,932 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-11-23 04:32:39,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-11-23 04:32:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:32:39,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:39,935 INFO L402 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-23 04:32:39,935 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:39,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:39,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-11-23 04:32:39,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:39,963 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-23 04:32:39,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:39,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:39,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:39,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:39,964 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-11-23 04:32:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:40,024 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-11-23 04:32:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:40,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 04:32:40,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:40,032 INFO L225 Difference]: With dead ends: 3996 [2018-11-23 04:32:40,032 INFO L226 Difference]: Without dead ends: 2698 [2018-11-23 04:32:40,034 INFO L631 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-23 04:32:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-11-23 04:32:40,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-11-23 04:32:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-11-23 04:32:40,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-11-23 04:32:40,103 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-11-23 04:32:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:40,103 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-11-23 04:32:40,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-11-23 04:32:40,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:32:40,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:40,106 INFO L402 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-23 04:32:40,106 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:40,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-11-23 04:32:40,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:40,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:40,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:40,130 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-23 04:32:40,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:40,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:40,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:40,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:40,131 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-11-23 04:32:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:40,200 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-11-23 04:32:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:40,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 04:32:40,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:40,214 INFO L225 Difference]: With dead ends: 4876 [2018-11-23 04:32:40,214 INFO L226 Difference]: Without dead ends: 4874 [2018-11-23 04:32:40,216 INFO L631 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-23 04:32:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-11-23 04:32:40,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-11-23 04:32:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-11-23 04:32:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-11-23 04:32:40,323 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-11-23 04:32:40,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:40,323 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-11-23 04:32:40,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-11-23 04:32:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 04:32:40,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:40,328 INFO L402 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-23 04:32:40,328 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:40,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-11-23 04:32:40,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:40,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:40,350 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-23 04:32:40,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:40,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:40,351 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-11-23 04:32:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:40,437 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-11-23 04:32:40,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:40,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 04:32:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:40,453 INFO L225 Difference]: With dead ends: 9036 [2018-11-23 04:32:40,453 INFO L226 Difference]: Without dead ends: 5258 [2018-11-23 04:32:40,459 INFO L631 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-23 04:32:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-11-23 04:32:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-11-23 04:32:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-11-23 04:32:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-11-23 04:32:40,597 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-11-23 04:32:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:40,597 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-11-23 04:32:40,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-11-23 04:32:40,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 04:32:40,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:40,603 INFO L402 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-23 04:32:40,603 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:40,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:40,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-11-23 04:32:40,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:40,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:40,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:40,618 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-23 04:32:40,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:40,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:40,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:40,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:40,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:40,619 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-11-23 04:32:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:40,694 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-11-23 04:32:40,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:40,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 04:32:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:40,704 INFO L225 Difference]: With dead ends: 7884 [2018-11-23 04:32:40,704 INFO L226 Difference]: Without dead ends: 5322 [2018-11-23 04:32:40,709 INFO L631 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-23 04:32:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-11-23 04:32:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-11-23 04:32:40,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-11-23 04:32:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-11-23 04:32:40,840 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-11-23 04:32:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:40,840 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-11-23 04:32:40,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:40,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-11-23 04:32:40,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 04:32:40,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:40,845 INFO L402 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-23 04:32:40,845 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:40,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:40,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-11-23 04:32:40,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:40,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:40,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:40,870 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-23 04:32:40,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:40,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:40,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:40,871 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-11-23 04:32:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:41,020 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-11-23 04:32:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:41,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 04:32:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:41,042 INFO L225 Difference]: With dead ends: 15564 [2018-11-23 04:32:41,042 INFO L226 Difference]: Without dead ends: 10378 [2018-11-23 04:32:41,053 INFO L631 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-23 04:32:41,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-11-23 04:32:41,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-11-23 04:32:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 04:32:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-11-23 04:32:41,335 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-11-23 04:32:41,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:41,335 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-11-23 04:32:41,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-11-23 04:32:41,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 04:32:41,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:41,342 INFO L402 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-23 04:32:41,343 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:41,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:41,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-11-23 04:32:41,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:41,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:41,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:41,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:41,362 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-23 04:32:41,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:41,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:41,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:41,363 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-11-23 04:32:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:41,525 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-11-23 04:32:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:41,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-23 04:32:41,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:41,546 INFO L225 Difference]: With dead ends: 12172 [2018-11-23 04:32:41,546 INFO L226 Difference]: Without dead ends: 12170 [2018-11-23 04:32:41,551 INFO L631 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-23 04:32:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-11-23 04:32:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-11-23 04:32:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-11-23 04:32:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-11-23 04:32:41,752 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-11-23 04:32:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:41,752 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-11-23 04:32:41,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:41,752 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-11-23 04:32:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 04:32:41,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:41,760 INFO L402 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-23 04:32:41,760 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:41,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:41,760 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-11-23 04:32:41,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:41,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:41,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:41,775 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-23 04:32:41,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:41,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:41,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:41,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:41,776 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-11-23 04:32:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:41,957 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-11-23 04:32:41,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:41,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 04:32:41,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:41,985 INFO L225 Difference]: With dead ends: 18316 [2018-11-23 04:32:41,985 INFO L226 Difference]: Without dead ends: 18314 [2018-11-23 04:32:41,990 INFO L631 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-23 04:32:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-11-23 04:32:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-11-23 04:32:42,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-11-23 04:32:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-11-23 04:32:42,257 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-11-23 04:32:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:42,258 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-11-23 04:32:42,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-11-23 04:32:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 04:32:42,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:42,275 INFO L402 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-23 04:32:42,275 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:42,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-11-23 04:32:42,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:42,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:42,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:42,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:42,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-23 04:32:42,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:42,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:42,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:42,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:42,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:42,345 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-11-23 04:32:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:42,542 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-11-23 04:32:42,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:42,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-23 04:32:42,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:42,562 INFO L225 Difference]: With dead ends: 35468 [2018-11-23 04:32:42,562 INFO L226 Difference]: Without dead ends: 20362 [2018-11-23 04:32:42,575 INFO L631 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-23 04:32:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-11-23 04:32:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-11-23 04:32:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-11-23 04:32:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-11-23 04:32:42,791 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-11-23 04:32:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:42,791 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-11-23 04:32:42,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-11-23 04:32:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:32:42,800 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:42,800 INFO L402 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, 1] [2018-11-23 04:32:42,801 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:42,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:42,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-11-23 04:32:42,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:42,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:42,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:42,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:42,822 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-23 04:32:42,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:42,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:42,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:42,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:42,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:42,823 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-11-23 04:32:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:42,965 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-11-23 04:32:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:42,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 04:32:42,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:42,983 INFO L225 Difference]: With dead ends: 30732 [2018-11-23 04:32:42,983 INFO L226 Difference]: Without dead ends: 20746 [2018-11-23 04:32:42,991 INFO L631 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-23 04:32:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-11-23 04:32:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-11-23 04:32:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-11-23 04:32:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-11-23 04:32:43,261 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-11-23 04:32:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:43,261 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-11-23 04:32:43,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-11-23 04:32:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:32:43,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:43,270 INFO L402 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, 1] [2018-11-23 04:32:43,270 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:43,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:43,270 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-11-23 04:32:43,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:43,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:43,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:43,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:43,290 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-23 04:32:43,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:43,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:43,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:43,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:43,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:43,291 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-11-23 04:32:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:43,515 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-11-23 04:32:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:43,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 04:32:43,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:43,537 INFO L225 Difference]: With dead ends: 35852 [2018-11-23 04:32:43,538 INFO L226 Difference]: Without dead ends: 35850 [2018-11-23 04:32:43,543 INFO L631 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-23 04:32:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-11-23 04:32:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-11-23 04:32:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-11-23 04:32:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-11-23 04:32:44,035 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-11-23 04:32:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:44,035 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-11-23 04:32:44,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:44,035 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-11-23 04:32:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 04:32:44,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:44,047 INFO L402 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, 1] [2018-11-23 04:32:44,047 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:44,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-11-23 04:32:44,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:44,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:44,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:44,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:44,074 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-23 04:32:44,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:44,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:44,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:44,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:44,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:44,075 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-11-23 04:32:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:44,382 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-11-23 04:32:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:44,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-23 04:32:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:44,409 INFO L225 Difference]: With dead ends: 70668 [2018-11-23 04:32:44,409 INFO L226 Difference]: Without dead ends: 40458 [2018-11-23 04:32:44,430 INFO L631 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-23 04:32:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-11-23 04:32:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-11-23 04:32:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-11-23 04:32:44,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-11-23 04:32:44,989 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-11-23 04:32:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:44,989 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-11-23 04:32:44,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:44,989 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-11-23 04:32:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:32:45,000 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:45,000 INFO L402 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, 1, 1] [2018-11-23 04:32:45,001 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:45,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-11-23 04:32:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:45,022 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-23 04:32:45,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:45,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:45,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:45,023 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-11-23 04:32:45,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:45,334 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-11-23 04:32:45,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:45,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 04:32:45,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:45,361 INFO L225 Difference]: With dead ends: 60684 [2018-11-23 04:32:45,361 INFO L226 Difference]: Without dead ends: 40970 [2018-11-23 04:32:45,377 INFO L631 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-23 04:32:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-11-23 04:32:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-11-23 04:32:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-11-23 04:32:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-11-23 04:32:45,801 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-11-23 04:32:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:45,801 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-11-23 04:32:45,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-11-23 04:32:45,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:32:45,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:45,812 INFO L402 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, 1, 1] [2018-11-23 04:32:45,812 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:45,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:45,813 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-11-23 04:32:45,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:45,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:45,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:45,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:45,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:45,834 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-23 04:32:45,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:45,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:45,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:45,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:45,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:45,835 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-11-23 04:32:46,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:46,535 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-11-23 04:32:46,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:46,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 04:32:46,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:46,569 INFO L225 Difference]: With dead ends: 69644 [2018-11-23 04:32:46,569 INFO L226 Difference]: Without dead ends: 69642 [2018-11-23 04:32:46,575 INFO L631 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-23 04:32:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-11-23 04:32:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-11-23 04:32:47,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-11-23 04:32:47,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-11-23 04:32:47,255 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-11-23 04:32:47,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:47,255 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-11-23 04:32:47,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:47,255 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-11-23 04:32:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 04:32:47,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:47,282 INFO L402 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, 1, 1] [2018-11-23 04:32:47,282 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:47,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-11-23 04:32:47,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:47,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:47,310 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-23 04:32:47,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:47,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:47,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:47,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:47,311 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-11-23 04:32:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:48,212 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-11-23 04:32:48,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:48,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-23 04:32:48,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:48,266 INFO L225 Difference]: With dead ends: 140300 [2018-11-23 04:32:48,266 INFO L226 Difference]: Without dead ends: 79882 [2018-11-23 04:32:48,297 INFO L631 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-23 04:32:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-11-23 04:32:49,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-11-23 04:32:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-11-23 04:32:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-11-23 04:32:49,313 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-11-23 04:32:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:49,313 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-11-23 04:32:49,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-11-23 04:32:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 04:32:49,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:49,340 INFO L402 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, 1, 1, 1] [2018-11-23 04:32:49,340 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:49,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:49,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-11-23 04:32:49,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:49,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:49,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:49,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:49,379 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-23 04:32:49,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:49,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:49,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:49,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:49,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:49,380 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-11-23 04:32:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:50,363 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-11-23 04:32:50,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:50,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 04:32:50,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:50,417 INFO L225 Difference]: With dead ends: 119820 [2018-11-23 04:32:50,418 INFO L226 Difference]: Without dead ends: 80906 [2018-11-23 04:32:50,437 INFO L631 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-23 04:32:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-11-23 04:32:51,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-11-23 04:32:51,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-11-23 04:32:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-11-23 04:32:51,461 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-11-23 04:32:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:51,461 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-11-23 04:32:51,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-11-23 04:32:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 04:32:51,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:51,488 INFO L402 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, 1, 1, 1] [2018-11-23 04:32:51,488 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:51,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-11-23 04:32:51,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:51,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:51,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:51,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:51,522 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-23 04:32:51,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:51,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:51,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:51,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:51,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:51,523 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-11-23 04:32:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:52,810 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-11-23 04:32:52,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:52,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 04:32:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:52,908 INFO L225 Difference]: With dead ends: 135180 [2018-11-23 04:32:52,909 INFO L226 Difference]: Without dead ends: 135178 [2018-11-23 04:32:52,922 INFO L631 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-23 04:32:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-11-23 04:32:54,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-11-23 04:32:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-11-23 04:32:54,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-11-23 04:32:54,415 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-11-23 04:32:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:32:54,415 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-11-23 04:32:54,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:32:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-11-23 04:32:54,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 04:32:54,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:32:54,489 INFO L402 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, 1, 1, 1] [2018-11-23 04:32:54,489 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:32:54,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:32:54,490 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-11-23 04:32:54,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:32:54,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:32:54,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:54,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:32:54,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:32:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:32:54,520 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-23 04:32:54,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:32:54,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:32:54,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:32:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:32:54,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:32:54,521 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-11-23 04:32:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:32:56,097 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-11-23 04:32:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:32:56,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 04:32:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:32:56,224 INFO L225 Difference]: With dead ends: 278540 [2018-11-23 04:32:56,225 INFO L226 Difference]: Without dead ends: 157706 [2018-11-23 04:32:56,293 INFO L631 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-23 04:32:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-11-23 04:33:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-11-23 04:33:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-11-23 04:33:00,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-11-23 04:33:00,270 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-11-23 04:33:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:00,270 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-11-23 04:33:00,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-11-23 04:33:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:33:00,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:00,328 INFO L402 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, 1, 1, 1, 1] [2018-11-23 04:33:00,328 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:00,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-11-23 04:33:00,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:00,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:00,359 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-23 04:33:00,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:00,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:00,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:00,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:00,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:00,359 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-11-23 04:33:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:01,701 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-11-23 04:33:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:01,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 04:33:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:01,838 INFO L225 Difference]: With dead ends: 236556 [2018-11-23 04:33:01,838 INFO L226 Difference]: Without dead ends: 159754 [2018-11-23 04:33:01,892 INFO L631 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-23 04:33:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-11-23 04:33:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-11-23 04:33:04,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-11-23 04:33:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-11-23 04:33:04,518 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-11-23 04:33:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-11-23 04:33:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:04,519 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-11-23 04:33:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:33:04,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:04,578 INFO L402 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, 1, 1, 1, 1] [2018-11-23 04:33:04,578 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:04,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-11-23 04:33:04,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:04,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:04,615 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-23 04:33:04,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:04,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:04,616 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-11-23 04:33:06,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:06,901 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-11-23 04:33:06,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:06,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 04:33:06,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:07,124 INFO L225 Difference]: With dead ends: 262156 [2018-11-23 04:33:07,125 INFO L226 Difference]: Without dead ends: 262154 [2018-11-23 04:33:07,170 INFO L631 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-23 04:33:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-11-23 04:33:10,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-11-23 04:33:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-11-23 04:33:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-11-23 04:33:10,621 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-11-23 04:33:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:10,621 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-11-23 04:33:10,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-11-23 04:33:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 04:33:10,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:10,736 INFO L402 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, 1, 1, 1, 1] [2018-11-23 04:33:10,736 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:10,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-11-23 04:33:10,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:10,763 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-23 04:33:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:10,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:10,764 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-11-23 04:33:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:14,128 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-11-23 04:33:14,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:14,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 04:33:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:14,378 INFO L225 Difference]: With dead ends: 552972 [2018-11-23 04:33:14,378 INFO L226 Difference]: Without dead ends: 311306 [2018-11-23 04:33:14,497 INFO L631 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-23 04:33:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-11-23 04:33:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-11-23 04:33:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-11-23 04:33:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-11-23 04:33:21,891 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-11-23 04:33:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:21,891 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-11-23 04:33:21,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-11-23 04:33:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:33:22,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:22,015 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 04:33:22,015 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:22,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-11-23 04:33:22,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:22,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:22,043 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-23 04:33:22,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:22,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:22,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:22,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:22,044 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-11-23 04:33:25,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:25,247 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-11-23 04:33:25,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:25,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 04:33:25,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:25,499 INFO L225 Difference]: With dead ends: 466956 [2018-11-23 04:33:25,499 INFO L226 Difference]: Without dead ends: 315402 [2018-11-23 04:33:25,586 INFO L631 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-23 04:33:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-11-23 04:33:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-11-23 04:33:30,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-11-23 04:33:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-11-23 04:33:30,534 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-11-23 04:33:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:30,534 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-11-23 04:33:30,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-11-23 04:33:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:33:30,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:30,658 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 04:33:30,658 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:30,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:30,658 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-11-23 04:33:30,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:30,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:30,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:30,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:30,688 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-23 04:33:30,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:30,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:30,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:30,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:30,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:30,689 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-11-23 04:33:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:36,032 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-11-23 04:33:36,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:36,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 04:33:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:36,446 INFO L225 Difference]: With dead ends: 507914 [2018-11-23 04:33:36,447 INFO L226 Difference]: Without dead ends: 507912 [2018-11-23 04:33:36,493 INFO L631 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-23 04:33:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-11-23 04:33:45,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-11-23 04:33:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-11-23 04:33:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-11-23 04:33:45,985 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-11-23 04:33:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:45,985 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-11-23 04:33:45,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:45,986 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-11-23 04:33:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 04:33:46,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:33:46,238 INFO L402 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, 1, 1, 1, 1, 1] [2018-11-23 04:33:46,238 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:33:46,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:33:46,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-11-23 04:33:46,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:33:46,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:33:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:46,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:33:46,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:33:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:33:46,271 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-23 04:33:46,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:33:46,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:33:46,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 04:33:46,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:33:46,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:33:46,272 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-11-23 04:33:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:33:53,561 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-11-23 04:33:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:33:53,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-23 04:33:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:33:53,561 INFO L225 Difference]: With dead ends: 1097736 [2018-11-23 04:33:53,561 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:33:53,915 INFO L631 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-23 04:33:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:33:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:33:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:33:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:33:53,916 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-11-23 04:33:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:33:53,916 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:33:53,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 04:33:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:33:53,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:33:53,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:33:53,977 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 04:33:53,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:33:53,977 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 04:33:53,978 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,978 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,979 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-23 04:33:53,980 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,981 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-23 04:33:53,982 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-11-23 04:33:53,982 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-11-23 04:33:53,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:33:53 BoogieIcfgContainer [2018-11-23 04:33:53,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:33:53,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:33:53,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:33:53,988 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:33:53,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:32:38" (3/4) ... [2018-11-23 04:33:53,992 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:33:53,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:33:53,999 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:33:54,005 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 04:33:54,005 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 04:33:54,006 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 04:33:54,054 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3772421c-fa4f-44a8-9397-caae8a14431d/bin-2019/uautomizer/witness.graphml [2018-11-23 04:33:54,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:33:54,055 INFO L168 Benchmark]: Toolchain (without parser) took 76263.89 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 960.2 MB in the beginning and 2.5 GB in the end (delta: -1.6 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,057 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:33:54,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 193.35 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.57 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:33:54,057 INFO L168 Benchmark]: Boogie Preprocessor took 58.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,058 INFO L168 Benchmark]: RCFGBuilder took 248.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,058 INFO L168 Benchmark]: TraceAbstraction took 75677.80 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,058 INFO L168 Benchmark]: Witness Printer took 66.49 ms. Allocated memory is still 6.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2018-11-23 04:33:54,061 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 193.35 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 946.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.57 ms. Allocated memory is still 1.0 GB. Free memory is still 946.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -200.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 248.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75677.80 ms. Allocated memory was 1.2 GB in the beginning and 6.2 GB in the end (delta: 5.0 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 66.49 ms. Allocated memory is still 6.2 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 75.6s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 33.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 39.5s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 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.9s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...