./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/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 fac85231f5e7b09e0680a474d412fb9232e1875e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.24-cad4683 [2019-11-16 00:05:50,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:05:50,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:05:50,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:05:50,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:05:50,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:05:50,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:05:50,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:05:50,948 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:05:50,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:05:50,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:05:50,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:05:50,951 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:05:50,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:05:50,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:05:50,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:05:50,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:05:50,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:05:50,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:05:50,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:05:50,960 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:05:50,961 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:05:50,962 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:05:50,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:05:50,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:05:50,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:05:50,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:05:50,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:05:50,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:05:50,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:05:50,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:05:50,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:05:50,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:05:50,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:05:50,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:05:50,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:05:50,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:05:50,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:05:50,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:05:50,974 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:05:50,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:05:50,975 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:05:50,988 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:05:50,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:05:50,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:05:50,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:05:50,990 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:05:50,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:05:50,990 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:05:50,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:05:50,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:05:50,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:05:50,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:05:50,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:05:50,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:05:50,992 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:05:50,992 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:05:50,992 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:05:50,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:05:50,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:05:50,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:05:50,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:05:50,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:05:50,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:05:50,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:05:50,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:05:50,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:05:50,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:05:50,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:05:50,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:05:50,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/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 -> fac85231f5e7b09e0680a474d412fb9232e1875e [2019-11-16 00:05:51,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:05:51,032 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:05:51,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:05:51,037 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:05:51,038 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:05:51,039 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-11-16 00:05:51,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/data/dc2e3e2f9/8dce831d53bb400ea1e948989c0cc856/FLAGa63275f71 [2019-11-16 00:05:51,587 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:05:51,587 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-11-16 00:05:51,608 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/data/dc2e3e2f9/8dce831d53bb400ea1e948989c0cc856/FLAGa63275f71 [2019-11-16 00:05:51,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/data/dc2e3e2f9/8dce831d53bb400ea1e948989c0cc856 [2019-11-16 00:05:51,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:05:51,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:05:51,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:51,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:05:51,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:05:51,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:51" (1/1) ... [2019-11-16 00:05:51,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e562b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:51, skipping insertion in model container [2019-11-16 00:05:51,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:05:51" (1/1) ... [2019-11-16 00:05:51,928 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:05:51,979 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:05:52,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:52,459 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:05:52,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:05:52,600 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:05:52,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52 WrapperNode [2019-11-16 00:05:52,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:05:52,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:52,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:05:52,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:05:52,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:05:52,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:05:52,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:05:52,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:05:52,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... [2019-11-16 00:05:52,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:05:52,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:05:52,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:05:52,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:05:52,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/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 [2019-11-16 00:05:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:05:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:05:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:05:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:05:52,781 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:05:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:05:52,782 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:05:52,782 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:05:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:05:52,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:05:52,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:05:52,786 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:05:53,486 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:05:53,486 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:05:53,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:53 BoogieIcfgContainer [2019-11-16 00:05:53,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:05:53,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:05:53,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:05:53,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:05:53,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:05:51" (1/3) ... [2019-11-16 00:05:53,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c6e16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:53, skipping insertion in model container [2019-11-16 00:05:53,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:05:52" (2/3) ... [2019-11-16 00:05:53,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24c6e16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:05:53, skipping insertion in model container [2019-11-16 00:05:53,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:53" (3/3) ... [2019-11-16 00:05:53,497 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc.i [2019-11-16 00:05:53,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,534 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,534 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,534 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,535 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,535 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,535 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,535 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,536 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,537 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,538 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,539 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,540 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,541 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,542 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,542 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,542 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,543 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,544 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,545 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,546 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,547 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,548 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,549 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,550 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,551 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,552 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,553 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,554 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,555 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,556 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,557 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,558 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,559 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,560 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,561 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,562 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:05:53,573 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:05:53,573 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:05:53,580 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:05:53,590 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:05:53,607 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:05:53,607 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:05:53,607 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:05:53,607 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:05:53,607 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:05:53,608 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:05:53,608 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:05:53,608 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:05:53,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-16 00:05:56,477 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-16 00:05:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-16 00:05:56,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-16 00:05:56,489 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:56,490 INFO L380 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] [2019-11-16 00:05:56,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:56,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:56,499 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-16 00:05:56,507 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:56,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492600609] [2019-11-16 00:05:56,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:56,508 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:56,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:56,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492600609] [2019-11-16 00:05:56,762 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:56,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:05:56,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555890934] [2019-11-16 00:05:56,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:05:56,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:56,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:05:56,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:56,785 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-16 00:05:57,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:05:57,712 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-16 00:05:57,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:05:57,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-16 00:05:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:05:57,977 INFO L225 Difference]: With dead ends: 33590 [2019-11-16 00:05:57,977 INFO L226 Difference]: Without dead ends: 25702 [2019-11-16 00:05:57,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:05:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-16 00:05:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-16 00:05:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-16 00:05:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-16 00:05:59,680 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-16 00:05:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:05:59,681 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-16 00:05:59,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:05:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-16 00:05:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:05:59,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:05:59,697 INFO L380 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] [2019-11-16 00:05:59,697 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:05:59,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:05:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-16 00:05:59,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:05:59,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088902768] [2019-11-16 00:05:59,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:59,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:05:59,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:05:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:05:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:05:59,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088902768] [2019-11-16 00:05:59,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:05:59,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:05:59,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110164206] [2019-11-16 00:05:59,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:05:59,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:05:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:05:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:05:59,888 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-16 00:06:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:01,168 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-16 00:06:01,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:01,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:06:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:01,355 INFO L225 Difference]: With dead ends: 41080 [2019-11-16 00:06:01,356 INFO L226 Difference]: Without dead ends: 40544 [2019-11-16 00:06:01,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:01,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-16 00:06:02,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-16 00:06:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-16 00:06:02,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-16 00:06:02,931 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-16 00:06:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:02,942 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-16 00:06:02,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-16 00:06:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-16 00:06:02,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:02,951 INFO L380 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] [2019-11-16 00:06:02,952 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-16 00:06:02,953 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:02,953 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022665710] [2019-11-16 00:06:02,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,954 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:02,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:03,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022665710] [2019-11-16 00:06:03,053 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:03,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:03,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587442480] [2019-11-16 00:06:03,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:03,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:03,056 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-16 00:06:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:03,706 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-16 00:06:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:03,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-16 00:06:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:03,899 INFO L225 Difference]: With dead ends: 49777 [2019-11-16 00:06:03,899 INFO L226 Difference]: Without dead ends: 49273 [2019-11-16 00:06:03,900 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-16 00:06:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-16 00:06:05,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-16 00:06:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-16 00:06:05,785 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-16 00:06:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:05,785 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-16 00:06:05,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-16 00:06:05,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:06:05,796 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:05,796 INFO L380 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] [2019-11-16 00:06:05,797 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:05,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:05,797 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-16 00:06:05,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:05,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248403267] [2019-11-16 00:06:05,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:05,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:05,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248403267] [2019-11-16 00:06:05,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:05,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:05,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448597561] [2019-11-16 00:06:05,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:05,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:05,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:05,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:05,881 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-16 00:06:06,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:06,239 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-16 00:06:06,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:06,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-16 00:06:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:06,425 INFO L225 Difference]: With dead ends: 61086 [2019-11-16 00:06:06,425 INFO L226 Difference]: Without dead ends: 61086 [2019-11-16 00:06:06,426 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:06,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-16 00:06:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-16 00:06:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-16 00:06:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-16 00:06:08,315 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-16 00:06:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:08,315 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-16 00:06:08,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-16 00:06:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:08,334 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:08,335 INFO L380 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] [2019-11-16 00:06:08,341 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-16 00:06:08,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:08,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433886881] [2019-11-16 00:06:08,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:08,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:08,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:08,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433886881] [2019-11-16 00:06:08,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:08,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:08,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136195656] [2019-11-16 00:06:08,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:08,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:08,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:08,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:08,472 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-16 00:06:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:09,484 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-16 00:06:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:09,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:06:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:09,668 INFO L225 Difference]: With dead ends: 63755 [2019-11-16 00:06:09,668 INFO L226 Difference]: Without dead ends: 63755 [2019-11-16 00:06:09,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-16 00:06:14,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-16 00:06:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-16 00:06:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-16 00:06:14,597 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-16 00:06:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:14,597 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-16 00:06:14,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:14,598 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-16 00:06:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:14,618 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:14,618 INFO L380 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] [2019-11-16 00:06:14,619 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:14,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-16 00:06:14,619 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:14,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467108183] [2019-11-16 00:06:14,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:14,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:14,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467108183] [2019-11-16 00:06:14,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:14,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:14,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704987610] [2019-11-16 00:06:14,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:14,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:14,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:14,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:14,748 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-16 00:06:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:16,049 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-16 00:06:16,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:06:16,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-16 00:06:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:16,228 INFO L225 Difference]: With dead ends: 83684 [2019-11-16 00:06:16,228 INFO L226 Difference]: Without dead ends: 83684 [2019-11-16 00:06:16,229 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:16,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-16 00:06:18,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-16 00:06:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-16 00:06:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-16 00:06:18,565 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-16 00:06:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:18,565 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-16 00:06:18,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-16 00:06:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:18,584 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:18,584 INFO L380 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] [2019-11-16 00:06:18,584 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:18,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:18,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-16 00:06:18,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:18,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377121665] [2019-11-16 00:06:18,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:18,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:18,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377121665] [2019-11-16 00:06:18,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:18,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:18,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039885964] [2019-11-16 00:06:18,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:18,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:18,638 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 3 states. [2019-11-16 00:06:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:18,896 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-16 00:06:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:18,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-16 00:06:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:19,010 INFO L225 Difference]: With dead ends: 54020 [2019-11-16 00:06:19,010 INFO L226 Difference]: Without dead ends: 54020 [2019-11-16 00:06:19,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-16 00:06:19,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-16 00:06:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-16 00:06:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-16 00:06:20,028 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-16 00:06:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:20,029 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-16 00:06:20,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-16 00:06:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:06:20,039 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:20,039 INFO L380 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] [2019-11-16 00:06:20,039 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-16 00:06:20,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:20,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049187353] [2019-11-16 00:06:20,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:20,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:20,114 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049187353] [2019-11-16 00:06:20,114 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:20,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:20,114 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762924722] [2019-11-16 00:06:20,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:20,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:20,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:20,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:20,115 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-16 00:06:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:20,782 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-16 00:06:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:06:20,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:06:20,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:20,921 INFO L225 Difference]: With dead ends: 68645 [2019-11-16 00:06:20,921 INFO L226 Difference]: Without dead ends: 68077 [2019-11-16 00:06:20,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:06:21,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-16 00:06:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-16 00:06:22,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-16 00:06:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-16 00:06:22,685 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-16 00:06:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:22,685 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-16 00:06:22,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-16 00:06:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:06:22,697 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:22,697 INFO L380 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] [2019-11-16 00:06:22,697 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:22,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1423918431, now seen corresponding path program 1 times [2019-11-16 00:06:22,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:22,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206599968] [2019-11-16 00:06:22,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:22,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:22,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206599968] [2019-11-16 00:06:22,803 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:22,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:22,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168100442] [2019-11-16 00:06:22,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:22,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:22,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:22,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:22,804 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 6 states. [2019-11-16 00:06:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:23,473 INFO L93 Difference]: Finished difference Result 67848 states and 231359 transitions. [2019-11-16 00:06:23,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:23,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-16 00:06:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:23,609 INFO L225 Difference]: With dead ends: 67848 [2019-11-16 00:06:23,610 INFO L226 Difference]: Without dead ends: 67848 [2019-11-16 00:06:23,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67848 states. [2019-11-16 00:06:24,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67848 to 59080. [2019-11-16 00:06:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59080 states. [2019-11-16 00:06:24,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59080 states to 59080 states and 204129 transitions. [2019-11-16 00:06:24,738 INFO L78 Accepts]: Start accepts. Automaton has 59080 states and 204129 transitions. Word has length 53 [2019-11-16 00:06:24,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:24,739 INFO L462 AbstractCegarLoop]: Abstraction has 59080 states and 204129 transitions. [2019-11-16 00:06:24,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:24,739 INFO L276 IsEmpty]: Start isEmpty. Operand 59080 states and 204129 transitions. [2019-11-16 00:06:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:06:24,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:24,750 INFO L380 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] [2019-11-16 00:06:24,750 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:24,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:24,750 INFO L82 PathProgramCache]: Analyzing trace with hash -536414750, now seen corresponding path program 1 times [2019-11-16 00:06:24,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:24,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828207641] [2019-11-16 00:06:24,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:24,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:24,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828207641] [2019-11-16 00:06:24,830 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:24,830 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:24,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816600719] [2019-11-16 00:06:24,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:24,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:24,831 INFO L87 Difference]: Start difference. First operand 59080 states and 204129 transitions. Second operand 4 states. [2019-11-16 00:06:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:24,898 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-11-16 00:06:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:24,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-16 00:06:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:24,914 INFO L225 Difference]: With dead ends: 10211 [2019-11-16 00:06:24,915 INFO L226 Difference]: Without dead ends: 8506 [2019-11-16 00:06:24,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-11-16 00:06:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-11-16 00:06:25,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-11-16 00:06:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-11-16 00:06:25,064 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-11-16 00:06:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:25,064 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-11-16 00:06:25,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-11-16 00:06:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:06:25,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:25,069 INFO L380 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] [2019-11-16 00:06:25,069 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-16 00:06:25,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:25,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553282624] [2019-11-16 00:06:25,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:25,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:25,153 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553282624] [2019-11-16 00:06:25,153 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:25,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:25,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586178342] [2019-11-16 00:06:25,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:25,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:25,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:25,154 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-11-16 00:06:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:25,294 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-11-16 00:06:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:25,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-16 00:06:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:25,312 INFO L225 Difference]: With dead ends: 9705 [2019-11-16 00:06:25,312 INFO L226 Difference]: Without dead ends: 9705 [2019-11-16 00:06:25,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-11-16 00:06:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-11-16 00:06:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-11-16 00:06:25,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-11-16 00:06:25,432 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-11-16 00:06:25,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:25,433 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-11-16 00:06:25,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-11-16 00:06:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:06:25,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:25,436 INFO L380 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] [2019-11-16 00:06:25,436 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-16 00:06:25,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:25,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472591994] [2019-11-16 00:06:25,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:25,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:25,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472591994] [2019-11-16 00:06:25,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:25,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:25,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417066409] [2019-11-16 00:06:25,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:25,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:25,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:25,502 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-11-16 00:06:25,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:25,907 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-11-16 00:06:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:06:25,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:06:25,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:25,922 INFO L225 Difference]: With dead ends: 11194 [2019-11-16 00:06:25,922 INFO L226 Difference]: Without dead ends: 11133 [2019-11-16 00:06:25,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-11-16 00:06:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-11-16 00:06:26,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-11-16 00:06:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-11-16 00:06:26,055 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-11-16 00:06:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:26,055 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-11-16 00:06:26,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-11-16 00:06:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:26,061 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:26,061 INFO L380 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] [2019-11-16 00:06:26,061 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash 193632359, now seen corresponding path program 1 times [2019-11-16 00:06:26,062 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:26,062 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360432455] [2019-11-16 00:06:26,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:26,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360432455] [2019-11-16 00:06:26,132 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:26,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:26,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413044544] [2019-11-16 00:06:26,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:26,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:26,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:26,134 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 4 states. [2019-11-16 00:06:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:26,525 INFO L93 Difference]: Finished difference Result 13382 states and 39332 transitions. [2019-11-16 00:06:26,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:26,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:06:26,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:26,550 INFO L225 Difference]: With dead ends: 13382 [2019-11-16 00:06:26,550 INFO L226 Difference]: Without dead ends: 13382 [2019-11-16 00:06:26,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:26,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13382 states. [2019-11-16 00:06:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13382 to 11723. [2019-11-16 00:06:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11723 states. [2019-11-16 00:06:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11723 states to 11723 states and 34576 transitions. [2019-11-16 00:06:26,763 INFO L78 Accepts]: Start accepts. Automaton has 11723 states and 34576 transitions. Word has length 66 [2019-11-16 00:06:26,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:26,763 INFO L462 AbstractCegarLoop]: Abstraction has 11723 states and 34576 transitions. [2019-11-16 00:06:26,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 11723 states and 34576 transitions. [2019-11-16 00:06:26,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:26,773 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:26,774 INFO L380 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] [2019-11-16 00:06:26,774 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:26,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1438396840, now seen corresponding path program 1 times [2019-11-16 00:06:26,775 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:26,775 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632792665] [2019-11-16 00:06:26,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:26,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:26,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632792665] [2019-11-16 00:06:26,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:26,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:26,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804753437] [2019-11-16 00:06:26,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:26,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:26,903 INFO L87 Difference]: Start difference. First operand 11723 states and 34576 transitions. Second operand 6 states. [2019-11-16 00:06:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:27,513 INFO L93 Difference]: Finished difference Result 12872 states and 37333 transitions. [2019-11-16 00:06:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:27,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:06:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:27,537 INFO L225 Difference]: With dead ends: 12872 [2019-11-16 00:06:27,537 INFO L226 Difference]: Without dead ends: 12872 [2019-11-16 00:06:27,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12872 states. [2019-11-16 00:06:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12872 to 12572. [2019-11-16 00:06:27,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12572 states. [2019-11-16 00:06:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12572 states to 12572 states and 36575 transitions. [2019-11-16 00:06:27,730 INFO L78 Accepts]: Start accepts. Automaton has 12572 states and 36575 transitions. Word has length 66 [2019-11-16 00:06:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:27,730 INFO L462 AbstractCegarLoop]: Abstraction has 12572 states and 36575 transitions. [2019-11-16 00:06:27,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 12572 states and 36575 transitions. [2019-11-16 00:06:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:27,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:27,738 INFO L380 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] [2019-11-16 00:06:27,738 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:27,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1894956439, now seen corresponding path program 1 times [2019-11-16 00:06:27,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:27,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110930271] [2019-11-16 00:06:27,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:27,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:27,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110930271] [2019-11-16 00:06:27,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:27,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:27,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641240164] [2019-11-16 00:06:27,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:27,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:27,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:27,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:27,855 INFO L87 Difference]: Start difference. First operand 12572 states and 36575 transitions. Second operand 6 states. [2019-11-16 00:06:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:28,315 INFO L93 Difference]: Finished difference Result 14461 states and 40823 transitions. [2019-11-16 00:06:28,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:28,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:06:28,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:28,335 INFO L225 Difference]: With dead ends: 14461 [2019-11-16 00:06:28,335 INFO L226 Difference]: Without dead ends: 14461 [2019-11-16 00:06:28,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14461 states. [2019-11-16 00:06:28,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14461 to 13135. [2019-11-16 00:06:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-11-16 00:06:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 37544 transitions. [2019-11-16 00:06:28,519 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 37544 transitions. Word has length 66 [2019-11-16 00:06:28,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:28,519 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 37544 transitions. [2019-11-16 00:06:28,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:28,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 37544 transitions. [2019-11-16 00:06:28,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:28,528 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:28,528 INFO L380 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] [2019-11-16 00:06:28,528 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:28,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:28,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1683605526, now seen corresponding path program 1 times [2019-11-16 00:06:28,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:28,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018176037] [2019-11-16 00:06:28,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:28,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:28,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:28,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018176037] [2019-11-16 00:06:28,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:28,594 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:28,594 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574442189] [2019-11-16 00:06:28,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:28,595 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:28,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:28,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:28,595 INFO L87 Difference]: Start difference. First operand 13135 states and 37544 transitions. Second operand 5 states. [2019-11-16 00:06:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:28,984 INFO L93 Difference]: Finished difference Result 16961 states and 48256 transitions. [2019-11-16 00:06:28,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:28,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:06:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:29,007 INFO L225 Difference]: With dead ends: 16961 [2019-11-16 00:06:29,007 INFO L226 Difference]: Without dead ends: 16961 [2019-11-16 00:06:29,008 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:29,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16961 states. [2019-11-16 00:06:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16961 to 15665. [2019-11-16 00:06:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15665 states. [2019-11-16 00:06:29,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15665 states to 15665 states and 44441 transitions. [2019-11-16 00:06:29,221 INFO L78 Accepts]: Start accepts. Automaton has 15665 states and 44441 transitions. Word has length 66 [2019-11-16 00:06:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:29,221 INFO L462 AbstractCegarLoop]: Abstraction has 15665 states and 44441 transitions. [2019-11-16 00:06:29,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 15665 states and 44441 transitions. [2019-11-16 00:06:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:29,231 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:29,231 INFO L380 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] [2019-11-16 00:06:29,231 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2100827593, now seen corresponding path program 1 times [2019-11-16 00:06:29,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:29,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381377447] [2019-11-16 00:06:29,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:29,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:29,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381377447] [2019-11-16 00:06:29,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:29,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:29,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805825361] [2019-11-16 00:06:29,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:29,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:29,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:29,327 INFO L87 Difference]: Start difference. First operand 15665 states and 44441 transitions. Second operand 6 states. [2019-11-16 00:06:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:30,233 INFO L93 Difference]: Finished difference Result 19496 states and 55572 transitions. [2019-11-16 00:06:30,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:30,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-16 00:06:30,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:30,262 INFO L225 Difference]: With dead ends: 19496 [2019-11-16 00:06:30,262 INFO L226 Difference]: Without dead ends: 19367 [2019-11-16 00:06:30,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19367 states. [2019-11-16 00:06:30,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19367 to 18257. [2019-11-16 00:06:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18257 states. [2019-11-16 00:06:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18257 states to 18257 states and 51848 transitions. [2019-11-16 00:06:30,511 INFO L78 Accepts]: Start accepts. Automaton has 18257 states and 51848 transitions. Word has length 66 [2019-11-16 00:06:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:30,511 INFO L462 AbstractCegarLoop]: Abstraction has 18257 states and 51848 transitions. [2019-11-16 00:06:30,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18257 states and 51848 transitions. [2019-11-16 00:06:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:30,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:30,519 INFO L380 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] [2019-11-16 00:06:30,520 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:30,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:30,520 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-16 00:06:30,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:30,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985365667] [2019-11-16 00:06:30,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:30,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:30,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:30,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985365667] [2019-11-16 00:06:30,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:30,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:30,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278272143] [2019-11-16 00:06:30,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:30,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:30,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:30,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:30,669 INFO L87 Difference]: Start difference. First operand 18257 states and 51848 transitions. Second operand 7 states. [2019-11-16 00:06:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:31,183 INFO L93 Difference]: Finished difference Result 21797 states and 60750 transitions. [2019-11-16 00:06:31,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:06:31,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-16 00:06:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:31,214 INFO L225 Difference]: With dead ends: 21797 [2019-11-16 00:06:31,214 INFO L226 Difference]: Without dead ends: 21797 [2019-11-16 00:06:31,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:06:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21797 states. [2019-11-16 00:06:31,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21797 to 18364. [2019-11-16 00:06:31,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18364 states. [2019-11-16 00:06:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18364 states to 18364 states and 51120 transitions. [2019-11-16 00:06:31,472 INFO L78 Accepts]: Start accepts. Automaton has 18364 states and 51120 transitions. Word has length 66 [2019-11-16 00:06:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:31,472 INFO L462 AbstractCegarLoop]: Abstraction has 18364 states and 51120 transitions. [2019-11-16 00:06:31,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 18364 states and 51120 transitions. [2019-11-16 00:06:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:31,480 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:31,480 INFO L380 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] [2019-11-16 00:06:31,480 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1191379915, now seen corresponding path program 1 times [2019-11-16 00:06:31,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:31,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468580608] [2019-11-16 00:06:31,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:31,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468580608] [2019-11-16 00:06:31,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:31,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:31,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738573223] [2019-11-16 00:06:31,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:31,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:31,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:31,564 INFO L87 Difference]: Start difference. First operand 18364 states and 51120 transitions. Second operand 5 states. [2019-11-16 00:06:31,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:31,621 INFO L93 Difference]: Finished difference Result 6130 states and 14461 transitions. [2019-11-16 00:06:31,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:06:31,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-16 00:06:31,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:31,627 INFO L225 Difference]: With dead ends: 6130 [2019-11-16 00:06:31,627 INFO L226 Difference]: Without dead ends: 5260 [2019-11-16 00:06:31,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2019-11-16 00:06:31,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 4725. [2019-11-16 00:06:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-16 00:06:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 10820 transitions. [2019-11-16 00:06:31,681 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 10820 transitions. Word has length 66 [2019-11-16 00:06:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:31,682 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 10820 transitions. [2019-11-16 00:06:31,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:31,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 10820 transitions. [2019-11-16 00:06:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:06:31,685 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:31,686 INFO L380 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] [2019-11-16 00:06:31,686 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-16 00:06:31,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:31,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886431846] [2019-11-16 00:06:31,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,687 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:31,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:31,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886431846] [2019-11-16 00:06:31,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:31,726 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:06:31,726 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946481605] [2019-11-16 00:06:31,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:06:31,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:06:31,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:31,727 INFO L87 Difference]: Start difference. First operand 4725 states and 10820 transitions. Second operand 3 states. [2019-11-16 00:06:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:31,771 INFO L93 Difference]: Finished difference Result 5855 states and 13186 transitions. [2019-11-16 00:06:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:06:31,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-16 00:06:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:31,779 INFO L225 Difference]: With dead ends: 5855 [2019-11-16 00:06:31,779 INFO L226 Difference]: Without dead ends: 5855 [2019-11-16 00:06:31,780 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:06:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-11-16 00:06:31,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4660. [2019-11-16 00:06:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-16 00:06:31,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 10382 transitions. [2019-11-16 00:06:31,852 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 10382 transitions. Word has length 66 [2019-11-16 00:06:31,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:31,852 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 10382 transitions. [2019-11-16 00:06:31,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:06:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 10382 transitions. [2019-11-16 00:06:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:06:31,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:31,859 INFO L380 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] [2019-11-16 00:06:31,859 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:31,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-16 00:06:31,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:31,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296245878] [2019-11-16 00:06:31,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:31,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:31,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296245878] [2019-11-16 00:06:31,934 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:31,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:31,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064857308] [2019-11-16 00:06:31,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:31,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:31,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:31,939 INFO L87 Difference]: Start difference. First operand 4660 states and 10382 transitions. Second operand 5 states. [2019-11-16 00:06:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:32,157 INFO L93 Difference]: Finished difference Result 5721 states and 12811 transitions. [2019-11-16 00:06:32,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:06:32,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-16 00:06:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:32,163 INFO L225 Difference]: With dead ends: 5721 [2019-11-16 00:06:32,163 INFO L226 Difference]: Without dead ends: 5721 [2019-11-16 00:06:32,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-11-16 00:06:32,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5080. [2019-11-16 00:06:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-11-16 00:06:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 11340 transitions. [2019-11-16 00:06:32,216 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 11340 transitions. Word has length 72 [2019-11-16 00:06:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:32,216 INFO L462 AbstractCegarLoop]: Abstraction has 5080 states and 11340 transitions. [2019-11-16 00:06:32,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 11340 transitions. [2019-11-16 00:06:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-16 00:06:32,220 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:32,221 INFO L380 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] [2019-11-16 00:06:32,221 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:32,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-16 00:06:32,222 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:32,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397195808] [2019-11-16 00:06:32,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:32,298 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397195808] [2019-11-16 00:06:32,298 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:32,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:32,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186206179] [2019-11-16 00:06:32,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:32,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:32,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:32,300 INFO L87 Difference]: Start difference. First operand 5080 states and 11340 transitions. Second operand 7 states. [2019-11-16 00:06:32,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:32,865 INFO L93 Difference]: Finished difference Result 5820 states and 12863 transitions. [2019-11-16 00:06:32,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:06:32,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-16 00:06:32,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:32,872 INFO L225 Difference]: With dead ends: 5820 [2019-11-16 00:06:32,873 INFO L226 Difference]: Without dead ends: 5767 [2019-11-16 00:06:32,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:06:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-16 00:06:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5167. [2019-11-16 00:06:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2019-11-16 00:06:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 11429 transitions. [2019-11-16 00:06:32,943 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 11429 transitions. Word has length 72 [2019-11-16 00:06:32,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:32,943 INFO L462 AbstractCegarLoop]: Abstraction has 5167 states and 11429 transitions. [2019-11-16 00:06:32,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 11429 transitions. [2019-11-16 00:06:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:06:32,948 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:32,948 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:32,948 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 313645306, now seen corresponding path program 1 times [2019-11-16 00:06:32,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:32,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653994134] [2019-11-16 00:06:32,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,950 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:32,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:33,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653994134] [2019-11-16 00:06:33,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:33,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:06:33,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383039667] [2019-11-16 00:06:33,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:06:33,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:33,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:06:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:33,008 INFO L87 Difference]: Start difference. First operand 5167 states and 11429 transitions. Second operand 5 states. [2019-11-16 00:06:33,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:33,392 INFO L93 Difference]: Finished difference Result 6009 states and 13221 transitions. [2019-11-16 00:06:33,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:06:33,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-16 00:06:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:33,398 INFO L225 Difference]: With dead ends: 6009 [2019-11-16 00:06:33,398 INFO L226 Difference]: Without dead ends: 6009 [2019-11-16 00:06:33,398 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:33,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-11-16 00:06:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5312. [2019-11-16 00:06:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-11-16 00:06:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 11744 transitions. [2019-11-16 00:06:33,454 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 11744 transitions. Word has length 93 [2019-11-16 00:06:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,454 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 11744 transitions. [2019-11-16 00:06:33,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:06:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 11744 transitions. [2019-11-16 00:06:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:06:33,459 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,459 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:33,460 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1223592850, now seen corresponding path program 1 times [2019-11-16 00:06:33,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759307256] [2019-11-16 00:06:33,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:33,526 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759307256] [2019-11-16 00:06:33,526 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:33,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:33,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566965497] [2019-11-16 00:06:33,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:33,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:33,528 INFO L87 Difference]: Start difference. First operand 5312 states and 11744 transitions. Second operand 4 states. [2019-11-16 00:06:33,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:33,653 INFO L93 Difference]: Finished difference Result 6275 states and 13793 transitions. [2019-11-16 00:06:33,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:06:33,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-16 00:06:33,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:33,660 INFO L225 Difference]: With dead ends: 6275 [2019-11-16 00:06:33,660 INFO L226 Difference]: Without dead ends: 6275 [2019-11-16 00:06:33,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-11-16 00:06:33,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5506. [2019-11-16 00:06:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-11-16 00:06:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12150 transitions. [2019-11-16 00:06:33,742 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12150 transitions. Word has length 93 [2019-11-16 00:06:33,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:33,742 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12150 transitions. [2019-11-16 00:06:33,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12150 transitions. [2019-11-16 00:06:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:33,749 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:33,749 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:33,750 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:33,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:33,750 INFO L82 PathProgramCache]: Analyzing trace with hash -45263679, now seen corresponding path program 1 times [2019-11-16 00:06:33,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:33,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845875601] [2019-11-16 00:06:33,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:33,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:33,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:33,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845875601] [2019-11-16 00:06:33,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:33,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:06:33,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946064248] [2019-11-16 00:06:33,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:06:33,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:33,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:06:33,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:06:33,917 INFO L87 Difference]: Start difference. First operand 5506 states and 12150 transitions. Second operand 8 states. [2019-11-16 00:06:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:34,850 INFO L93 Difference]: Finished difference Result 7002 states and 15221 transitions. [2019-11-16 00:06:34,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:06:34,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-16 00:06:34,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:34,857 INFO L225 Difference]: With dead ends: 7002 [2019-11-16 00:06:34,857 INFO L226 Difference]: Without dead ends: 6949 [2019-11-16 00:06:34,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-16 00:06:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6949 states. [2019-11-16 00:06:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6949 to 5919. [2019-11-16 00:06:34,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5919 states. [2019-11-16 00:06:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 12985 transitions. [2019-11-16 00:06:34,945 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 12985 transitions. Word has length 95 [2019-11-16 00:06:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:34,946 INFO L462 AbstractCegarLoop]: Abstraction has 5919 states and 12985 transitions. [2019-11-16 00:06:34,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:06:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 12985 transitions. [2019-11-16 00:06:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:34,955 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:34,955 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:34,955 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash -24926304, now seen corresponding path program 1 times [2019-11-16 00:06:34,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:34,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927000579] [2019-11-16 00:06:34,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:34,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:34,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:35,029 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927000579] [2019-11-16 00:06:35,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:06:35,030 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116107688] [2019-11-16 00:06:35,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:06:35,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:06:35,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:06:35,031 INFO L87 Difference]: Start difference. First operand 5919 states and 12985 transitions. Second operand 4 states. [2019-11-16 00:06:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:35,280 INFO L93 Difference]: Finished difference Result 6877 states and 15030 transitions. [2019-11-16 00:06:35,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:06:35,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-16 00:06:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:35,287 INFO L225 Difference]: With dead ends: 6877 [2019-11-16 00:06:35,287 INFO L226 Difference]: Without dead ends: 6809 [2019-11-16 00:06:35,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:06:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-11-16 00:06:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6299. [2019-11-16 00:06:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-11-16 00:06:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 13863 transitions. [2019-11-16 00:06:35,352 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 13863 transitions. Word has length 95 [2019-11-16 00:06:35,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:35,352 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 13863 transitions. [2019-11-16 00:06:35,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:06:35,352 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 13863 transitions. [2019-11-16 00:06:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:35,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:35,357 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:35,358 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:35,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2102135647, now seen corresponding path program 1 times [2019-11-16 00:06:35,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:35,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094325890] [2019-11-16 00:06:35,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:35,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:35,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094325890] [2019-11-16 00:06:35,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:35,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:06:35,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118588555] [2019-11-16 00:06:35,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:06:35,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:35,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:06:35,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:35,545 INFO L87 Difference]: Start difference. First operand 6299 states and 13863 transitions. Second operand 9 states. [2019-11-16 00:06:36,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:36,279 INFO L93 Difference]: Finished difference Result 7519 states and 16443 transitions. [2019-11-16 00:06:36,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:06:36,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-16 00:06:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:36,286 INFO L225 Difference]: With dead ends: 7519 [2019-11-16 00:06:36,286 INFO L226 Difference]: Without dead ends: 7519 [2019-11-16 00:06:36,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:06:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2019-11-16 00:06:36,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 6108. [2019-11-16 00:06:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6108 states. [2019-11-16 00:06:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 13443 transitions. [2019-11-16 00:06:36,353 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 13443 transitions. Word has length 95 [2019-11-16 00:06:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:36,354 INFO L462 AbstractCegarLoop]: Abstraction has 6108 states and 13443 transitions. [2019-11-16 00:06:36,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:06:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 13443 transitions. [2019-11-16 00:06:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:36,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:36,359 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:36,359 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:36,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1890784734, now seen corresponding path program 1 times [2019-11-16 00:06:36,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:36,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200130455] [2019-11-16 00:06:36,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:36,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:36,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:36,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200130455] [2019-11-16 00:06:36,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:36,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:06:36,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846193634] [2019-11-16 00:06:36,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:06:36,549 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:36,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:06:36,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:06:36,550 INFO L87 Difference]: Start difference. First operand 6108 states and 13443 transitions. Second operand 9 states. [2019-11-16 00:06:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:37,128 INFO L93 Difference]: Finished difference Result 7033 states and 15424 transitions. [2019-11-16 00:06:37,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-16 00:06:37,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-16 00:06:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:37,137 INFO L225 Difference]: With dead ends: 7033 [2019-11-16 00:06:37,137 INFO L226 Difference]: Without dead ends: 7005 [2019-11-16 00:06:37,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:06:37,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7005 states. [2019-11-16 00:06:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7005 to 6082. [2019-11-16 00:06:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2019-11-16 00:06:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 13396 transitions. [2019-11-16 00:06:37,228 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 13396 transitions. Word has length 95 [2019-11-16 00:06:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:37,229 INFO L462 AbstractCegarLoop]: Abstraction has 6082 states and 13396 transitions. [2019-11-16 00:06:37,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:06:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 13396 transitions. [2019-11-16 00:06:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:37,236 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:37,237 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:37,237 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1003281053, now seen corresponding path program 1 times [2019-11-16 00:06:37,237 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:37,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017385734] [2019-11-16 00:06:37,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:37,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:37,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:37,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017385734] [2019-11-16 00:06:37,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:37,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-16 00:06:37,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957489564] [2019-11-16 00:06:37,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:06:37,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:06:37,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:06:37,410 INFO L87 Difference]: Start difference. First operand 6082 states and 13396 transitions. Second operand 10 states. [2019-11-16 00:06:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:37,990 INFO L93 Difference]: Finished difference Result 18898 states and 42296 transitions. [2019-11-16 00:06:37,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-16 00:06:37,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-16 00:06:37,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:38,007 INFO L225 Difference]: With dead ends: 18898 [2019-11-16 00:06:38,007 INFO L226 Difference]: Without dead ends: 12522 [2019-11-16 00:06:38,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:06:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-11-16 00:06:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 5987. [2019-11-16 00:06:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-11-16 00:06:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 13116 transitions. [2019-11-16 00:06:38,104 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 13116 transitions. Word has length 95 [2019-11-16 00:06:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:38,104 INFO L462 AbstractCegarLoop]: Abstraction has 5987 states and 13116 transitions. [2019-11-16 00:06:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:06:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 13116 transitions. [2019-11-16 00:06:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:38,109 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:38,109 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:38,110 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:38,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:38,110 INFO L82 PathProgramCache]: Analyzing trace with hash 873793154, now seen corresponding path program 1 times [2019-11-16 00:06:38,110 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:38,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126823882] [2019-11-16 00:06:38,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:38,110 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:38,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:38,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:38,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126823882] [2019-11-16 00:06:38,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:38,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:06:38,241 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125066826] [2019-11-16 00:06:38,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:06:38,242 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:06:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:06:38,242 INFO L87 Difference]: Start difference. First operand 5987 states and 13116 transitions. Second operand 6 states. [2019-11-16 00:06:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:38,505 INFO L93 Difference]: Finished difference Result 6745 states and 14647 transitions. [2019-11-16 00:06:38,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:06:38,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-16 00:06:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:38,514 INFO L225 Difference]: With dead ends: 6745 [2019-11-16 00:06:38,514 INFO L226 Difference]: Without dead ends: 6686 [2019-11-16 00:06:38,514 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2019-11-16 00:06:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 6007. [2019-11-16 00:06:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6007 states. [2019-11-16 00:06:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6007 states to 6007 states and 13085 transitions. [2019-11-16 00:06:38,608 INFO L78 Accepts]: Start accepts. Automaton has 6007 states and 13085 transitions. Word has length 95 [2019-11-16 00:06:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:38,609 INFO L462 AbstractCegarLoop]: Abstraction has 6007 states and 13085 transitions. [2019-11-16 00:06:38,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:06:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6007 states and 13085 transitions. [2019-11-16 00:06:38,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:38,616 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:38,616 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:38,617 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:38,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:38,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1941804482, now seen corresponding path program 2 times [2019-11-16 00:06:38,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:38,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568619067] [2019-11-16 00:06:38,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:38,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:38,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:06:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:06:38,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568619067] [2019-11-16 00:06:38,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:06:38,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:06:38,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435951135] [2019-11-16 00:06:38,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:06:38,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:06:38,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:06:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:06:38,730 INFO L87 Difference]: Start difference. First operand 6007 states and 13085 transitions. Second operand 7 states. [2019-11-16 00:06:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:06:39,110 INFO L93 Difference]: Finished difference Result 6072 states and 13151 transitions. [2019-11-16 00:06:39,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:06:39,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-16 00:06:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:06:39,117 INFO L225 Difference]: With dead ends: 6072 [2019-11-16 00:06:39,117 INFO L226 Difference]: Without dead ends: 6072 [2019-11-16 00:06:39,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:06:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-11-16 00:06:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5827. [2019-11-16 00:06:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2019-11-16 00:06:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 12649 transitions. [2019-11-16 00:06:39,195 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 12649 transitions. Word has length 95 [2019-11-16 00:06:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:06:39,195 INFO L462 AbstractCegarLoop]: Abstraction has 5827 states and 12649 transitions. [2019-11-16 00:06:39,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:06:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 12649 transitions. [2019-11-16 00:06:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-16 00:06:39,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:06:39,202 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:06:39,203 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:06:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:06:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash 425096515, now seen corresponding path program 2 times [2019-11-16 00:06:39,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:06:39,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896491183] [2019-11-16 00:06:39,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:39,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:06:39,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:06:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:06:39,333 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:06:39,334 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:06:39,527 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:06:39,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:06:39 BasicIcfg [2019-11-16 00:06:39,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:06:39,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:06:39,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:06:39,534 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:06:39,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:05:53" (3/4) ... [2019-11-16 00:06:39,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:06:39,712 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bba104e0-ea5b-41d6-8882-fea2557ec479/bin/uautomizer/witness.graphml [2019-11-16 00:06:39,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:06:39,714 INFO L168 Benchmark]: Toolchain (without parser) took 47800.14 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 944.7 MB in the beginning and 3.2 GB in the end (delta: -2.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,715 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:06:39,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.41 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,716 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 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. [2019-11-16 00:06:39,716 INFO L168 Benchmark]: RCFGBuilder took 771.33 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,716 INFO L168 Benchmark]: TraceAbstraction took 46044.01 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,717 INFO L168 Benchmark]: Witness Printer took 179.12 ms. Allocated memory is still 4.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:06:39,720 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 686.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -144.9 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.41 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.60 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. * RCFGBuilder took 771.33 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46044.01 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 179.12 ms. Allocated memory is still 4.8 GB. Free memory was 3.3 GB in the beginning and 3.2 GB in the end (delta: 71.2 MB). Peak memory consumption was 71.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t2313; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t2313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t2314; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t2314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 45.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8837 SDtfs, 10271 SDslu, 21334 SDs, 0 SdLazy, 8663 SolverSat, 521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 88 SyntacticMatches, 25 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.8s AutomataMinimizationTime, 31 MinimizatonAttempts, 88232 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2224 NumberOfCodeBlocks, 2224 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2098 ConstructedInterpolants, 0 QuantifiedInterpolants, 421600 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...