./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_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_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/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 cdedd2c6a1c364b12302caa45346a9281105eb2c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-15 21:34:24,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:34:24,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:34:24,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:34:24,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:34:24,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:34:24,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:34:24,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:34:24,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:34:24,095 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:34:24,096 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:34:24,097 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:34:24,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:34:24,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:34:24,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:34:24,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:34:24,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:34:24,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:34:24,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:34:24,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:34:24,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:34:24,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:34:24,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:34:24,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:34:24,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:34:24,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:34:24,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:34:24,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:34:24,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:34:24,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:34:24,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:34:24,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:34:24,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:34:24,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:34:24,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:34:24,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:34:24,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:34:24,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:34:24,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:34:24,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:34:24,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:34:24,122 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:34:24,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:34:24,136 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:34:24,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:34:24,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:34:24,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:34:24,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:34:24,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:34:24,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:34:24,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:34:24,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:34:24,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:34:24,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:34:24,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:34:24,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:34:24,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:34:24,140 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:34:24,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:34:24,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:34:24,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:34:24,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:34:24,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:34:24,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:34:24,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:34:24,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:34:24,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:34:24,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:34:24,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:34:24,142 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:34:24,143 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_976b91e7-44b3-4690-83c4-a13dd9f5adf2/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 -> cdedd2c6a1c364b12302caa45346a9281105eb2c [2019-11-15 21:34:24,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:34:24,181 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:34:24,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:34:24,186 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:34:24,187 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:34:24,187 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-11-15 21:34:24,247 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/data/aef7a263f/aad8cf4e4ba1483090514c1f2a1a649e/FLAGe26b5f2d4 [2019-11-15 21:34:24,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:34:24,676 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/sv-benchmarks/c/pthread-wmm/safe033_rmo.oepc.i [2019-11-15 21:34:24,692 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/data/aef7a263f/aad8cf4e4ba1483090514c1f2a1a649e/FLAGe26b5f2d4 [2019-11-15 21:34:24,998 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/data/aef7a263f/aad8cf4e4ba1483090514c1f2a1a649e [2019-11-15 21:34:25,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:34:25,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:34:25,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:25,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:34:25,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:34:25,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:24" (1/1) ... [2019-11-15 21:34:25,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c890f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25, skipping insertion in model container [2019-11-15 21:34:25,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:34:24" (1/1) ... [2019-11-15 21:34:25,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:34:25,064 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:34:25,472 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:25,484 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:34:25,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:34:25,638 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:34:25,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25 WrapperNode [2019-11-15 21:34:25,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:34:25,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:34:25,641 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:34:25,641 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:34:25,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:34:25,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:34:25,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:34:25,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:34:25,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... [2019-11-15 21:34:25,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:34:25,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:34:25,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:34:25,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:34:25,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/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-15 21:34:25,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:34:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 21:34:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:34:25,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:34:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 21:34:25,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 21:34:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 21:34:25,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 21:34:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 21:34:25,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:34:25,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:34:25,820 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 21:34:26,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:34:26,656 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:34:26,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:26 BoogieIcfgContainer [2019-11-15 21:34:26,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:34:26,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:34:26,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:34:26,662 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:34:26,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:34:24" (1/3) ... [2019-11-15 21:34:26,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a8257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:26, skipping insertion in model container [2019-11-15 21:34:26,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:34:25" (2/3) ... [2019-11-15 21:34:26,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8a8257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:34:26, skipping insertion in model container [2019-11-15 21:34:26,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:26" (3/3) ... [2019-11-15 21:34:26,665 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.oepc.i [2019-11-15 21:34:26,748 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,749 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,750 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,750 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,750 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,756 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,756 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,756 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,756 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,756 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,759 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,759 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,759 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,759 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,759 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,760 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,760 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,760 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,760 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,760 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,761 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,761 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,761 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,761 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,761 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,762 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,763 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,763 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,763 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,763 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,764 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,765 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,765 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,765 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,765 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,765 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,766 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,767 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,767 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,767 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,767 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,768 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,768 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,768 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,768 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,768 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,769 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,769 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,769 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,769 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,770 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,770 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,770 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,770 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,770 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,771 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,772 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,772 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,772 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,772 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,773 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,774 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 21:34:26,781 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 21:34:26,781 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:34:26,789 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 21:34:26,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 21:34:26,820 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:34:26,820 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:34:26,820 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:34:26,821 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:34:26,821 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:34:26,821 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:34:26,821 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:34:26,821 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:34:26,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 159 transitions [2019-11-15 21:34:28,938 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25973 states. [2019-11-15 21:34:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states. [2019-11-15 21:34:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 21:34:28,950 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:28,950 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] [2019-11-15 21:34:28,952 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash 531989487, now seen corresponding path program 1 times [2019-11-15 21:34:28,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:28,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803336784] [2019-11-15 21:34:28,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:28,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:28,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:29,254 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-15 21:34:29,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803336784] [2019-11-15 21:34:29,255 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:29,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:34:29,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794637071] [2019-11-15 21:34:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:29,261 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:29,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:29,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:29,278 INFO L87 Difference]: Start difference. First operand 25973 states. Second operand 4 states. [2019-11-15 21:34:29,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:29,966 INFO L93 Difference]: Finished difference Result 26613 states and 102118 transitions. [2019-11-15 21:34:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:34:29,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-15 21:34:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:30,480 INFO L225 Difference]: With dead ends: 26613 [2019-11-15 21:34:30,480 INFO L226 Difference]: Without dead ends: 20357 [2019-11-15 21:34:30,482 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-15 21:34:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20357 states. [2019-11-15 21:34:31,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20357 to 20357. [2019-11-15 21:34:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-11-15 21:34:31,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 78422 transitions. [2019-11-15 21:34:31,636 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 78422 transitions. Word has length 36 [2019-11-15 21:34:31,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:31,636 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 78422 transitions. [2019-11-15 21:34:31,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:31,637 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 78422 transitions. [2019-11-15 21:34:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:34:31,648 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:31,648 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] [2019-11-15 21:34:31,649 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:31,649 INFO L82 PathProgramCache]: Analyzing trace with hash 998522529, now seen corresponding path program 1 times [2019-11-15 21:34:31,649 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:31,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266382578] [2019-11-15 21:34:31,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:31,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:31,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:31,844 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-15 21:34:31,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266382578] [2019-11-15 21:34:31,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:31,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:34:31,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420300259] [2019-11-15 21:34:31,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:34:31,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:31,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:31,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:34:31,852 INFO L87 Difference]: Start difference. First operand 20357 states and 78422 transitions. Second operand 5 states. [2019-11-15 21:34:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:33,164 INFO L93 Difference]: Finished difference Result 31835 states and 116039 transitions. [2019-11-15 21:34:33,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:34:33,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-15 21:34:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:33,676 INFO L225 Difference]: With dead ends: 31835 [2019-11-15 21:34:33,677 INFO L226 Difference]: Without dead ends: 31283 [2019-11-15 21:34:33,679 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-15 21:34:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-11-15 21:34:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 29702. [2019-11-15 21:34:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29702 states. [2019-11-15 21:34:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29702 states to 29702 states and 109516 transitions. [2019-11-15 21:34:34,698 INFO L78 Accepts]: Start accepts. Automaton has 29702 states and 109516 transitions. Word has length 44 [2019-11-15 21:34:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:34,701 INFO L462 AbstractCegarLoop]: Abstraction has 29702 states and 109516 transitions. [2019-11-15 21:34:34,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:34:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 29702 states and 109516 transitions. [2019-11-15 21:34:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 21:34:34,708 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:34,708 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-15 21:34:34,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:34,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash -192170192, now seen corresponding path program 1 times [2019-11-15 21:34:34,709 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:34,709 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118392847] [2019-11-15 21:34:34,709 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:34,710 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:34,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:34,791 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-15 21:34:34,791 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118392847] [2019-11-15 21:34:34,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:34,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:34:34,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016490218] [2019-11-15 21:34:34,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:34:34,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:34:34,794 INFO L87 Difference]: Start difference. First operand 29702 states and 109516 transitions. Second operand 5 states. [2019-11-15 21:34:35,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:35,752 INFO L93 Difference]: Finished difference Result 38693 states and 139688 transitions. [2019-11-15 21:34:35,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:34:35,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 21:34:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:35,923 INFO L225 Difference]: With dead ends: 38693 [2019-11-15 21:34:35,923 INFO L226 Difference]: Without dead ends: 38245 [2019-11-15 21:34:35,924 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-15 21:34:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38245 states. [2019-11-15 21:34:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38245 to 32948. [2019-11-15 21:34:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32948 states. [2019-11-15 21:34:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32948 states to 32948 states and 120525 transitions. [2019-11-15 21:34:37,041 INFO L78 Accepts]: Start accepts. Automaton has 32948 states and 120525 transitions. Word has length 45 [2019-11-15 21:34:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:37,042 INFO L462 AbstractCegarLoop]: Abstraction has 32948 states and 120525 transitions. [2019-11-15 21:34:37,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:34:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32948 states and 120525 transitions. [2019-11-15 21:34:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:34:37,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:37,052 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] [2019-11-15 21:34:37,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:37,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1923602230, now seen corresponding path program 1 times [2019-11-15 21:34:37,053 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:37,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844575039] [2019-11-15 21:34:37,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:37,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:37,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:37,096 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-15 21:34:37,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844575039] [2019-11-15 21:34:37,097 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:37,097 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:34:37,097 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007032841] [2019-11-15 21:34:37,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:37,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:37,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:37,098 INFO L87 Difference]: Start difference. First operand 32948 states and 120525 transitions. Second operand 3 states. [2019-11-15 21:34:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:37,381 INFO L93 Difference]: Finished difference Result 42409 states and 152016 transitions. [2019-11-15 21:34:37,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:37,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-15 21:34:37,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:38,168 INFO L225 Difference]: With dead ends: 42409 [2019-11-15 21:34:38,168 INFO L226 Difference]: Without dead ends: 42409 [2019-11-15 21:34:38,169 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-15 21:34:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2019-11-15 21:34:38,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 37662. [2019-11-15 21:34:38,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37662 states. [2019-11-15 21:34:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37662 states to 37662 states and 136329 transitions. [2019-11-15 21:34:39,043 INFO L78 Accepts]: Start accepts. Automaton has 37662 states and 136329 transitions. Word has length 47 [2019-11-15 21:34:39,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:39,043 INFO L462 AbstractCegarLoop]: Abstraction has 37662 states and 136329 transitions. [2019-11-15 21:34:39,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37662 states and 136329 transitions. [2019-11-15 21:34:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:34:39,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:39,060 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] [2019-11-15 21:34:39,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash -629683857, now seen corresponding path program 1 times [2019-11-15 21:34:39,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:39,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093334814] [2019-11-15 21:34:39,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:39,062 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:39,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:39,158 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-15 21:34:39,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093334814] [2019-11-15 21:34:39,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:39,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:39,159 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903262380] [2019-11-15 21:34:39,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:39,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:39,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:39,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:39,160 INFO L87 Difference]: Start difference. First operand 37662 states and 136329 transitions. Second operand 6 states. [2019-11-15 21:34:40,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:40,124 INFO L93 Difference]: Finished difference Result 48753 states and 172978 transitions. [2019-11-15 21:34:40,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:34:40,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:34:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:40,248 INFO L225 Difference]: With dead ends: 48753 [2019-11-15 21:34:40,248 INFO L226 Difference]: Without dead ends: 48233 [2019-11-15 21:34:40,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:34:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48233 states. [2019-11-15 21:34:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48233 to 38226. [2019-11-15 21:34:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38226 states. [2019-11-15 21:34:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38226 states to 38226 states and 138492 transitions. [2019-11-15 21:34:41,617 INFO L78 Accepts]: Start accepts. Automaton has 38226 states and 138492 transitions. Word has length 51 [2019-11-15 21:34:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:41,617 INFO L462 AbstractCegarLoop]: Abstraction has 38226 states and 138492 transitions. [2019-11-15 21:34:41,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 38226 states and 138492 transitions. [2019-11-15 21:34:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:34:41,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:41,632 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] [2019-11-15 21:34:41,633 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:41,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:41,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1938707736, now seen corresponding path program 1 times [2019-11-15 21:34:41,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:41,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035208561] [2019-11-15 21:34:41,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:41,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:41,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:41,814 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-15 21:34:41,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035208561] [2019-11-15 21:34:41,815 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:41,815 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:41,815 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203559792] [2019-11-15 21:34:41,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:41,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:41,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:41,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:41,816 INFO L87 Difference]: Start difference. First operand 38226 states and 138492 transitions. Second operand 6 states. [2019-11-15 21:34:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:42,769 INFO L93 Difference]: Finished difference Result 53002 states and 189568 transitions. [2019-11-15 21:34:42,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:34:42,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-15 21:34:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:42,894 INFO L225 Difference]: With dead ends: 53002 [2019-11-15 21:34:42,895 INFO L226 Difference]: Without dead ends: 52026 [2019-11-15 21:34:42,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:34:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52026 states. [2019-11-15 21:34:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52026 to 48779. [2019-11-15 21:34:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48779 states. [2019-11-15 21:34:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48779 states to 48779 states and 175223 transitions. [2019-11-15 21:34:44,531 INFO L78 Accepts]: Start accepts. Automaton has 48779 states and 175223 transitions. Word has length 51 [2019-11-15 21:34:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:44,531 INFO L462 AbstractCegarLoop]: Abstraction has 48779 states and 175223 transitions. [2019-11-15 21:34:44,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:44,531 INFO L276 IsEmpty]: Start isEmpty. Operand 48779 states and 175223 transitions. [2019-11-15 21:34:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:34:44,546 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:44,546 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] [2019-11-15 21:34:44,546 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 559308201, now seen corresponding path program 1 times [2019-11-15 21:34:44,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:44,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793617946] [2019-11-15 21:34:44,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:44,547 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:44,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:44,678 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-15 21:34:44,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793617946] [2019-11-15 21:34:44,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:44,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:34:44,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307435522] [2019-11-15 21:34:44,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:34:44,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:44,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:34:44,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:34:44,681 INFO L87 Difference]: Start difference. First operand 48779 states and 175223 transitions. Second operand 7 states. [2019-11-15 21:34:45,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:45,873 INFO L93 Difference]: Finished difference Result 70894 states and 244520 transitions. [2019-11-15 21:34:45,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:34:45,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-15 21:34:45,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:46,031 INFO L225 Difference]: With dead ends: 70894 [2019-11-15 21:34:46,031 INFO L226 Difference]: Without dead ends: 70894 [2019-11-15 21:34:46,031 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-15 21:34:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70894 states. [2019-11-15 21:34:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70894 to 57887. [2019-11-15 21:34:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57887 states. [2019-11-15 21:34:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57887 states to 57887 states and 203147 transitions. [2019-11-15 21:34:47,225 INFO L78 Accepts]: Start accepts. Automaton has 57887 states and 203147 transitions. Word has length 51 [2019-11-15 21:34:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:47,225 INFO L462 AbstractCegarLoop]: Abstraction has 57887 states and 203147 transitions. [2019-11-15 21:34:47,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:34:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57887 states and 203147 transitions. [2019-11-15 21:34:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 21:34:47,240 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:47,241 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] [2019-11-15 21:34:47,241 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1446811882, now seen corresponding path program 1 times [2019-11-15 21:34:47,241 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:47,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776643534] [2019-11-15 21:34:47,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:47,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:47,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:47,326 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-15 21:34:47,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776643534] [2019-11-15 21:34:47,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:47,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:34:47,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304017211] [2019-11-15 21:34:47,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:47,327 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:47,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:47,328 INFO L87 Difference]: Start difference. First operand 57887 states and 203147 transitions. Second operand 4 states. [2019-11-15 21:34:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:47,409 INFO L93 Difference]: Finished difference Result 10857 states and 33392 transitions. [2019-11-15 21:34:47,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:34:47,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 21:34:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:47,429 INFO L225 Difference]: With dead ends: 10857 [2019-11-15 21:34:47,429 INFO L226 Difference]: Without dead ends: 9358 [2019-11-15 21:34:47,430 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-15 21:34:47,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9358 states. [2019-11-15 21:34:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9358 to 9310. [2019-11-15 21:34:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-11-15 21:34:47,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 28342 transitions. [2019-11-15 21:34:47,950 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 28342 transitions. Word has length 51 [2019-11-15 21:34:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:47,951 INFO L462 AbstractCegarLoop]: Abstraction has 9310 states and 28342 transitions. [2019-11-15 21:34:47,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 28342 transitions. [2019-11-15 21:34:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:34:47,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:47,958 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] [2019-11-15 21:34:47,958 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:47,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:47,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1556006386, now seen corresponding path program 1 times [2019-11-15 21:34:47,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:47,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242780093] [2019-11-15 21:34:47,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:47,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:47,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:48,043 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-15 21:34:48,045 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242780093] [2019-11-15 21:34:48,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:48,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:34:48,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382100025] [2019-11-15 21:34:48,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:48,047 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:48,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:48,049 INFO L87 Difference]: Start difference. First operand 9310 states and 28342 transitions. Second operand 4 states. [2019-11-15 21:34:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:48,253 INFO L93 Difference]: Finished difference Result 10885 states and 33034 transitions. [2019-11-15 21:34:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:34:48,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-15 21:34:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:48,272 INFO L225 Difference]: With dead ends: 10885 [2019-11-15 21:34:48,272 INFO L226 Difference]: Without dead ends: 10885 [2019-11-15 21:34:48,273 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-15 21:34:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10885 states. [2019-11-15 21:34:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10885 to 9877. [2019-11-15 21:34:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9877 states. [2019-11-15 21:34:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9877 states to 9877 states and 30013 transitions. [2019-11-15 21:34:48,446 INFO L78 Accepts]: Start accepts. Automaton has 9877 states and 30013 transitions. Word has length 61 [2019-11-15 21:34:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:48,447 INFO L462 AbstractCegarLoop]: Abstraction has 9877 states and 30013 transitions. [2019-11-15 21:34:48,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9877 states and 30013 transitions. [2019-11-15 21:34:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-15 21:34:48,454 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:48,454 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] [2019-11-15 21:34:48,457 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:48,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:48,458 INFO L82 PathProgramCache]: Analyzing trace with hash 186803949, now seen corresponding path program 1 times [2019-11-15 21:34:48,458 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:48,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909406495] [2019-11-15 21:34:48,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:48,459 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:48,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:48,571 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-15 21:34:48,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909406495] [2019-11-15 21:34:48,572 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:48,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:48,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107573958] [2019-11-15 21:34:48,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:48,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:48,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:48,574 INFO L87 Difference]: Start difference. First operand 9877 states and 30013 transitions. Second operand 6 states. [2019-11-15 21:34:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:49,146 INFO L93 Difference]: Finished difference Result 12783 states and 38223 transitions. [2019-11-15 21:34:49,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:34:49,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-15 21:34:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:49,164 INFO L225 Difference]: With dead ends: 12783 [2019-11-15 21:34:49,164 INFO L226 Difference]: Without dead ends: 12735 [2019-11-15 21:34:49,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:34:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12735 states. [2019-11-15 21:34:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12735 to 10616. [2019-11-15 21:34:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10616 states. [2019-11-15 21:34:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10616 states to 10616 states and 32066 transitions. [2019-11-15 21:34:49,335 INFO L78 Accepts]: Start accepts. Automaton has 10616 states and 32066 transitions. Word has length 61 [2019-11-15 21:34:49,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:49,336 INFO L462 AbstractCegarLoop]: Abstraction has 10616 states and 32066 transitions. [2019-11-15 21:34:49,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 10616 states and 32066 transitions. [2019-11-15 21:34:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:34:49,343 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:49,343 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] [2019-11-15 21:34:49,344 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:49,344 INFO L82 PathProgramCache]: Analyzing trace with hash -45655302, now seen corresponding path program 1 times [2019-11-15 21:34:49,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:49,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125546322] [2019-11-15 21:34:49,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:49,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:49,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:49,419 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-15 21:34:49,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125546322] [2019-11-15 21:34:49,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:49,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:34:49,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347004609] [2019-11-15 21:34:49,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:49,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:49,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:49,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:49,421 INFO L87 Difference]: Start difference. First operand 10616 states and 32066 transitions. Second operand 4 states. [2019-11-15 21:34:49,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:49,661 INFO L93 Difference]: Finished difference Result 13318 states and 39668 transitions. [2019-11-15 21:34:49,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:34:49,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-15 21:34:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:49,680 INFO L225 Difference]: With dead ends: 13318 [2019-11-15 21:34:49,680 INFO L226 Difference]: Without dead ends: 13318 [2019-11-15 21:34:49,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13318 states. [2019-11-15 21:34:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13318 to 12172. [2019-11-15 21:34:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12172 states. [2019-11-15 21:34:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 36357 transitions. [2019-11-15 21:34:49,844 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 36357 transitions. Word has length 63 [2019-11-15 21:34:49,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:49,844 INFO L462 AbstractCegarLoop]: Abstraction has 12172 states and 36357 transitions. [2019-11-15 21:34:49,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 36357 transitions. [2019-11-15 21:34:49,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 21:34:49,855 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:49,855 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] [2019-11-15 21:34:49,855 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:49,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:49,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2122864645, now seen corresponding path program 1 times [2019-11-15 21:34:49,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:49,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428982242] [2019-11-15 21:34:49,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:49,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:49,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:49,895 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-15 21:34:49,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428982242] [2019-11-15 21:34:49,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:49,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:34:49,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847338712] [2019-11-15 21:34:49,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:34:49,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:49,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:34:49,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:34:49,897 INFO L87 Difference]: Start difference. First operand 12172 states and 36357 transitions. Second operand 3 states. [2019-11-15 21:34:50,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:50,159 INFO L93 Difference]: Finished difference Result 12698 states and 37762 transitions. [2019-11-15 21:34:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:34:50,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 21:34:50,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:50,178 INFO L225 Difference]: With dead ends: 12698 [2019-11-15 21:34:50,178 INFO L226 Difference]: Without dead ends: 12698 [2019-11-15 21:34:50,178 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-15 21:34:50,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12698 states. [2019-11-15 21:34:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12698 to 12460. [2019-11-15 21:34:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12460 states. [2019-11-15 21:34:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12460 states to 12460 states and 37121 transitions. [2019-11-15 21:34:50,343 INFO L78 Accepts]: Start accepts. Automaton has 12460 states and 37121 transitions. Word has length 63 [2019-11-15 21:34:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:50,344 INFO L462 AbstractCegarLoop]: Abstraction has 12460 states and 37121 transitions. [2019-11-15 21:34:50,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:34:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 12460 states and 37121 transitions. [2019-11-15 21:34:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:50,355 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:50,355 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] [2019-11-15 21:34:50,356 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:50,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:50,356 INFO L82 PathProgramCache]: Analyzing trace with hash -40717626, now seen corresponding path program 1 times [2019-11-15 21:34:50,356 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:50,356 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185188813] [2019-11-15 21:34:50,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:50,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:50,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:50,479 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-15 21:34:50,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185188813] [2019-11-15 21:34:50,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:50,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:50,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777925485] [2019-11-15 21:34:50,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:50,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:50,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:50,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:50,481 INFO L87 Difference]: Start difference. First operand 12460 states and 37121 transitions. Second operand 6 states. [2019-11-15 21:34:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:51,077 INFO L93 Difference]: Finished difference Result 13731 states and 40360 transitions. [2019-11-15 21:34:51,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:34:51,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:34:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:51,104 INFO L225 Difference]: With dead ends: 13731 [2019-11-15 21:34:51,104 INFO L226 Difference]: Without dead ends: 13731 [2019-11-15 21:34:51,104 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-15 21:34:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13731 states. [2019-11-15 21:34:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13731 to 13245. [2019-11-15 21:34:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13245 states. [2019-11-15 21:34:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13245 states to 13245 states and 39076 transitions. [2019-11-15 21:34:51,295 INFO L78 Accepts]: Start accepts. Automaton has 13245 states and 39076 transitions. Word has length 65 [2019-11-15 21:34:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:51,295 INFO L462 AbstractCegarLoop]: Abstraction has 13245 states and 39076 transitions. [2019-11-15 21:34:51,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 13245 states and 39076 transitions. [2019-11-15 21:34:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:51,313 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:51,313 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] [2019-11-15 21:34:51,313 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:51,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2117926969, now seen corresponding path program 1 times [2019-11-15 21:34:51,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:51,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335289733] [2019-11-15 21:34:51,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:51,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:51,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:51,462 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-15 21:34:51,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335289733] [2019-11-15 21:34:51,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:51,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:51,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60069540] [2019-11-15 21:34:51,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:51,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:51,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:51,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:51,464 INFO L87 Difference]: Start difference. First operand 13245 states and 39076 transitions. Second operand 6 states. [2019-11-15 21:34:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:51,829 INFO L93 Difference]: Finished difference Result 15568 states and 44586 transitions. [2019-11-15 21:34:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:34:51,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-15 21:34:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:51,852 INFO L225 Difference]: With dead ends: 15568 [2019-11-15 21:34:51,852 INFO L226 Difference]: Without dead ends: 15568 [2019-11-15 21:34:51,852 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-15 21:34:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-11-15 21:34:52,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 13819. [2019-11-15 21:34:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13819 states. [2019-11-15 21:34:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13819 states to 13819 states and 39926 transitions. [2019-11-15 21:34:52,050 INFO L78 Accepts]: Start accepts. Automaton has 13819 states and 39926 transitions. Word has length 65 [2019-11-15 21:34:52,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:52,050 INFO L462 AbstractCegarLoop]: Abstraction has 13819 states and 39926 transitions. [2019-11-15 21:34:52,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 13819 states and 39926 transitions. [2019-11-15 21:34:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:52,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:52,063 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] [2019-11-15 21:34:52,063 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:52,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:52,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1906576056, now seen corresponding path program 1 times [2019-11-15 21:34:52,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:52,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497273880] [2019-11-15 21:34:52,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:52,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:52,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:52,163 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-15 21:34:52,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497273880] [2019-11-15 21:34:52,164 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:52,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:34:52,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821644270] [2019-11-15 21:34:52,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:34:52,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:34:52,165 INFO L87 Difference]: Start difference. First operand 13819 states and 39926 transitions. Second operand 5 states. [2019-11-15 21:34:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:52,568 INFO L93 Difference]: Finished difference Result 17380 states and 50005 transitions. [2019-11-15 21:34:52,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:34:52,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:34:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:52,593 INFO L225 Difference]: With dead ends: 17380 [2019-11-15 21:34:52,593 INFO L226 Difference]: Without dead ends: 17380 [2019-11-15 21:34:52,594 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-15 21:34:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17380 states. [2019-11-15 21:34:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17380 to 14857. [2019-11-15 21:34:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14857 states. [2019-11-15 21:34:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 42558 transitions. [2019-11-15 21:34:52,807 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 42558 transitions. Word has length 65 [2019-11-15 21:34:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:52,808 INFO L462 AbstractCegarLoop]: Abstraction has 14857 states and 42558 transitions. [2019-11-15 21:34:52,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:34:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 42558 transitions. [2019-11-15 21:34:52,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:52,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:52,817 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] [2019-11-15 21:34:52,818 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:52,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1877857063, now seen corresponding path program 1 times [2019-11-15 21:34:52,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:52,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158348611] [2019-11-15 21:34:52,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:52,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:52,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:52,899 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-15 21:34:52,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158348611] [2019-11-15 21:34:52,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:52,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:34:52,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582672469] [2019-11-15 21:34:52,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:34:52,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:52,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:52,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:34:52,901 INFO L87 Difference]: Start difference. First operand 14857 states and 42558 transitions. Second operand 5 states. [2019-11-15 21:34:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:53,347 INFO L93 Difference]: Finished difference Result 19762 states and 56505 transitions. [2019-11-15 21:34:53,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:34:53,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:34:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:53,376 INFO L225 Difference]: With dead ends: 19762 [2019-11-15 21:34:53,376 INFO L226 Difference]: Without dead ends: 19762 [2019-11-15 21:34:53,376 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:34:53,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2019-11-15 21:34:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 15762. [2019-11-15 21:34:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15762 states. [2019-11-15 21:34:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15762 states to 15762 states and 45144 transitions. [2019-11-15 21:34:53,821 INFO L78 Accepts]: Start accepts. Automaton has 15762 states and 45144 transitions. Word has length 65 [2019-11-15 21:34:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:53,821 INFO L462 AbstractCegarLoop]: Abstraction has 15762 states and 45144 transitions. [2019-11-15 21:34:53,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:34:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15762 states and 45144 transitions. [2019-11-15 21:34:53,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:53,831 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:53,831 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] [2019-11-15 21:34:53,831 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:53,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:53,831 INFO L82 PathProgramCache]: Analyzing trace with hash 70402600, now seen corresponding path program 1 times [2019-11-15 21:34:53,831 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:53,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726755497] [2019-11-15 21:34:53,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:53,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:53,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:53,913 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-15 21:34:53,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726755497] [2019-11-15 21:34:53,914 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:53,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:34:53,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788462942] [2019-11-15 21:34:53,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:34:53,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:34:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:34:53,916 INFO L87 Difference]: Start difference. First operand 15762 states and 45144 transitions. Second operand 4 states. [2019-11-15 21:34:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:54,362 INFO L93 Difference]: Finished difference Result 20658 states and 59352 transitions. [2019-11-15 21:34:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:34:54,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 21:34:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:54,390 INFO L225 Difference]: With dead ends: 20658 [2019-11-15 21:34:54,391 INFO L226 Difference]: Without dead ends: 20382 [2019-11-15 21:34:54,391 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-15 21:34:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20382 states. [2019-11-15 21:34:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20382 to 18945. [2019-11-15 21:34:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18945 states. [2019-11-15 21:34:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18945 states to 18945 states and 54433 transitions. [2019-11-15 21:34:54,656 INFO L78 Accepts]: Start accepts. Automaton has 18945 states and 54433 transitions. Word has length 65 [2019-11-15 21:34:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:54,657 INFO L462 AbstractCegarLoop]: Abstraction has 18945 states and 54433 transitions. [2019-11-15 21:34:54,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:34:54,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18945 states and 54433 transitions. [2019-11-15 21:34:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:54,668 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:54,669 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] [2019-11-15 21:34:54,669 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1726548759, now seen corresponding path program 1 times [2019-11-15 21:34:54,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:54,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544755457] [2019-11-15 21:34:54,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:54,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:54,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:54,843 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-15 21:34:54,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544755457] [2019-11-15 21:34:54,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:54,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:34:54,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415346492] [2019-11-15 21:34:54,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:34:54,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:54,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:34:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:34:54,846 INFO L87 Difference]: Start difference. First operand 18945 states and 54433 transitions. Second operand 7 states. [2019-11-15 21:34:55,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:55,341 INFO L93 Difference]: Finished difference Result 17839 states and 48887 transitions. [2019-11-15 21:34:55,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:34:55,342 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-15 21:34:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:55,365 INFO L225 Difference]: With dead ends: 17839 [2019-11-15 21:34:55,365 INFO L226 Difference]: Without dead ends: 17839 [2019-11-15 21:34:55,366 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-15 21:34:55,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17839 states. [2019-11-15 21:34:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17839 to 12473. [2019-11-15 21:34:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12473 states. [2019-11-15 21:34:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12473 states to 12473 states and 34350 transitions. [2019-11-15 21:34:55,582 INFO L78 Accepts]: Start accepts. Automaton has 12473 states and 34350 transitions. Word has length 65 [2019-11-15 21:34:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:55,582 INFO L462 AbstractCegarLoop]: Abstraction has 12473 states and 34350 transitions. [2019-11-15 21:34:55,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:34:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 12473 states and 34350 transitions. [2019-11-15 21:34:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:34:55,590 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:55,590 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] [2019-11-15 21:34:55,591 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash -839045078, now seen corresponding path program 1 times [2019-11-15 21:34:55,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:55,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718811854] [2019-11-15 21:34:55,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:55,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:55,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:55,676 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-15 21:34:55,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718811854] [2019-11-15 21:34:55,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:55,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:34:55,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109988815] [2019-11-15 21:34:55,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:34:55,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:55,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:55,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:34:55,679 INFO L87 Difference]: Start difference. First operand 12473 states and 34350 transitions. Second operand 5 states. [2019-11-15 21:34:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:55,734 INFO L93 Difference]: Finished difference Result 4022 states and 9369 transitions. [2019-11-15 21:34:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:34:55,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-15 21:34:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:55,739 INFO L225 Difference]: With dead ends: 4022 [2019-11-15 21:34:55,739 INFO L226 Difference]: Without dead ends: 3349 [2019-11-15 21:34:55,740 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-15 21:34:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-15 21:34:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3089. [2019-11-15 21:34:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-15 21:34:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7075 transitions. [2019-11-15 21:34:55,787 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7075 transitions. Word has length 65 [2019-11-15 21:34:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:55,787 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7075 transitions. [2019-11-15 21:34:55,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:34:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7075 transitions. [2019-11-15 21:34:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:34:55,793 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:55,794 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] [2019-11-15 21:34:55,794 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1377720652, now seen corresponding path program 1 times [2019-11-15 21:34:55,795 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:55,795 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053459931] [2019-11-15 21:34:55,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:55,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:55,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:55,935 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-15 21:34:55,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053459931] [2019-11-15 21:34:55,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:55,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:34:55,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247730499] [2019-11-15 21:34:55,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:34:55,938 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:55,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:34:55,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:34:55,938 INFO L87 Difference]: Start difference. First operand 3089 states and 7075 transitions. Second operand 7 states. [2019-11-15 21:34:56,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:56,461 INFO L93 Difference]: Finished difference Result 3728 states and 8436 transitions. [2019-11-15 21:34:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 21:34:56,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 21:34:56,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:56,464 INFO L225 Difference]: With dead ends: 3728 [2019-11-15 21:34:56,464 INFO L226 Difference]: Without dead ends: 3697 [2019-11-15 21:34:56,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:34:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-15 21:34:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3243. [2019-11-15 21:34:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-11-15 21:34:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 7398 transitions. [2019-11-15 21:34:56,498 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 7398 transitions. Word has length 82 [2019-11-15 21:34:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:56,499 INFO L462 AbstractCegarLoop]: Abstraction has 3243 states and 7398 transitions. [2019-11-15 21:34:56,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:34:56,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 7398 transitions. [2019-11-15 21:34:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:34:56,502 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:56,502 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] [2019-11-15 21:34:56,502 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash 733569717, now seen corresponding path program 1 times [2019-11-15 21:34:56,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:56,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887803931] [2019-11-15 21:34:56,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:56,503 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:56,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:56,680 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-15 21:34:56,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887803931] [2019-11-15 21:34:56,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:56,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:34:56,680 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103309367] [2019-11-15 21:34:56,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:34:56,681 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:34:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:34:56,684 INFO L87 Difference]: Start difference. First operand 3243 states and 7398 transitions. Second operand 9 states. [2019-11-15 21:34:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:57,327 INFO L93 Difference]: Finished difference Result 11538 states and 26510 transitions. [2019-11-15 21:34:57,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 21:34:57,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-15 21:34:57,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:57,334 INFO L225 Difference]: With dead ends: 11538 [2019-11-15 21:34:57,335 INFO L226 Difference]: Without dead ends: 7339 [2019-11-15 21:34:57,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:34:57,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-11-15 21:34:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 3321. [2019-11-15 21:34:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-11-15 21:34:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7546 transitions. [2019-11-15 21:34:57,387 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7546 transitions. Word has length 82 [2019-11-15 21:34:57,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:57,387 INFO L462 AbstractCegarLoop]: Abstraction has 3321 states and 7546 transitions. [2019-11-15 21:34:57,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:34:57,387 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7546 transitions. [2019-11-15 21:34:57,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:34:57,390 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:57,391 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] [2019-11-15 21:34:57,391 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:57,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:57,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1812519390, now seen corresponding path program 2 times [2019-11-15 21:34:57,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:57,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889185911] [2019-11-15 21:34:57,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:57,536 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-15 21:34:57,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889185911] [2019-11-15 21:34:57,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:57,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:34:57,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394506302] [2019-11-15 21:34:57,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:34:57,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:57,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:34:57,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:34:57,538 INFO L87 Difference]: Start difference. First operand 3321 states and 7546 transitions. Second operand 6 states. [2019-11-15 21:34:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:57,747 INFO L93 Difference]: Finished difference Result 3701 states and 8348 transitions. [2019-11-15 21:34:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:34:57,748 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-15 21:34:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:57,751 INFO L225 Difference]: With dead ends: 3701 [2019-11-15 21:34:57,751 INFO L226 Difference]: Without dead ends: 3629 [2019-11-15 21:34:57,752 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-15 21:34:57,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-11-15 21:34:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3104. [2019-11-15 21:34:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-11-15 21:34:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7014 transitions. [2019-11-15 21:34:57,786 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7014 transitions. Word has length 82 [2019-11-15 21:34:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:57,786 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 7014 transitions. [2019-11-15 21:34:57,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:34:57,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7014 transitions. [2019-11-15 21:34:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:34:57,790 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:57,791 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] [2019-11-15 21:34:57,791 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:57,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1781499583, now seen corresponding path program 2 times [2019-11-15 21:34:57,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:57,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165895921] [2019-11-15 21:34:57,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:57,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:57,946 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-15 21:34:57,946 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165895921] [2019-11-15 21:34:57,946 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:57,946 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:34:57,946 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419405746] [2019-11-15 21:34:57,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:34:57,947 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:57,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:34:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:34:57,948 INFO L87 Difference]: Start difference. First operand 3104 states and 7014 transitions. Second operand 7 states. [2019-11-15 21:34:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:58,018 INFO L93 Difference]: Finished difference Result 5310 states and 12039 transitions. [2019-11-15 21:34:58,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:34:58,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-15 21:34:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:34:58,020 INFO L225 Difference]: With dead ends: 5310 [2019-11-15 21:34:58,020 INFO L226 Difference]: Without dead ends: 2294 [2019-11-15 21:34:58,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:34:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-15 21:34:58,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2019-11-15 21:34:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-11-15 21:34:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5172 transitions. [2019-11-15 21:34:58,042 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5172 transitions. Word has length 82 [2019-11-15 21:34:58,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:34:58,042 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 5172 transitions. [2019-11-15 21:34:58,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:34:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5172 transitions. [2019-11-15 21:34:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-15 21:34:58,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:34:58,045 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] [2019-11-15 21:34:58,045 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:34:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1233614151, now seen corresponding path program 3 times [2019-11-15 21:34:58,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:58,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999712979] [2019-11-15 21:34:58,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:58,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:58,128 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:58,129 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:34:58,303 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 21:34:58,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:34:58 BasicIcfg [2019-11-15 21:34:58,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:34:58,306 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:34:58,306 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:34:58,306 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:34:58,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:34:26" (3/4) ... [2019-11-15 21:34:58,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:34:58,470 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_976b91e7-44b3-4690-83c4-a13dd9f5adf2/bin/uautomizer/witness.graphml [2019-11-15 21:34:58,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:34:58,473 INFO L168 Benchmark]: Toolchain (without parser) took 33468.96 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -559.1 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,474 INFO L168 Benchmark]: CDTParser took 0.22 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-15 21:34:58,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,475 INFO L168 Benchmark]: Boogie Preprocessor took 45.55 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-15 21:34:58,475 INFO L168 Benchmark]: RCFGBuilder took 919.84 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,475 INFO L168 Benchmark]: TraceAbstraction took 31646.78 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -478.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,476 INFO L168 Benchmark]: Witness Printer took 164.77 ms. Allocated memory is still 3.2 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:58,478 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.22 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 635.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.55 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 919.84 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: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31646.78 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -478.2 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 164.77 ms. Allocated memory is still 3.2 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2569; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2569, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2570; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2570, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 193 locations, 3 error locations. Result: UNSAFE, OverallTime: 31.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6340 SDtfs, 7879 SDslu, 13944 SDs, 0 SdLazy, 5002 SolverSat, 390 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57887occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 63263 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1489 NumberOfCodeBlocks, 1489 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1384 ConstructedInterpolants, 0 QuantifiedInterpolants, 234843 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...