./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/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 7540c95af84ce36a44a847aa5fc0422896a0f0bd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 20:19:58,888 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:19:58,889 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:19:58,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:19:58,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:19:58,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:19:58,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:19:58,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:19:58,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:19:58,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:19:58,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:19:58,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:19:58,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:19:58,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:19:58,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:19:58,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:19:58,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:19:58,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:19:58,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:19:58,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:19:58,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:19:58,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:19:58,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:19:58,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:19:58,915 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:19:58,916 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:19:58,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:19:58,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:19:58,918 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:19:58,919 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:19:58,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:19:58,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:19:58,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:19:58,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:19:58,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:19:58,921 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:19:58,921 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 20:19:58,931 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:19:58,931 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:19:58,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:19:58,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:19:58,932 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:19:58,932 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:19:58,932 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:19:58,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:19:58,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:19:58,934 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:19:58,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:19:58,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:19:58,934 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_e55cc32e-064a-47ce-8db2-b12791cfd7d6/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 -> 7540c95af84ce36a44a847aa5fc0422896a0f0bd [2018-12-08 20:19:58,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:19:58,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:19:58,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:19:58,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:19:58,962 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:19:58,962 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/../../sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-08 20:19:58,996 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/data/fed41c5b9/84386085f5a34869958140d97bc489c3/FLAGd3791346d [2018-12-08 20:19:59,449 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:19:59,449 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/sv-benchmarks/c/pthread/singleton_false-unreach-call.i [2018-12-08 20:19:59,457 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/data/fed41c5b9/84386085f5a34869958140d97bc489c3/FLAGd3791346d [2018-12-08 20:19:59,466 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/data/fed41c5b9/84386085f5a34869958140d97bc489c3 [2018-12-08 20:19:59,467 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:19:59,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:19:59,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:19:59,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:19:59,471 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:19:59,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58dfd927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59, skipping insertion in model container [2018-12-08 20:19:59,473 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:19:59,498 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:19:59,734 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:19:59,740 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:19:59,799 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:19:59,858 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:19:59,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59 WrapperNode [2018-12-08 20:19:59,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:19:59,859 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:19:59,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:19:59,859 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:19:59,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:19:59,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:19:59,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:19:59,887 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:19:59,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... [2018-12-08 20:19:59,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:19:59,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:19:59,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:19:59,901 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:19:59,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/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-12-08 20:19:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:19:59,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2018-12-08 20:19:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2018-12-08 20:19:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2018-12-08 20:19:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2018-12-08 20:19:59,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2018-12-08 20:19:59,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 20:19:59,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:19:59,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:19:59,933 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 20:20:00,106 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:20:00,106 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 20:20:00,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:20:00 BoogieIcfgContainer [2018-12-08 20:20:00,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:20:00,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:20:00,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:20:00,109 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:20:00,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:19:59" (1/3) ... [2018-12-08 20:20:00,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4658fc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:20:00, skipping insertion in model container [2018-12-08 20:20:00,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:19:59" (2/3) ... [2018-12-08 20:20:00,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4658fc7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:20:00, skipping insertion in model container [2018-12-08 20:20:00,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:20:00" (3/3) ... [2018-12-08 20:20:00,111 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_false-unreach-call.i [2018-12-08 20:20:00,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,142 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,142 WARN L317 ript$VariableManager]: TermVariabe Thread2_thread0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,142 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,143 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,144 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,145 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,146 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,147 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,148 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,149 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,150 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,151 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,152 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread2_thread0_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe Thread4_thread1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,153 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#t~malloc0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread4_thread1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,154 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe Thread3_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe |Thread3_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe Thread1_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,155 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe Thread5_thread2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,156 WARN L317 ript$VariableManager]: TermVariabe |Thread5_thread2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe Thread0_thread3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thread3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 20:20:00,267 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 20:20:00,267 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:20:00,272 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:20:00,282 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:20:00,297 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:20:00,298 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:20:00,298 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:20:00,298 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:20:00,298 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:20:00,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:20:00,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:20:00,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:20:00,298 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:20:00,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139places, 232 transitions [2018-12-08 20:20:02,540 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47312 states. [2018-12-08 20:20:02,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47312 states. [2018-12-08 20:20:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 20:20:02,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:02,548 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-12-08 20:20:02,550 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:02,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:02,553 INFO L82 PathProgramCache]: Analyzing trace with hash 2057999791, now seen corresponding path program 1 times [2018-12-08 20:20:02,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:02,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:02,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:02,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:02,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:20:02,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:20:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:20:02,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:20:02,719 INFO L87 Difference]: Start difference. First operand 47312 states. Second operand 5 states. [2018-12-08 20:20:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:03,161 INFO L93 Difference]: Finished difference Result 53970 states and 232571 transitions. [2018-12-08 20:20:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:20:03,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-08 20:20:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:03,302 INFO L225 Difference]: With dead ends: 53970 [2018-12-08 20:20:03,302 INFO L226 Difference]: Without dead ends: 38045 [2018-12-08 20:20:03,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:03,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38045 states. [2018-12-08 20:20:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38045 to 31406. [2018-12-08 20:20:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-12-08 20:20:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-12-08 20:20:04,050 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-12-08 20:20:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:04,050 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-12-08 20:20:04,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:20:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-12-08 20:20:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 20:20:04,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:04,052 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-12-08 20:20:04,052 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:04,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash 973446305, now seen corresponding path program 2 times [2018-12-08 20:20:04,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:04,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:04,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:04,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:04,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:20:04,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:20:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:20:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:20:04,151 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-12-08 20:20:04,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:04,613 INFO L93 Difference]: Finished difference Result 38063 states and 167101 transitions. [2018-12-08 20:20:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:20:04,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-08 20:20:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:04,705 INFO L225 Difference]: With dead ends: 38063 [2018-12-08 20:20:04,705 INFO L226 Difference]: Without dead ends: 38063 [2018-12-08 20:20:04,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:20:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38063 states. [2018-12-08 20:20:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38063 to 31406. [2018-12-08 20:20:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2018-12-08 20:20:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 135820 transitions. [2018-12-08 20:20:05,246 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 135820 transitions. Word has length 31 [2018-12-08 20:20:05,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:05,247 INFO L480 AbstractCegarLoop]: Abstraction has 31406 states and 135820 transitions. [2018-12-08 20:20:05,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:20:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 135820 transitions. [2018-12-08 20:20:05,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 20:20:05,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:05,248 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-12-08 20:20:05,248 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:05,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash -320847025, now seen corresponding path program 3 times [2018-12-08 20:20:05,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:05,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:05,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:05,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:05,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:05,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:20:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:20:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:20:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:20:05,339 INFO L87 Difference]: Start difference. First operand 31406 states and 135820 transitions. Second operand 10 states. [2018-12-08 20:20:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:05,829 INFO L93 Difference]: Finished difference Result 44676 states and 198308 transitions. [2018-12-08 20:20:05,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:20:05,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-12-08 20:20:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:05,917 INFO L225 Difference]: With dead ends: 44676 [2018-12-08 20:20:05,917 INFO L226 Difference]: Without dead ends: 44676 [2018-12-08 20:20:05,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:20:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44676 states. [2018-12-08 20:20:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44676 to 31363. [2018-12-08 20:20:06,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31363 states. [2018-12-08 20:20:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31363 states to 31363 states and 135747 transitions. [2018-12-08 20:20:06,479 INFO L78 Accepts]: Start accepts. Automaton has 31363 states and 135747 transitions. Word has length 31 [2018-12-08 20:20:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:06,479 INFO L480 AbstractCegarLoop]: Abstraction has 31363 states and 135747 transitions. [2018-12-08 20:20:06,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:20:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31363 states and 135747 transitions. [2018-12-08 20:20:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 20:20:06,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:06,483 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, 1, 1, 1, 1] [2018-12-08 20:20:06,484 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:06,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1852887775, now seen corresponding path program 1 times [2018-12-08 20:20:06,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:06,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:06,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:06,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:06,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:06,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-12-08 20:20:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:06,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:20:06,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:20:06,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:20:06,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:20:06,521 INFO L87 Difference]: Start difference. First operand 31363 states and 135747 transitions. Second operand 5 states. [2018-12-08 20:20:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:06,793 INFO L93 Difference]: Finished difference Result 37553 states and 163554 transitions. [2018-12-08 20:20:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:20:06,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-12-08 20:20:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:06,865 INFO L225 Difference]: With dead ends: 37553 [2018-12-08 20:20:06,865 INFO L226 Difference]: Without dead ends: 37553 [2018-12-08 20:20:06,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37553 states. [2018-12-08 20:20:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37553 to 35090. [2018-12-08 20:20:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35090 states. [2018-12-08 20:20:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35090 states to 35090 states and 153591 transitions. [2018-12-08 20:20:07,415 INFO L78 Accepts]: Start accepts. Automaton has 35090 states and 153591 transitions. Word has length 41 [2018-12-08 20:20:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:07,415 INFO L480 AbstractCegarLoop]: Abstraction has 35090 states and 153591 transitions. [2018-12-08 20:20:07,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:20:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35090 states and 153591 transitions. [2018-12-08 20:20:07,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-08 20:20:07,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:07,418 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, 1, 1, 1, 1] [2018-12-08 20:20:07,419 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:07,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash 931900819, now seen corresponding path program 2 times [2018-12-08 20:20:07,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:07,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:07,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:07,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:07,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:07,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:07,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:20:07,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:20:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:20:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:20:07,464 INFO L87 Difference]: Start difference. First operand 35090 states and 153591 transitions. Second operand 6 states. [2018-12-08 20:20:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:07,857 INFO L93 Difference]: Finished difference Result 74225 states and 316462 transitions. [2018-12-08 20:20:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:20:07,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-12-08 20:20:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:07,945 INFO L225 Difference]: With dead ends: 74225 [2018-12-08 20:20:07,945 INFO L226 Difference]: Without dead ends: 46038 [2018-12-08 20:20:07,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:20:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46038 states. [2018-12-08 20:20:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46038 to 35487. [2018-12-08 20:20:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35487 states. [2018-12-08 20:20:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35487 states to 35487 states and 149277 transitions. [2018-12-08 20:20:08,659 INFO L78 Accepts]: Start accepts. Automaton has 35487 states and 149277 transitions. Word has length 41 [2018-12-08 20:20:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 35487 states and 149277 transitions. [2018-12-08 20:20:08,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:20:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 35487 states and 149277 transitions. [2018-12-08 20:20:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 20:20:08,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:08,667 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, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:08,667 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:08,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1536072140, now seen corresponding path program 1 times [2018-12-08 20:20:08,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:08,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:08,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:08,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:08,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:20:08,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:20:08,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:20:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:08,725 INFO L87 Difference]: Start difference. First operand 35487 states and 149277 transitions. Second operand 7 states. [2018-12-08 20:20:09,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:09,018 INFO L93 Difference]: Finished difference Result 42305 states and 178055 transitions. [2018-12-08 20:20:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:20:09,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-12-08 20:20:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:09,095 INFO L225 Difference]: With dead ends: 42305 [2018-12-08 20:20:09,095 INFO L226 Difference]: Without dead ends: 42233 [2018-12-08 20:20:09,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:20:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42233 states. [2018-12-08 20:20:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42233 to 35466. [2018-12-08 20:20:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35466 states. [2018-12-08 20:20:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35466 states to 35466 states and 149245 transitions. [2018-12-08 20:20:09,665 INFO L78 Accepts]: Start accepts. Automaton has 35466 states and 149245 transitions. Word has length 43 [2018-12-08 20:20:09,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:09,665 INFO L480 AbstractCegarLoop]: Abstraction has 35466 states and 149245 transitions. [2018-12-08 20:20:09,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:20:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 35466 states and 149245 transitions. [2018-12-08 20:20:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 20:20:09,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:09,671 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, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:09,671 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:09,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:09,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1098530636, now seen corresponding path program 2 times [2018-12-08 20:20:09,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:09,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:09,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:09,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:09,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 20:20:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 20:20:09,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 20:20:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 20:20:09,737 INFO L87 Difference]: Start difference. First operand 35466 states and 149245 transitions. Second operand 10 states. [2018-12-08 20:20:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:10,263 INFO L93 Difference]: Finished difference Result 49948 states and 204487 transitions. [2018-12-08 20:20:10,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:20:10,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-08 20:20:10,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:10,346 INFO L225 Difference]: With dead ends: 49948 [2018-12-08 20:20:10,346 INFO L226 Difference]: Without dead ends: 45132 [2018-12-08 20:20:10,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:20:10,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45132 states. [2018-12-08 20:20:10,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45132 to 35381. [2018-12-08 20:20:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35381 states. [2018-12-08 20:20:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35381 states to 35381 states and 148987 transitions. [2018-12-08 20:20:10,937 INFO L78 Accepts]: Start accepts. Automaton has 35381 states and 148987 transitions. Word has length 43 [2018-12-08 20:20:10,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:10,937 INFO L480 AbstractCegarLoop]: Abstraction has 35381 states and 148987 transitions. [2018-12-08 20:20:10,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 20:20:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35381 states and 148987 transitions. [2018-12-08 20:20:10,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:20:10,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:10,944 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:10,944 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:10,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:10,945 INFO L82 PathProgramCache]: Analyzing trace with hash 819464228, now seen corresponding path program 1 times [2018-12-08 20:20:10,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:10,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:10,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:10,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:20:10,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:20:10,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:20:10,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:20:10,984 INFO L87 Difference]: Start difference. First operand 35381 states and 148987 transitions. Second operand 5 states. [2018-12-08 20:20:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:11,196 INFO L93 Difference]: Finished difference Result 41392 states and 173197 transitions. [2018-12-08 20:20:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:20:11,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-08 20:20:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:11,272 INFO L225 Difference]: With dead ends: 41392 [2018-12-08 20:20:11,272 INFO L226 Difference]: Without dead ends: 40912 [2018-12-08 20:20:11,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40912 states. [2018-12-08 20:20:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40912 to 38964. [2018-12-08 20:20:11,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38964 states. [2018-12-08 20:20:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38964 states to 38964 states and 164377 transitions. [2018-12-08 20:20:11,856 INFO L78 Accepts]: Start accepts. Automaton has 38964 states and 164377 transitions. Word has length 44 [2018-12-08 20:20:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:11,856 INFO L480 AbstractCegarLoop]: Abstraction has 38964 states and 164377 transitions. [2018-12-08 20:20:11,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:20:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38964 states and 164377 transitions. [2018-12-08 20:20:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:20:11,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:11,864 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:11,864 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:11,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash 868178546, now seen corresponding path program 2 times [2018-12-08 20:20:11,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:11,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:11,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:11,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:11,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:11,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:20:11,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:20:11,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:20:11,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:11,933 INFO L87 Difference]: Start difference. First operand 38964 states and 164377 transitions. Second operand 7 states. [2018-12-08 20:20:12,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:12,326 INFO L93 Difference]: Finished difference Result 41851 states and 174247 transitions. [2018-12-08 20:20:12,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:20:12,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-12-08 20:20:12,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:12,397 INFO L225 Difference]: With dead ends: 41851 [2018-12-08 20:20:12,397 INFO L226 Difference]: Without dead ends: 41371 [2018-12-08 20:20:12,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:20:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41371 states. [2018-12-08 20:20:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41371 to 36092. [2018-12-08 20:20:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36092 states. [2018-12-08 20:20:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36092 states to 36092 states and 150963 transitions. [2018-12-08 20:20:12,948 INFO L78 Accepts]: Start accepts. Automaton has 36092 states and 150963 transitions. Word has length 44 [2018-12-08 20:20:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:12,948 INFO L480 AbstractCegarLoop]: Abstraction has 36092 states and 150963 transitions. [2018-12-08 20:20:12,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:20:12,948 INFO L276 IsEmpty]: Start isEmpty. Operand 36092 states and 150963 transitions. [2018-12-08 20:20:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:20:12,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:12,956 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:12,956 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:12,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:12,956 INFO L82 PathProgramCache]: Analyzing trace with hash -108546428, now seen corresponding path program 3 times [2018-12-08 20:20:12,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:12,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:12,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:12,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:12,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:13,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:13,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 20:20:13,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:20:13,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:20:13,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:20:13,249 INFO L87 Difference]: Start difference. First operand 36092 states and 150963 transitions. Second operand 17 states. [2018-12-08 20:20:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:14,271 INFO L93 Difference]: Finished difference Result 43003 states and 180466 transitions. [2018-12-08 20:20:14,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 20:20:14,271 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-12-08 20:20:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:14,350 INFO L225 Difference]: With dead ends: 43003 [2018-12-08 20:20:14,350 INFO L226 Difference]: Without dead ends: 42757 [2018-12-08 20:20:14,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-12-08 20:20:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42757 states. [2018-12-08 20:20:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42757 to 39101. [2018-12-08 20:20:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39101 states. [2018-12-08 20:20:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39101 states to 39101 states and 165551 transitions. [2018-12-08 20:20:14,949 INFO L78 Accepts]: Start accepts. Automaton has 39101 states and 165551 transitions. Word has length 44 [2018-12-08 20:20:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:14,950 INFO L480 AbstractCegarLoop]: Abstraction has 39101 states and 165551 transitions. [2018-12-08 20:20:14,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:20:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 39101 states and 165551 transitions. [2018-12-08 20:20:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-08 20:20:14,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:14,958 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:14,958 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:14,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1310405846, now seen corresponding path program 4 times [2018-12-08 20:20:14,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:14,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:14,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:15,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:15,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:20:15,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:20:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:20:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:20:15,119 INFO L87 Difference]: Start difference. First operand 39101 states and 165551 transitions. Second operand 14 states. [2018-12-08 20:20:15,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:15,626 INFO L93 Difference]: Finished difference Result 52387 states and 222062 transitions. [2018-12-08 20:20:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:20:15,626 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-12-08 20:20:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:15,731 INFO L225 Difference]: With dead ends: 52387 [2018-12-08 20:20:15,731 INFO L226 Difference]: Without dead ends: 52141 [2018-12-08 20:20:15,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-12-08 20:20:15,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52141 states. [2018-12-08 20:20:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52141 to 39028. [2018-12-08 20:20:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39028 states. [2018-12-08 20:20:16,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39028 states to 39028 states and 165324 transitions. [2018-12-08 20:20:16,398 INFO L78 Accepts]: Start accepts. Automaton has 39028 states and 165324 transitions. Word has length 44 [2018-12-08 20:20:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:16,398 INFO L480 AbstractCegarLoop]: Abstraction has 39028 states and 165324 transitions. [2018-12-08 20:20:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:20:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 39028 states and 165324 transitions. [2018-12-08 20:20:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:16,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:16,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:16,410 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:16,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1846578174, now seen corresponding path program 1 times [2018-12-08 20:20:16,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:16,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:16,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:16,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:16,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:16,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:20:16,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:20:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:20:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:20:16,542 INFO L87 Difference]: Start difference. First operand 39028 states and 165324 transitions. Second operand 12 states. [2018-12-08 20:20:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:17,094 INFO L93 Difference]: Finished difference Result 55533 states and 228155 transitions. [2018-12-08 20:20:17,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:20:17,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-08 20:20:17,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:17,182 INFO L225 Difference]: With dead ends: 55533 [2018-12-08 20:20:17,182 INFO L226 Difference]: Without dead ends: 48889 [2018-12-08 20:20:17,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2018-12-08 20:20:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48889 states. [2018-12-08 20:20:17,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48889 to 38756. [2018-12-08 20:20:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38756 states. [2018-12-08 20:20:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38756 states to 38756 states and 164262 transitions. [2018-12-08 20:20:17,815 INFO L78 Accepts]: Start accepts. Automaton has 38756 states and 164262 transitions. Word has length 46 [2018-12-08 20:20:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:17,816 INFO L480 AbstractCegarLoop]: Abstraction has 38756 states and 164262 transitions. [2018-12-08 20:20:17,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:20:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38756 states and 164262 transitions. [2018-12-08 20:20:17,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:17,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:17,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:17,828 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:17,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:17,828 INFO L82 PathProgramCache]: Analyzing trace with hash 649545214, now seen corresponding path program 1 times [2018-12-08 20:20:17,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:17,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:17,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:17,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:18,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:18,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 20:20:18,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:20:18,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:20:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:20:18,191 INFO L87 Difference]: Start difference. First operand 38756 states and 164262 transitions. Second operand 17 states. [2018-12-08 20:20:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:19,486 INFO L93 Difference]: Finished difference Result 47709 states and 201870 transitions. [2018-12-08 20:20:19,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-08 20:20:19,487 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-08 20:20:19,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:19,683 INFO L225 Difference]: With dead ends: 47709 [2018-12-08 20:20:19,683 INFO L226 Difference]: Without dead ends: 47403 [2018-12-08 20:20:19,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-12-08 20:20:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47403 states. [2018-12-08 20:20:20,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47403 to 40796. [2018-12-08 20:20:20,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40796 states. [2018-12-08 20:20:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40796 states to 40796 states and 173951 transitions. [2018-12-08 20:20:20,306 INFO L78 Accepts]: Start accepts. Automaton has 40796 states and 173951 transitions. Word has length 46 [2018-12-08 20:20:20,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:20,306 INFO L480 AbstractCegarLoop]: Abstraction has 40796 states and 173951 transitions. [2018-12-08 20:20:20,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:20:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 40796 states and 173951 transitions. [2018-12-08 20:20:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:20,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:20,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:20,320 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:20,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1433815393, now seen corresponding path program 1 times [2018-12-08 20:20:20,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:20,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:20,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:20,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 20:20:20,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:20:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:20:20,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:20:20,681 INFO L87 Difference]: Start difference. First operand 40796 states and 173951 transitions. Second operand 17 states. [2018-12-08 20:20:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:21,574 INFO L93 Difference]: Finished difference Result 48941 states and 207557 transitions. [2018-12-08 20:20:21,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 20:20:21,574 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-08 20:20:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:21,668 INFO L225 Difference]: With dead ends: 48941 [2018-12-08 20:20:21,668 INFO L226 Difference]: Without dead ends: 48635 [2018-12-08 20:20:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-08 20:20:21,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48635 states. [2018-12-08 20:20:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48635 to 40772. [2018-12-08 20:20:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40772 states. [2018-12-08 20:20:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40772 states to 40772 states and 173863 transitions. [2018-12-08 20:20:22,323 INFO L78 Accepts]: Start accepts. Automaton has 40772 states and 173863 transitions. Word has length 46 [2018-12-08 20:20:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:22,323 INFO L480 AbstractCegarLoop]: Abstraction has 40772 states and 173863 transitions. [2018-12-08 20:20:22,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:20:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 40772 states and 173863 transitions. [2018-12-08 20:20:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:22,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:22,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:22,336 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:22,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:22,336 INFO L82 PathProgramCache]: Analyzing trace with hash 299199095, now seen corresponding path program 2 times [2018-12-08 20:20:22,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:22,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:22,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:22,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:22,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:22,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-08 20:20:22,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-08 20:20:22,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-08 20:20:22,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:20:22,662 INFO L87 Difference]: Start difference. First operand 40772 states and 173863 transitions. Second operand 17 states. [2018-12-08 20:20:23,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:23,806 INFO L93 Difference]: Finished difference Result 49993 states and 209684 transitions. [2018-12-08 20:20:23,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-08 20:20:23,807 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-12-08 20:20:23,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:23,905 INFO L225 Difference]: With dead ends: 49993 [2018-12-08 20:20:23,905 INFO L226 Difference]: Without dead ends: 49687 [2018-12-08 20:20:23,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2018-12-08 20:20:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49687 states. [2018-12-08 20:20:24,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49687 to 38645. [2018-12-08 20:20:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38645 states. [2018-12-08 20:20:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38645 states to 38645 states and 163925 transitions. [2018-12-08 20:20:24,605 INFO L78 Accepts]: Start accepts. Automaton has 38645 states and 163925 transitions. Word has length 46 [2018-12-08 20:20:24,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:24,605 INFO L480 AbstractCegarLoop]: Abstraction has 38645 states and 163925 transitions. [2018-12-08 20:20:24,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-08 20:20:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38645 states and 163925 transitions. [2018-12-08 20:20:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:24,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:24,617 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:24,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:24,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1385009275, now seen corresponding path program 1 times [2018-12-08 20:20:24,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:24,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:24,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:24,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:25,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:25,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:25,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:25,017 INFO L87 Difference]: Start difference. First operand 38645 states and 163925 transitions. Second operand 19 states. [2018-12-08 20:20:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:26,053 INFO L93 Difference]: Finished difference Result 48949 states and 208196 transitions. [2018-12-08 20:20:26,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 20:20:26,053 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-12-08 20:20:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:26,146 INFO L225 Difference]: With dead ends: 48949 [2018-12-08 20:20:26,147 INFO L226 Difference]: Without dead ends: 48703 [2018-12-08 20:20:26,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-12-08 20:20:26,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48703 states. [2018-12-08 20:20:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48703 to 38308. [2018-12-08 20:20:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38308 states. [2018-12-08 20:20:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38308 states to 38308 states and 162641 transitions. [2018-12-08 20:20:26,781 INFO L78 Accepts]: Start accepts. Automaton has 38308 states and 162641 transitions. Word has length 46 [2018-12-08 20:20:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:26,782 INFO L480 AbstractCegarLoop]: Abstraction has 38308 states and 162641 transitions. [2018-12-08 20:20:26,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 38308 states and 162641 transitions. [2018-12-08 20:20:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-08 20:20:26,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:26,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:26,793 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:26,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:26,793 INFO L82 PathProgramCache]: Analyzing trace with hash 646721030, now seen corresponding path program 2 times [2018-12-08 20:20:26,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:26,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:26,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:26,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:26,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-08 20:20:26,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 20:20:26,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 20:20:26,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-08 20:20:26,887 INFO L87 Difference]: Start difference. First operand 38308 states and 162641 transitions. Second operand 12 states. [2018-12-08 20:20:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:27,257 INFO L93 Difference]: Finished difference Result 52333 states and 220932 transitions. [2018-12-08 20:20:27,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 20:20:27,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-12-08 20:20:27,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:27,365 INFO L225 Difference]: With dead ends: 52333 [2018-12-08 20:20:27,365 INFO L226 Difference]: Without dead ends: 52027 [2018-12-08 20:20:27,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:20:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2018-12-08 20:20:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 38150. [2018-12-08 20:20:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38150 states. [2018-12-08 20:20:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38150 states to 38150 states and 162226 transitions. [2018-12-08 20:20:28,023 INFO L78 Accepts]: Start accepts. Automaton has 38150 states and 162226 transitions. Word has length 46 [2018-12-08 20:20:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:28,023 INFO L480 AbstractCegarLoop]: Abstraction has 38150 states and 162226 transitions. [2018-12-08 20:20:28,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 20:20:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 38150 states and 162226 transitions. [2018-12-08 20:20:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 20:20:28,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:28,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:28,039 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:28,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:28,039 INFO L82 PathProgramCache]: Analyzing trace with hash -257915841, now seen corresponding path program 1 times [2018-12-08 20:20:28,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:28,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:28,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:28,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:28,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:28,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:28,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:28,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:28,529 INFO L87 Difference]: Start difference. First operand 38150 states and 162226 transitions. Second operand 19 states. [2018-12-08 20:20:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:30,205 INFO L93 Difference]: Finished difference Result 46294 states and 195371 transitions. [2018-12-08 20:20:30,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 20:20:30,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-08 20:20:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:30,309 INFO L225 Difference]: With dead ends: 46294 [2018-12-08 20:20:30,310 INFO L226 Difference]: Without dead ends: 45988 [2018-12-08 20:20:30,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2018-12-08 20:20:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45988 states. [2018-12-08 20:20:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45988 to 36584. [2018-12-08 20:20:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36584 states. [2018-12-08 20:20:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36584 states to 36584 states and 155048 transitions. [2018-12-08 20:20:30,989 INFO L78 Accepts]: Start accepts. Automaton has 36584 states and 155048 transitions. Word has length 48 [2018-12-08 20:20:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:30,989 INFO L480 AbstractCegarLoop]: Abstraction has 36584 states and 155048 transitions. [2018-12-08 20:20:30,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 36584 states and 155048 transitions. [2018-12-08 20:20:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 20:20:31,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:31,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:31,006 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:31,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1488816992, now seen corresponding path program 1 times [2018-12-08 20:20:31,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:31,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:31,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:31,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:31,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:31,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:31,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:31,515 INFO L87 Difference]: Start difference. First operand 36584 states and 155048 transitions. Second operand 19 states. [2018-12-08 20:20:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:33,098 INFO L93 Difference]: Finished difference Result 42873 states and 179744 transitions. [2018-12-08 20:20:33,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-08 20:20:33,098 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-12-08 20:20:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:33,179 INFO L225 Difference]: With dead ends: 42873 [2018-12-08 20:20:33,179 INFO L226 Difference]: Without dead ends: 42567 [2018-12-08 20:20:33,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2018-12-08 20:20:33,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42567 states. [2018-12-08 20:20:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42567 to 34160. [2018-12-08 20:20:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34160 states. [2018-12-08 20:20:33,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34160 states to 34160 states and 144012 transitions. [2018-12-08 20:20:33,756 INFO L78 Accepts]: Start accepts. Automaton has 34160 states and 144012 transitions. Word has length 48 [2018-12-08 20:20:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:33,756 INFO L480 AbstractCegarLoop]: Abstraction has 34160 states and 144012 transitions. [2018-12-08 20:20:33,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:33,756 INFO L276 IsEmpty]: Start isEmpty. Operand 34160 states and 144012 transitions. [2018-12-08 20:20:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:33,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:33,772 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:33,773 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:33,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1891753118, now seen corresponding path program 1 times [2018-12-08 20:20:33,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:33,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:33,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:33,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:33,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:33,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:20:33,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:20:33,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:20:33,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:20:33,791 INFO L87 Difference]: Start difference. First operand 34160 states and 144012 transitions. Second operand 5 states. [2018-12-08 20:20:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:33,962 INFO L93 Difference]: Finished difference Result 38901 states and 161890 transitions. [2018-12-08 20:20:33,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:20:33,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-08 20:20:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:34,033 INFO L225 Difference]: With dead ends: 38901 [2018-12-08 20:20:34,034 INFO L226 Difference]: Without dead ends: 38067 [2018-12-08 20:20:34,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:34,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38067 states. [2018-12-08 20:20:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38067 to 36249. [2018-12-08 20:20:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36249 states. [2018-12-08 20:20:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36249 states to 36249 states and 152432 transitions. [2018-12-08 20:20:34,581 INFO L78 Accepts]: Start accepts. Automaton has 36249 states and 152432 transitions. Word has length 49 [2018-12-08 20:20:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:34,582 INFO L480 AbstractCegarLoop]: Abstraction has 36249 states and 152432 transitions. [2018-12-08 20:20:34,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:20:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 36249 states and 152432 transitions. [2018-12-08 20:20:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:34,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:34,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:34,598 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:34,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1732785392, now seen corresponding path program 2 times [2018-12-08 20:20:34,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:34,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:34,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:34,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:34,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:34,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:20:34,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:20:34,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:20:34,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:20:34,641 INFO L87 Difference]: Start difference. First operand 36249 states and 152432 transitions. Second operand 7 states. [2018-12-08 20:20:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:34,910 INFO L93 Difference]: Finished difference Result 40969 states and 170278 transitions. [2018-12-08 20:20:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:20:34,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-08 20:20:34,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:34,983 INFO L225 Difference]: With dead ends: 40969 [2018-12-08 20:20:34,983 INFO L226 Difference]: Without dead ends: 40135 [2018-12-08 20:20:34,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:20:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40135 states. [2018-12-08 20:20:35,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40135 to 36228. [2018-12-08 20:20:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36228 states. [2018-12-08 20:20:35,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36228 states to 36228 states and 152400 transitions. [2018-12-08 20:20:35,533 INFO L78 Accepts]: Start accepts. Automaton has 36228 states and 152400 transitions. Word has length 49 [2018-12-08 20:20:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:35,534 INFO L480 AbstractCegarLoop]: Abstraction has 36228 states and 152400 transitions. [2018-12-08 20:20:35,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:20:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 36228 states and 152400 transitions. [2018-12-08 20:20:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:35,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:35,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:35,550 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:35,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:35,550 INFO L82 PathProgramCache]: Analyzing trace with hash -13513647, now seen corresponding path program 1 times [2018-12-08 20:20:35,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:35,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:35,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:35,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:35,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:35,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:35,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:20:35,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:20:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:20:35,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:20:35,834 INFO L87 Difference]: Start difference. First operand 36228 states and 152400 transitions. Second operand 14 states. [2018-12-08 20:20:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:36,303 INFO L93 Difference]: Finished difference Result 55817 states and 227535 transitions. [2018-12-08 20:20:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 20:20:36,304 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-12-08 20:20:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:36,378 INFO L225 Difference]: With dead ends: 55817 [2018-12-08 20:20:36,378 INFO L226 Difference]: Without dead ends: 41649 [2018-12-08 20:20:36,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2018-12-08 20:20:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41649 states. [2018-12-08 20:20:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41649 to 31649. [2018-12-08 20:20:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31649 states. [2018-12-08 20:20:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31649 states to 31649 states and 132071 transitions. [2018-12-08 20:20:36,910 INFO L78 Accepts]: Start accepts. Automaton has 31649 states and 132071 transitions. Word has length 49 [2018-12-08 20:20:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:36,911 INFO L480 AbstractCegarLoop]: Abstraction has 31649 states and 132071 transitions. [2018-12-08 20:20:36,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:20:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31649 states and 132071 transitions. [2018-12-08 20:20:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:36,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:36,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:36,925 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:36,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:36,926 INFO L82 PathProgramCache]: Analyzing trace with hash -114085722, now seen corresponding path program 1 times [2018-12-08 20:20:36,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:36,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:36,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:36,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:36,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:37,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:20:37,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:20:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:20:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:20:37,540 INFO L87 Difference]: Start difference. First operand 31649 states and 132071 transitions. Second operand 21 states. [2018-12-08 20:20:38,009 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 67 [2018-12-08 20:20:38,143 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2018-12-08 20:20:38,663 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 62 [2018-12-08 20:20:38,806 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-12-08 20:20:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:40,718 INFO L93 Difference]: Finished difference Result 55168 states and 228464 transitions. [2018-12-08 20:20:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-08 20:20:40,718 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-12-08 20:20:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:40,824 INFO L225 Difference]: With dead ends: 55168 [2018-12-08 20:20:40,824 INFO L226 Difference]: Without dead ends: 54346 [2018-12-08 20:20:40,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=542, Invalid=1908, Unknown=0, NotChecked=0, Total=2450 [2018-12-08 20:20:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54346 states. [2018-12-08 20:20:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54346 to 35364. [2018-12-08 20:20:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-08 20:20:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-08 20:20:41,465 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-08 20:20:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:41,465 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-08 20:20:41,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:20:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-08 20:20:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:41,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:41,483 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:41,483 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:41,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash -672953966, now seen corresponding path program 3 times [2018-12-08 20:20:41,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:41,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:41,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:41,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:41,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:41,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 20:20:41,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:20:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:20:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-08 20:20:41,693 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 16 states. [2018-12-08 20:20:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:42,018 INFO L93 Difference]: Finished difference Result 39597 states and 166907 transitions. [2018-12-08 20:20:42,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:20:42,018 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-08 20:20:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:42,089 INFO L225 Difference]: With dead ends: 39597 [2018-12-08 20:20:42,090 INFO L226 Difference]: Without dead ends: 38958 [2018-12-08 20:20:42,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-12-08 20:20:42,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38958 states. [2018-12-08 20:20:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38958 to 35364. [2018-12-08 20:20:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-08 20:20:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 150822 transitions. [2018-12-08 20:20:42,757 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 150822 transitions. Word has length 49 [2018-12-08 20:20:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:42,757 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 150822 transitions. [2018-12-08 20:20:42,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:20:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 150822 transitions. [2018-12-08 20:20:42,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:42,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:42,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:42,777 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:42,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:42,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1155264282, now seen corresponding path program 4 times [2018-12-08 20:20:42,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:42,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:42,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:42,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:43,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:43,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:43,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:43,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:43,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:43,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:43,152 INFO L87 Difference]: Start difference. First operand 35364 states and 150822 transitions. Second operand 19 states. [2018-12-08 20:20:44,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:44,158 INFO L93 Difference]: Finished difference Result 41619 states and 175078 transitions. [2018-12-08 20:20:44,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 20:20:44,158 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-08 20:20:44,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:44,234 INFO L225 Difference]: With dead ends: 41619 [2018-12-08 20:20:44,234 INFO L226 Difference]: Without dead ends: 40980 [2018-12-08 20:20:44,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2018-12-08 20:20:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40980 states. [2018-12-08 20:20:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40980 to 35412. [2018-12-08 20:20:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35412 states. [2018-12-08 20:20:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35412 states to 35412 states and 150956 transitions. [2018-12-08 20:20:44,781 INFO L78 Accepts]: Start accepts. Automaton has 35412 states and 150956 transitions. Word has length 49 [2018-12-08 20:20:44,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:44,781 INFO L480 AbstractCegarLoop]: Abstraction has 35412 states and 150956 transitions. [2018-12-08 20:20:44,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:44,782 INFO L276 IsEmpty]: Start isEmpty. Operand 35412 states and 150956 transitions. [2018-12-08 20:20:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-08 20:20:44,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:44,799 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:44,799 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:44,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1728037470, now seen corresponding path program 5 times [2018-12-08 20:20:44,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:44,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:44,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:44,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:44,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:45,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-08 20:20:45,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-08 20:20:45,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 20:20:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-08 20:20:45,006 INFO L87 Difference]: Start difference. First operand 35412 states and 150956 transitions. Second operand 16 states. [2018-12-08 20:20:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:45,517 INFO L93 Difference]: Finished difference Result 44552 states and 186042 transitions. [2018-12-08 20:20:45,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-08 20:20:45,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-12-08 20:20:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:45,598 INFO L225 Difference]: With dead ends: 44552 [2018-12-08 20:20:45,598 INFO L226 Difference]: Without dead ends: 43913 [2018-12-08 20:20:45,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-12-08 20:20:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43913 states. [2018-12-08 20:20:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43913 to 34825. [2018-12-08 20:20:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34825 states. [2018-12-08 20:20:46,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34825 states to 34825 states and 148359 transitions. [2018-12-08 20:20:46,155 INFO L78 Accepts]: Start accepts. Automaton has 34825 states and 148359 transitions. Word has length 49 [2018-12-08 20:20:46,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:46,155 INFO L480 AbstractCegarLoop]: Abstraction has 34825 states and 148359 transitions. [2018-12-08 20:20:46,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-08 20:20:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34825 states and 148359 transitions. [2018-12-08 20:20:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:46,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:46,176 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:46,177 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:46,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:46,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2131956216, now seen corresponding path program 1 times [2018-12-08 20:20:46,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:46,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:46,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:46,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:46,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:46,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:46,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:20:46,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:20:46,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:20:46,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:20:46,855 INFO L87 Difference]: Start difference. First operand 34825 states and 148359 transitions. Second operand 21 states. [2018-12-08 20:20:47,334 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2018-12-08 20:20:47,466 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2018-12-08 20:20:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:49,013 INFO L93 Difference]: Finished difference Result 36224 states and 150699 transitions. [2018-12-08 20:20:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 20:20:49,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-08 20:20:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:49,077 INFO L225 Difference]: With dead ends: 36224 [2018-12-08 20:20:49,077 INFO L226 Difference]: Without dead ends: 35180 [2018-12-08 20:20:49,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 20:20:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2018-12-08 20:20:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 29756. [2018-12-08 20:20:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29756 states. [2018-12-08 20:20:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29756 states to 29756 states and 124486 transitions. [2018-12-08 20:20:49,551 INFO L78 Accepts]: Start accepts. Automaton has 29756 states and 124486 transitions. Word has length 51 [2018-12-08 20:20:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:49,552 INFO L480 AbstractCegarLoop]: Abstraction has 29756 states and 124486 transitions. [2018-12-08 20:20:49,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:20:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 29756 states and 124486 transitions. [2018-12-08 20:20:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:49,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:49,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:49,571 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:49,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:49,572 INFO L82 PathProgramCache]: Analyzing trace with hash 845920999, now seen corresponding path program 1 times [2018-12-08 20:20:49,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:49,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:49,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:49,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:49,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:50,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:50,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:20:50,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:20:50,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:20:50,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:20:50,089 INFO L87 Difference]: Start difference. First operand 29756 states and 124486 transitions. Second operand 21 states. [2018-12-08 20:20:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:51,589 INFO L93 Difference]: Finished difference Result 37835 states and 157450 transitions. [2018-12-08 20:20:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 20:20:51,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-08 20:20:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:51,657 INFO L225 Difference]: With dead ends: 37835 [2018-12-08 20:20:51,658 INFO L226 Difference]: Without dead ends: 36917 [2018-12-08 20:20:51,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=374, Invalid=1348, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 20:20:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36917 states. [2018-12-08 20:20:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36917 to 25502. [2018-12-08 20:20:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25502 states. [2018-12-08 20:20:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25502 states to 25502 states and 105052 transitions. [2018-12-08 20:20:52,113 INFO L78 Accepts]: Start accepts. Automaton has 25502 states and 105052 transitions. Word has length 51 [2018-12-08 20:20:52,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:52,113 INFO L480 AbstractCegarLoop]: Abstraction has 25502 states and 105052 transitions. [2018-12-08 20:20:52,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:20:52,113 INFO L276 IsEmpty]: Start isEmpty. Operand 25502 states and 105052 transitions. [2018-12-08 20:20:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:52,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:52,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:52,130 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:52,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 531858785, now seen corresponding path program 2 times [2018-12-08 20:20:52,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:52,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:52,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:52,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:52,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:20:52,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:20:52,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:20:52,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:20:52,942 INFO L87 Difference]: Start difference. First operand 25502 states and 105052 transitions. Second operand 21 states. [2018-12-08 20:20:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:55,265 INFO L93 Difference]: Finished difference Result 38880 states and 159223 transitions. [2018-12-08 20:20:55,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-08 20:20:55,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-08 20:20:55,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:55,336 INFO L225 Difference]: With dead ends: 38880 [2018-12-08 20:20:55,336 INFO L226 Difference]: Without dead ends: 38574 [2018-12-08 20:20:55,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2018-12-08 20:20:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38574 states. [2018-12-08 20:20:55,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38574 to 20447. [2018-12-08 20:20:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20447 states. [2018-12-08 20:20:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20447 states to 20447 states and 83415 transitions. [2018-12-08 20:20:55,737 INFO L78 Accepts]: Start accepts. Automaton has 20447 states and 83415 transitions. Word has length 51 [2018-12-08 20:20:55,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:55,738 INFO L480 AbstractCegarLoop]: Abstraction has 20447 states and 83415 transitions. [2018-12-08 20:20:55,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:20:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20447 states and 83415 transitions. [2018-12-08 20:20:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:55,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:55,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:55,750 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:55,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -604065647, now seen corresponding path program 1 times [2018-12-08 20:20:55,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:55,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:55,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:55,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:55,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:56,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:56,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:56,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:56,359 INFO L87 Difference]: Start difference. First operand 20447 states and 83415 transitions. Second operand 19 states. [2018-12-08 20:20:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:57,271 INFO L93 Difference]: Finished difference Result 25964 states and 104818 transitions. [2018-12-08 20:20:57,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 20:20:57,271 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-08 20:20:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:57,314 INFO L225 Difference]: With dead ends: 25964 [2018-12-08 20:20:57,314 INFO L226 Difference]: Without dead ends: 25595 [2018-12-08 20:20:57,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2018-12-08 20:20:57,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25595 states. [2018-12-08 20:20:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25595 to 20399. [2018-12-08 20:20:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20399 states. [2018-12-08 20:20:57,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20399 states to 20399 states and 83215 transitions. [2018-12-08 20:20:57,626 INFO L78 Accepts]: Start accepts. Automaton has 20399 states and 83215 transitions. Word has length 51 [2018-12-08 20:20:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:57,627 INFO L480 AbstractCegarLoop]: Abstraction has 20399 states and 83215 transitions. [2018-12-08 20:20:57,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 20399 states and 83215 transitions. [2018-12-08 20:20:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:57,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:57,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:57,639 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:57,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1659149151, now seen corresponding path program 2 times [2018-12-08 20:20:57,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:57,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:57,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:20:57,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:58,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:58,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:58,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-12-08 20:20:58,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-08 20:20:58,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-08 20:20:58,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:20:58,070 INFO L87 Difference]: Start difference. First operand 20399 states and 83215 transitions. Second operand 19 states. [2018-12-08 20:20:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:20:59,152 INFO L93 Difference]: Finished difference Result 27038 states and 108725 transitions. [2018-12-08 20:20:59,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-08 20:20:59,152 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2018-12-08 20:20:59,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:20:59,196 INFO L225 Difference]: With dead ends: 27038 [2018-12-08 20:20:59,196 INFO L226 Difference]: Without dead ends: 26669 [2018-12-08 20:20:59,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2018-12-08 20:20:59,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26669 states. [2018-12-08 20:20:59,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26669 to 20090. [2018-12-08 20:20:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20090 states. [2018-12-08 20:20:59,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20090 states to 20090 states and 82205 transitions. [2018-12-08 20:20:59,509 INFO L78 Accepts]: Start accepts. Automaton has 20090 states and 82205 transitions. Word has length 51 [2018-12-08 20:20:59,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:20:59,509 INFO L480 AbstractCegarLoop]: Abstraction has 20090 states and 82205 transitions. [2018-12-08 20:20:59,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-08 20:20:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 20090 states and 82205 transitions. [2018-12-08 20:20:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:20:59,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:20:59,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:20:59,521 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:20:59,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:20:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1841104979, now seen corresponding path program 1 times [2018-12-08 20:20:59,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:20:59,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:20:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:59,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:20:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:20:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:20:59,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:20:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:20:59,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-08 20:20:59,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 20:20:59,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 20:20:59,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:20:59,868 INFO L87 Difference]: Start difference. First operand 20090 states and 82205 transitions. Second operand 18 states. [2018-12-08 20:21:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:00,540 INFO L93 Difference]: Finished difference Result 26099 states and 105749 transitions. [2018-12-08 20:21:00,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 20:21:00,540 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2018-12-08 20:21:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:00,584 INFO L225 Difference]: With dead ends: 26099 [2018-12-08 20:21:00,584 INFO L226 Difference]: Without dead ends: 25550 [2018-12-08 20:21:00,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-12-08 20:21:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25550 states. [2018-12-08 20:21:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25550 to 20034. [2018-12-08 20:21:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20034 states. [2018-12-08 20:21:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20034 states to 20034 states and 81977 transitions. [2018-12-08 20:21:00,893 INFO L78 Accepts]: Start accepts. Automaton has 20034 states and 81977 transitions. Word has length 51 [2018-12-08 20:21:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:00,893 INFO L480 AbstractCegarLoop]: Abstraction has 20034 states and 81977 transitions. [2018-12-08 20:21:00,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 20:21:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20034 states and 81977 transitions. [2018-12-08 20:21:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 20:21:00,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:00,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:00,905 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:00,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1358794663, now seen corresponding path program 2 times [2018-12-08 20:21:00,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:01,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:01,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:21:01,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:21:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:21:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:21:01,462 INFO L87 Difference]: Start difference. First operand 20034 states and 81977 transitions. Second operand 21 states. [2018-12-08 20:21:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:02,862 INFO L93 Difference]: Finished difference Result 24529 states and 99196 transitions. [2018-12-08 20:21:02,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 20:21:02,862 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 51 [2018-12-08 20:21:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:02,897 INFO L225 Difference]: With dead ends: 24529 [2018-12-08 20:21:02,897 INFO L226 Difference]: Without dead ends: 22702 [2018-12-08 20:21:02,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=382, Invalid=1340, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 20:21:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22702 states. [2018-12-08 20:21:03,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22702 to 17110. [2018-12-08 20:21:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17110 states. [2018-12-08 20:21:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17110 states to 17110 states and 69704 transitions. [2018-12-08 20:21:03,162 INFO L78 Accepts]: Start accepts. Automaton has 17110 states and 69704 transitions. Word has length 51 [2018-12-08 20:21:03,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:03,162 INFO L480 AbstractCegarLoop]: Abstraction has 17110 states and 69704 transitions. [2018-12-08 20:21:03,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:21:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 17110 states and 69704 transitions. [2018-12-08 20:21:03,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:21:03,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:03,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:03,173 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:03,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:03,173 INFO L82 PathProgramCache]: Analyzing trace with hash 66214973, now seen corresponding path program 1 times [2018-12-08 20:21:03,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:03,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:03,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:21:03,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:03,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:03,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:21:03,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:21:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:21:03,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:21:03,205 INFO L87 Difference]: Start difference. First operand 17110 states and 69704 transitions. Second operand 5 states. [2018-12-08 20:21:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:03,306 INFO L93 Difference]: Finished difference Result 20123 states and 80035 transitions. [2018-12-08 20:21:03,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:21:03,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 20:21:03,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:03,337 INFO L225 Difference]: With dead ends: 20123 [2018-12-08 20:21:03,337 INFO L226 Difference]: Without dead ends: 19403 [2018-12-08 20:21:03,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:21:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19403 states. [2018-12-08 20:21:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19403 to 18983. [2018-12-08 20:21:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18983 states. [2018-12-08 20:21:03,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18983 states to 18983 states and 76438 transitions. [2018-12-08 20:21:03,593 INFO L78 Accepts]: Start accepts. Automaton has 18983 states and 76438 transitions. Word has length 52 [2018-12-08 20:21:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:03,593 INFO L480 AbstractCegarLoop]: Abstraction has 18983 states and 76438 transitions. [2018-12-08 20:21:03,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:21:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18983 states and 76438 transitions. [2018-12-08 20:21:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:21:03,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:03,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:03,605 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:03,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:03,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1212252299, now seen corresponding path program 2 times [2018-12-08 20:21:03,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:03,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:03,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:03,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:03,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:03,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:03,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:21:03,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:21:03,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:21:03,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:21:03,640 INFO L87 Difference]: Start difference. First operand 18983 states and 76438 transitions. Second operand 7 states. [2018-12-08 20:21:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:03,835 INFO L93 Difference]: Finished difference Result 21975 states and 86737 transitions. [2018-12-08 20:21:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 20:21:03,835 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2018-12-08 20:21:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:03,866 INFO L225 Difference]: With dead ends: 21975 [2018-12-08 20:21:03,867 INFO L226 Difference]: Without dead ends: 21255 [2018-12-08 20:21:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:21:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21255 states. [2018-12-08 20:21:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21255 to 18962. [2018-12-08 20:21:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18962 states. [2018-12-08 20:21:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18962 states to 18962 states and 76406 transitions. [2018-12-08 20:21:04,131 INFO L78 Accepts]: Start accepts. Automaton has 18962 states and 76406 transitions. Word has length 52 [2018-12-08 20:21:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:04,131 INFO L480 AbstractCegarLoop]: Abstraction has 18962 states and 76406 transitions. [2018-12-08 20:21:04,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:21:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 18962 states and 76406 transitions. [2018-12-08 20:21:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:21:04,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:04,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:04,144 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:04,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -602885373, now seen corresponding path program 3 times [2018-12-08 20:21:04,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:04,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:04,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:21:04,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:04,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:04,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:04,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:21:04,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:21:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:21:04,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:21:04,695 INFO L87 Difference]: Start difference. First operand 18962 states and 76406 transitions. Second operand 21 states. [2018-12-08 20:21:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:06,153 INFO L93 Difference]: Finished difference Result 24590 states and 97599 transitions. [2018-12-08 20:21:06,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 20:21:06,153 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-12-08 20:21:06,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:06,185 INFO L225 Difference]: With dead ends: 24590 [2018-12-08 20:21:06,185 INFO L226 Difference]: Without dead ends: 22430 [2018-12-08 20:21:06,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=390, Invalid=1332, Unknown=0, NotChecked=0, Total=1722 [2018-12-08 20:21:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22430 states. [2018-12-08 20:21:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22430 to 18290. [2018-12-08 20:21:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18290 states. [2018-12-08 20:21:06,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18290 states to 18290 states and 73678 transitions. [2018-12-08 20:21:06,433 INFO L78 Accepts]: Start accepts. Automaton has 18290 states and 73678 transitions. Word has length 52 [2018-12-08 20:21:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:06,433 INFO L480 AbstractCegarLoop]: Abstraction has 18290 states and 73678 transitions. [2018-12-08 20:21:06,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:21:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 18290 states and 73678 transitions. [2018-12-08 20:21:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 20:21:06,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:06,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:06,445 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:06,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash -645490969, now seen corresponding path program 4 times [2018-12-08 20:21:06,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:06,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:06,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:21:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:06,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:06,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-12-08 20:21:06,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 20:21:06,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 20:21:06,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:21:06,777 INFO L87 Difference]: Start difference. First operand 18290 states and 73678 transitions. Second operand 18 states. [2018-12-08 20:21:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:07,444 INFO L93 Difference]: Finished difference Result 24227 states and 94267 transitions. [2018-12-08 20:21:07,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 20:21:07,444 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-08 20:21:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:07,487 INFO L225 Difference]: With dead ends: 24227 [2018-12-08 20:21:07,488 INFO L226 Difference]: Without dead ends: 23507 [2018-12-08 20:21:07,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-12-08 20:21:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23507 states. [2018-12-08 20:21:07,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23507 to 17551. [2018-12-08 20:21:07,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17551 states. [2018-12-08 20:21:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17551 states to 17551 states and 70727 transitions. [2018-12-08 20:21:07,745 INFO L78 Accepts]: Start accepts. Automaton has 17551 states and 70727 transitions. Word has length 52 [2018-12-08 20:21:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:07,745 INFO L480 AbstractCegarLoop]: Abstraction has 17551 states and 70727 transitions. [2018-12-08 20:21:07,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 20:21:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 17551 states and 70727 transitions. [2018-12-08 20:21:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 20:21:07,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:07,758 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:07,758 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:07,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:07,759 INFO L82 PathProgramCache]: Analyzing trace with hash -676697198, now seen corresponding path program 1 times [2018-12-08 20:21:07,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:07,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:07,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:21:07,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:08,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:08,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:21:08,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:21:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:21:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:21:08,578 INFO L87 Difference]: Start difference. First operand 17551 states and 70727 transitions. Second operand 21 states. [2018-12-08 20:21:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:11,167 INFO L93 Difference]: Finished difference Result 25327 states and 100129 transitions. [2018-12-08 20:21:11,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 20:21:11,168 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-12-08 20:21:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:11,222 INFO L225 Difference]: With dead ends: 25327 [2018-12-08 20:21:11,223 INFO L226 Difference]: Without dead ends: 25012 [2018-12-08 20:21:11,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=0, NotChecked=0, Total=1482 [2018-12-08 20:21:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25012 states. [2018-12-08 20:21:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25012 to 13402. [2018-12-08 20:21:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13402 states. [2018-12-08 20:21:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13402 states to 13402 states and 53709 transitions. [2018-12-08 20:21:11,462 INFO L78 Accepts]: Start accepts. Automaton has 13402 states and 53709 transitions. Word has length 53 [2018-12-08 20:21:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:11,462 INFO L480 AbstractCegarLoop]: Abstraction has 13402 states and 53709 transitions. [2018-12-08 20:21:11,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:21:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 13402 states and 53709 transitions. [2018-12-08 20:21:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 20:21:11,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:11,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, 1, 1, 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-12-08 20:21:11,474 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:11,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:11,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1294667716, now seen corresponding path program 1 times [2018-12-08 20:21:11,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:11,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:11,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:11,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:12,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:12,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:21:12,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:21:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:21:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:21:12,101 INFO L87 Difference]: Start difference. First operand 13402 states and 53709 transitions. Second operand 21 states. [2018-12-08 20:21:13,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:13,396 INFO L93 Difference]: Finished difference Result 22774 states and 89010 transitions. [2018-12-08 20:21:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 20:21:13,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-08 20:21:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:13,428 INFO L225 Difference]: With dead ends: 22774 [2018-12-08 20:21:13,429 INFO L226 Difference]: Without dead ends: 22198 [2018-12-08 20:21:13,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=281, Invalid=1051, Unknown=0, NotChecked=0, Total=1332 [2018-12-08 20:21:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22198 states. [2018-12-08 20:21:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22198 to 12634. [2018-12-08 20:21:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12634 states. [2018-12-08 20:21:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12634 states to 12634 states and 50125 transitions. [2018-12-08 20:21:13,643 INFO L78 Accepts]: Start accepts. Automaton has 12634 states and 50125 transitions. Word has length 54 [2018-12-08 20:21:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:13,643 INFO L480 AbstractCegarLoop]: Abstraction has 12634 states and 50125 transitions. [2018-12-08 20:21:13,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:21:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12634 states and 50125 transitions. [2018-12-08 20:21:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 20:21:13,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:13,653 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:13,653 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:13,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1387947128, now seen corresponding path program 2 times [2018-12-08 20:21:13,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:13,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:14,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:14,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-12-08 20:21:14,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-08 20:21:14,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 20:21:14,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-12-08 20:21:14,306 INFO L87 Difference]: Start difference. First operand 12634 states and 50125 transitions. Second operand 21 states. [2018-12-08 20:21:15,094 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2018-12-08 20:21:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:16,247 INFO L93 Difference]: Finished difference Result 12034 states and 46239 transitions. [2018-12-08 20:21:16,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-08 20:21:16,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-12-08 20:21:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:16,262 INFO L225 Difference]: With dead ends: 12034 [2018-12-08 20:21:16,262 INFO L226 Difference]: Without dead ends: 11458 [2018-12-08 20:21:16,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2018-12-08 20:21:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2018-12-08 20:21:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 6913. [2018-12-08 20:21:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6913 states. [2018-12-08 20:21:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 28314 transitions. [2018-12-08 20:21:16,364 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 28314 transitions. Word has length 54 [2018-12-08 20:21:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:16,364 INFO L480 AbstractCegarLoop]: Abstraction has 6913 states and 28314 transitions. [2018-12-08 20:21:16,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-08 20:21:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 28314 transitions. [2018-12-08 20:21:16,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:21:16,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:16,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:21:16,372 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:16,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1475103386, now seen corresponding path program 1 times [2018-12-08 20:21:16,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:21:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:16,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:16,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 20:21:16,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 20:21:16,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 20:21:16,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:21:16,423 INFO L87 Difference]: Start difference. First operand 6913 states and 28314 transitions. Second operand 8 states. [2018-12-08 20:21:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:16,530 INFO L93 Difference]: Finished difference Result 6913 states and 28308 transitions. [2018-12-08 20:21:16,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:21:16,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2018-12-08 20:21:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:16,540 INFO L225 Difference]: With dead ends: 6913 [2018-12-08 20:21:16,540 INFO L226 Difference]: Without dead ends: 6868 [2018-12-08 20:21:16,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:21:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2018-12-08 20:21:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2018-12-08 20:21:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6868 states. [2018-12-08 20:21:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 28122 transitions. [2018-12-08 20:21:16,621 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 28122 transitions. Word has length 87 [2018-12-08 20:21:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:16,621 INFO L480 AbstractCegarLoop]: Abstraction has 6868 states and 28122 transitions. [2018-12-08 20:21:16,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 20:21:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 28122 transitions. [2018-12-08 20:21:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:21:16,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:16,628 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:21:16,628 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:16,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1175434729, now seen corresponding path program 1 times [2018-12-08 20:21:16,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:16,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:16,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:16,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 20:21:16,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 20:21:16,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 20:21:16,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:21:16,680 INFO L87 Difference]: Start difference. First operand 6868 states and 28122 transitions. Second operand 9 states. [2018-12-08 20:21:16,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:16,794 INFO L93 Difference]: Finished difference Result 6868 states and 28116 transitions. [2018-12-08 20:21:16,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:21:16,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2018-12-08 20:21:16,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:16,804 INFO L225 Difference]: With dead ends: 6868 [2018-12-08 20:21:16,804 INFO L226 Difference]: Without dead ends: 6670 [2018-12-08 20:21:16,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:21:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6670 states. [2018-12-08 20:21:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6670 to 6670. [2018-12-08 20:21:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6670 states. [2018-12-08 20:21:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6670 states to 6670 states and 27300 transitions. [2018-12-08 20:21:16,883 INFO L78 Accepts]: Start accepts. Automaton has 6670 states and 27300 transitions. Word has length 87 [2018-12-08 20:21:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:16,883 INFO L480 AbstractCegarLoop]: Abstraction has 6670 states and 27300 transitions. [2018-12-08 20:21:16,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 20:21:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 6670 states and 27300 transitions. [2018-12-08 20:21:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:21:16,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:16,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:21:16,890 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:16,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash 350309724, now seen corresponding path program 1 times [2018-12-08 20:21:16,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:16,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:16,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:16,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 20:21:17,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:17,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-08 20:21:17,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:21:17,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:21:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:21:17,064 INFO L87 Difference]: Start difference. First operand 6670 states and 27300 transitions. Second operand 11 states. [2018-12-08 20:21:17,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:17,436 INFO L93 Difference]: Finished difference Result 7357 states and 29738 transitions. [2018-12-08 20:21:17,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 20:21:17,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2018-12-08 20:21:17,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:17,447 INFO L225 Difference]: With dead ends: 7357 [2018-12-08 20:21:17,447 INFO L226 Difference]: Without dead ends: 7357 [2018-12-08 20:21:17,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2018-12-08 20:21:17,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7357 states. [2018-12-08 20:21:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7357 to 7273. [2018-12-08 20:21:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2018-12-08 20:21:17,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 29478 transitions. [2018-12-08 20:21:17,533 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 29478 transitions. Word has length 87 [2018-12-08 20:21:17,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:17,533 INFO L480 AbstractCegarLoop]: Abstraction has 7273 states and 29478 transitions. [2018-12-08 20:21:17,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:21:17,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 29478 transitions. [2018-12-08 20:21:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-08 20:21:17,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:17,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-08 20:21:17,541 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 2004079914, now seen corresponding path program 1 times [2018-12-08 20:21:17,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:21:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 20:21:17,573 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 20:21:17,632 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 20:21:17,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:21:17 BasicIcfg [2018-12-08 20:21:17,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:21:17,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:21:17,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:21:17,634 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:21:17,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:20:00" (3/4) ... [2018-12-08 20:21:17,636 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 20:21:17,688 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e55cc32e-064a-47ce-8db2-b12791cfd7d6/bin-2019/uautomizer/witness.graphml [2018-12-08 20:21:17,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:21:17,689 INFO L168 Benchmark]: Toolchain (without parser) took 78221.15 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 957.1 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-08 20:21:17,689 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:21:17,689 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:21:17,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:21:17,690 INFO L168 Benchmark]: Boogie Preprocessor took 14.16 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 20:21:17,690 INFO L168 Benchmark]: RCFGBuilder took 206.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2018-12-08 20:21:17,690 INFO L168 Benchmark]: TraceAbstraction took 77525.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-08 20:21:17,690 INFO L168 Benchmark]: Witness Printer took 54.80 ms. Allocated memory is still 4.6 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:21:17,691 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.16 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77525.86 ms. Allocated memory was 1.2 GB in the beginning and 4.6 GB in the end (delta: 3.5 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 54.80 ms. Allocated memory is still 4.6 GB. Free memory is still 3.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1212]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1213] -1 char *v; VAL [v={0:0}] [L1246] -1 pthread_t t; VAL [v={0:0}] [L1247] FCALL, FORK -1 pthread_create(&t, 0, thread0, 0) VAL [arg={0:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={95:0}, v={0:0}] [L1231] 0 pthread_t t1, t2, t3, t4, t5; VAL [arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1248] -1 \read(t) VAL [arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1232] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, arg={0:0}, arg={0:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={0:0}] [L1216] 1 v = malloc(sizeof(char)) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1217] 1 return 0; VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1233] 0 \read(t1) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1233] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1234] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 2 v[0] = 'X' VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 2 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1235] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1236] FCALL, FORK 0 pthread_create(&t4, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1237] FCALL, FORK 0 pthread_create(&t5, 0, thread2, 0) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 4 v[0] = 'X' VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 4 return 0; VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1238] 0 \read(t2) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1238] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=1, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1239] 0 \read(t3) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1221] 5 v[0] = 'X' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1222] 5 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1226] 3 v[0] = 'Y' VAL [\read(t3)=2, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1227] 3 return 0; VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1239] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\read(t3)=2, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1240] 0 \read(t4) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1240] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\read(t4)=3, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1241] 0 \read(t5) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1241] FCALL, JOIN 4 pthread_join(t5, 0) VAL [\read(t5)=4, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t1={95:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t2={92:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t3={90:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t4={91:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, t5={94:0}, v={96:0}] [L1242] 0 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1248] FCALL, JOIN 0 pthread_join(t, 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1249] -1 v[0] VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1212] COND TRUE -1 !expression VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] [L1212] -1 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, malloc(sizeof(char))={96:0}, v={96:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 166 locations, 1 error locations. UNSAFE Result, 77.3s OverallTime, 44 OverallIterations, 1 TraceHistogramMax, 41.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8382 SDtfs, 21149 SDslu, 51025 SDs, 0 SdLazy, 23722 SolverSat, 2728 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 157 SyntacticMatches, 44 SemanticMatches, 992 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47312occurred in iteration=0, 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: 20.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 307283 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2226 NumberOfCodeBlocks, 2226 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2096 ConstructedInterpolants, 0 QuantifiedInterpolants, 1805956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...