./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_power.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/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/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 64e1cfb6e69650a27a300f1fe0596bff871aade4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-10-22 09:01:21,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:21,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:21,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:21,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:21,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:21,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:21,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:21,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:21,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:21,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:21,207 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:21,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:21,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:21,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:21,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:21,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:21,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:21,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:21,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:21,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:21,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:21,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:21,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:21,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:21,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:21,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:21,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:21,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:21,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:21,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:21,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:21,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:21,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:21,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:21,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:21,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:21,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:21,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:21,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:21,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:21,226 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:21,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:21,237 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:21,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:21,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:21,238 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:21,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:21,238 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:21,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:21,239 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:21,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:21,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:21,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:21,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:21,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:21,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:21,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:21,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:21,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:21,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:21,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:21,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:21,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:21,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:21,242 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/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/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 -> 64e1cfb6e69650a27a300f1fe0596bff871aade4 [2019-10-22 09:01:21,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:21,275 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:21,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:21,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:21,279 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:21,279 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-10-22 09:01:21,326 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/data/efefac28e/c7c6435794644be59cdacffdda3e49b2/FLAGe360bc5d7 [2019-10-22 09:01:21,791 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:21,804 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/sv-benchmarks/c/pthread-wmm/mix054_power.oepc.i [2019-10-22 09:01:21,818 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/data/efefac28e/c7c6435794644be59cdacffdda3e49b2/FLAGe360bc5d7 [2019-10-22 09:01:22,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/data/efefac28e/c7c6435794644be59cdacffdda3e49b2 [2019-10-22 09:01:22,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:22,107 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:22,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:22,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:22,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:22,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d558fb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,126 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:22,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:22,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,572 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:22,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:22,684 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:22,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22 WrapperNode [2019-10-22 09:01:22,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:22,685 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:22,686 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:22,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:22,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:22,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:22,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... [2019-10-22 09:01:22,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:22,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:22,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:22,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:22,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/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-10-22 09:01:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:01:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 09:01:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:01:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:01:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 09:01:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 09:01:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 09:01:22,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 09:01:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 09:01:22,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:22,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:22,829 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 09:01:23,598 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:23,598 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:01:23,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23 BoogieIcfgContainer [2019-10-22 09:01:23,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:23,600 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:23,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:23,603 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:23,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:22" (1/3) ... [2019-10-22 09:01:23,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a59fcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:23, skipping insertion in model container [2019-10-22 09:01:23,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:22" (2/3) ... [2019-10-22 09:01:23,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a59fcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:23, skipping insertion in model container [2019-10-22 09:01:23,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23" (3/3) ... [2019-10-22 09:01:23,607 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_power.oepc.i [2019-10-22 09:01:23,640 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,641 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,641 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,641 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,641 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,641 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,642 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,643 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,644 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,645 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,646 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,647 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,648 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,649 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,650 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,651 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,652 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,653 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,654 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,655 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,656 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,657 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,658 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,659 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,660 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,661 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,662 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,663 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,664 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,665 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,666 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,667 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,668 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,669 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,670 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:01:23,675 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:01:23,675 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:23,684 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 09:01:23,693 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 09:01:23,708 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:23,708 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:23,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:23,709 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:23,709 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:23,709 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:23,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:23,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:23,719 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-10-22 09:01:26,425 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2019-10-22 09:01:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2019-10-22 09:01:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 09:01:26,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,434 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] [2019-10-22 09:01:26,436 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1417398579, now seen corresponding path program 1 times [2019-10-22 09:01:26,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004734242] [2019-10-22 09:01:26,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:26,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004734242] [2019-10-22 09:01:26,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:26,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141329800] [2019-10-22 09:01:26,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:26,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:26,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:26,682 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2019-10-22 09:01:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,442 INFO L93 Difference]: Finished difference Result 35833 states and 137562 transitions. [2019-10-22 09:01:27,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:27,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 09:01:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,650 INFO L225 Difference]: With dead ends: 35833 [2019-10-22 09:01:27,652 INFO L226 Difference]: Without dead ends: 27337 [2019-10-22 09:01:27,654 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-10-22 09:01:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-10-22 09:01:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 27337. [2019-10-22 09:01:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2019-10-22 09:01:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2019-10-22 09:01:28,833 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2019-10-22 09:01:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,835 INFO L462 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2019-10-22 09:01:28,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2019-10-22 09:01:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:01:28,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,848 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-10-22 09:01:28,848 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1163149579, now seen corresponding path program 1 times [2019-10-22 09:01:28,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104954416] [2019-10-22 09:01:28,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:29,000 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104954416] [2019-10-22 09:01:29,000 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:29,000 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691828268] [2019-10-22 09:01:29,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:29,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:29,002 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 5 states. [2019-10-22 09:01:29,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,921 INFO L93 Difference]: Finished difference Result 43807 states and 159850 transitions. [2019-10-22 09:01:29,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:29,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 09:01:29,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,108 INFO L225 Difference]: With dead ends: 43807 [2019-10-22 09:01:30,108 INFO L226 Difference]: Without dead ends: 43255 [2019-10-22 09:01:30,109 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-10-22 09:01:30,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43255 states. [2019-10-22 09:01:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43255 to 41419. [2019-10-22 09:01:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41419 states. [2019-10-22 09:01:31,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41419 states to 41419 states and 152328 transitions. [2019-10-22 09:01:31,552 INFO L78 Accepts]: Start accepts. Automaton has 41419 states and 152328 transitions. Word has length 44 [2019-10-22 09:01:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,554 INFO L462 AbstractCegarLoop]: Abstraction has 41419 states and 152328 transitions. [2019-10-22 09:01:31,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41419 states and 152328 transitions. [2019-10-22 09:01:31,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:01:31,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,560 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-10-22 09:01:31,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 605576156, now seen corresponding path program 1 times [2019-10-22 09:01:31,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348457042] [2019-10-22 09:01:31,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:31,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348457042] [2019-10-22 09:01:31,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:31,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091062600] [2019-10-22 09:01:31,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:31,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:31,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:31,648 INFO L87 Difference]: Start difference. First operand 41419 states and 152328 transitions. Second operand 5 states. [2019-10-22 09:01:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,535 INFO L93 Difference]: Finished difference Result 52769 states and 191023 transitions. [2019-10-22 09:01:32,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:32,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 09:01:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,712 INFO L225 Difference]: With dead ends: 52769 [2019-10-22 09:01:32,712 INFO L226 Difference]: Without dead ends: 52257 [2019-10-22 09:01:32,713 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-10-22 09:01:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52257 states. [2019-10-22 09:01:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52257 to 45373. [2019-10-22 09:01:33,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45373 states. [2019-10-22 09:01:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45373 states to 45373 states and 166016 transitions. [2019-10-22 09:01:33,837 INFO L78 Accepts]: Start accepts. Automaton has 45373 states and 166016 transitions. Word has length 45 [2019-10-22 09:01:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,837 INFO L462 AbstractCegarLoop]: Abstraction has 45373 states and 166016 transitions. [2019-10-22 09:01:33,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 45373 states and 166016 transitions. [2019-10-22 09:01:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:01:33,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,846 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-10-22 09:01:33,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1184682590, now seen corresponding path program 1 times [2019-10-22 09:01:33,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:33,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602712964] [2019-10-22 09:01:33,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:33,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,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-10-22 09:01:33,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602712964] [2019-10-22 09:01:33,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:33,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:33,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514676354] [2019-10-22 09:01:33,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:33,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:33,898 INFO L87 Difference]: Start difference. First operand 45373 states and 166016 transitions. Second operand 3 states. [2019-10-22 09:01:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,698 INFO L93 Difference]: Finished difference Result 65249 states and 235812 transitions. [2019-10-22 09:01:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:34,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 09:01:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,880 INFO L225 Difference]: With dead ends: 65249 [2019-10-22 09:01:34,880 INFO L226 Difference]: Without dead ends: 65249 [2019-10-22 09:01:34,881 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-10-22 09:01:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65249 states. [2019-10-22 09:01:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65249 to 50943. [2019-10-22 09:01:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50943 states. [2019-10-22 09:01:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50943 states to 50943 states and 184323 transitions. [2019-10-22 09:01:35,890 INFO L78 Accepts]: Start accepts. Automaton has 50943 states and 184323 transitions. Word has length 47 [2019-10-22 09:01:35,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:35,891 INFO L462 AbstractCegarLoop]: Abstraction has 50943 states and 184323 transitions. [2019-10-22 09:01:35,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 50943 states and 184323 transitions. [2019-10-22 09:01:35,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:35,903 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:35,903 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-10-22 09:01:35,903 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:35,904 INFO L82 PathProgramCache]: Analyzing trace with hash 388757837, now seen corresponding path program 1 times [2019-10-22 09:01:35,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:35,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543372327] [2019-10-22 09:01:35,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,904 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:35,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:35,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:36,515 WARN L191 SmtUtils]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-10-22 09:01:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:36,519 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543372327] [2019-10-22 09:01:36,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:36,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:36,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19235506] [2019-10-22 09:01:36,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:36,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:36,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:36,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:36,528 INFO L87 Difference]: Start difference. First operand 50943 states and 184323 transitions. Second operand 6 states. [2019-10-22 09:01:37,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:37,342 INFO L93 Difference]: Finished difference Result 67509 states and 242183 transitions. [2019-10-22 09:01:37,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:37,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:01:37,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:37,467 INFO L225 Difference]: With dead ends: 67509 [2019-10-22 09:01:37,467 INFO L226 Difference]: Without dead ends: 67509 [2019-10-22 09:01:37,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67509 states. [2019-10-22 09:01:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67509 to 63434. [2019-10-22 09:01:38,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63434 states. [2019-10-22 09:01:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63434 states to 63434 states and 227582 transitions. [2019-10-22 09:01:38,521 INFO L78 Accepts]: Start accepts. Automaton has 63434 states and 227582 transitions. Word has length 51 [2019-10-22 09:01:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:38,522 INFO L462 AbstractCegarLoop]: Abstraction has 63434 states and 227582 transitions. [2019-10-22 09:01:38,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 63434 states and 227582 transitions. [2019-10-22 09:01:38,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:38,536 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:38,536 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-10-22 09:01:38,537 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1408193522, now seen corresponding path program 1 times [2019-10-22 09:01:38,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:38,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857403021] [2019-10-22 09:01:38,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:38,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:38,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857403021] [2019-10-22 09:01:38,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:38,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:38,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327865368] [2019-10-22 09:01:38,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:38,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:38,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:38,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:38,610 INFO L87 Difference]: Start difference. First operand 63434 states and 227582 transitions. Second operand 4 states. [2019-10-22 09:01:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:38,677 INFO L93 Difference]: Finished difference Result 15373 states and 48824 transitions. [2019-10-22 09:01:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:38,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-10-22 09:01:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:38,694 INFO L225 Difference]: With dead ends: 15373 [2019-10-22 09:01:38,695 INFO L226 Difference]: Without dead ends: 13787 [2019-10-22 09:01:38,695 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-10-22 09:01:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13787 states. [2019-10-22 09:01:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13787 to 13738. [2019-10-22 09:01:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13738 states. [2019-10-22 09:01:39,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 43350 transitions. [2019-10-22 09:01:39,177 INFO L78 Accepts]: Start accepts. Automaton has 13738 states and 43350 transitions. Word has length 51 [2019-10-22 09:01:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,178 INFO L462 AbstractCegarLoop]: Abstraction has 13738 states and 43350 transitions. [2019-10-22 09:01:39,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 13738 states and 43350 transitions. [2019-10-22 09:01:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 09:01:39,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,179 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-10-22 09:01:39,180 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2094486829, now seen corresponding path program 1 times [2019-10-22 09:01:39,180 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444836437] [2019-10-22 09:01:39,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,181 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:39,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444836437] [2019-10-22 09:01:39,262 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:39,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:39,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50399334] [2019-10-22 09:01:39,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:39,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:39,264 INFO L87 Difference]: Start difference. First operand 13738 states and 43350 transitions. Second operand 6 states. [2019-10-22 09:01:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:39,633 INFO L93 Difference]: Finished difference Result 17066 states and 53146 transitions. [2019-10-22 09:01:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:39,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 09:01:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:39,663 INFO L225 Difference]: With dead ends: 17066 [2019-10-22 09:01:39,664 INFO L226 Difference]: Without dead ends: 16994 [2019-10-22 09:01:39,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:01:39,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16994 states. [2019-10-22 09:01:39,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16994 to 14312. [2019-10-22 09:01:39,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14312 states. [2019-10-22 09:01:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14312 states to 14312 states and 45047 transitions. [2019-10-22 09:01:39,850 INFO L78 Accepts]: Start accepts. Automaton has 14312 states and 45047 transitions. Word has length 51 [2019-10-22 09:01:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 14312 states and 45047 transitions. [2019-10-22 09:01:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14312 states and 45047 transitions. [2019-10-22 09:01:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:39,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:39,854 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] [2019-10-22 09:01:39,854 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1957998967, now seen corresponding path program 1 times [2019-10-22 09:01:39,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:39,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733439861] [2019-10-22 09:01:39,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:39,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:39,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733439861] [2019-10-22 09:01:39,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:39,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:39,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843653741] [2019-10-22 09:01:39,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:39,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:39,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:39,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:39,905 INFO L87 Difference]: Start difference. First operand 14312 states and 45047 transitions. Second operand 4 states. [2019-10-22 09:01:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,040 INFO L93 Difference]: Finished difference Result 16615 states and 52375 transitions. [2019-10-22 09:01:40,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:40,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 09:01:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,071 INFO L225 Difference]: With dead ends: 16615 [2019-10-22 09:01:40,071 INFO L226 Difference]: Without dead ends: 16615 [2019-10-22 09:01:40,071 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-10-22 09:01:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16615 states. [2019-10-22 09:01:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16615 to 15132. [2019-10-22 09:01:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15132 states. [2019-10-22 09:01:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15132 states to 15132 states and 47637 transitions. [2019-10-22 09:01:40,253 INFO L78 Accepts]: Start accepts. Automaton has 15132 states and 47637 transitions. Word has length 59 [2019-10-22 09:01:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,254 INFO L462 AbstractCegarLoop]: Abstraction has 15132 states and 47637 transitions. [2019-10-22 09:01:40,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 15132 states and 47637 transitions. [2019-10-22 09:01:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 09:01:40,258 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,258 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] [2019-10-22 09:01:40,258 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -215188632, now seen corresponding path program 1 times [2019-10-22 09:01:40,259 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,259 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684025112] [2019-10-22 09:01:40,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684025112] [2019-10-22 09:01:40,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:40,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433256092] [2019-10-22 09:01:40,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:40,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:40,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:40,325 INFO L87 Difference]: Start difference. First operand 15132 states and 47637 transitions. Second operand 6 states. [2019-10-22 09:01:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:40,688 INFO L93 Difference]: Finished difference Result 18450 states and 57254 transitions. [2019-10-22 09:01:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:40,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-22 09:01:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:40,712 INFO L225 Difference]: With dead ends: 18450 [2019-10-22 09:01:40,712 INFO L226 Difference]: Without dead ends: 18379 [2019-10-22 09:01:40,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18379 states. [2019-10-22 09:01:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18379 to 17410. [2019-10-22 09:01:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17410 states. [2019-10-22 09:01:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17410 states to 17410 states and 54311 transitions. [2019-10-22 09:01:40,922 INFO L78 Accepts]: Start accepts. Automaton has 17410 states and 54311 transitions. Word has length 59 [2019-10-22 09:01:40,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:40,922 INFO L462 AbstractCegarLoop]: Abstraction has 17410 states and 54311 transitions. [2019-10-22 09:01:40,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:40,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17410 states and 54311 transitions. [2019-10-22 09:01:40,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:01:40,927 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:40,927 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-10-22 09:01:40,927 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:40,927 INFO L82 PathProgramCache]: Analyzing trace with hash 424326332, now seen corresponding path program 1 times [2019-10-22 09:01:40,928 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:40,928 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272171950] [2019-10-22 09:01:40,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,928 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:40,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:40,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272171950] [2019-10-22 09:01:40,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:40,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:40,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719666056] [2019-10-22 09:01:40,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:40,972 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:40,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:40,973 INFO L87 Difference]: Start difference. First operand 17410 states and 54311 transitions. Second operand 4 states. [2019-10-22 09:01:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:41,314 INFO L93 Difference]: Finished difference Result 24408 states and 74495 transitions. [2019-10-22 09:01:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:41,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:01:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:41,347 INFO L225 Difference]: With dead ends: 24408 [2019-10-22 09:01:41,347 INFO L226 Difference]: Without dead ends: 24336 [2019-10-22 09:01:41,347 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-10-22 09:01:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24336 states. [2019-10-22 09:01:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24336 to 19176. [2019-10-22 09:01:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2019-10-22 09:01:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 59215 transitions. [2019-10-22 09:01:41,602 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 59215 transitions. Word has length 63 [2019-10-22 09:01:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:41,602 INFO L462 AbstractCegarLoop]: Abstraction has 19176 states and 59215 transitions. [2019-10-22 09:01:41,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 59215 transitions. [2019-10-22 09:01:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:01:41,608 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:41,608 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-10-22 09:01:41,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -820438149, now seen corresponding path program 1 times [2019-10-22 09:01:41,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:41,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075635929] [2019-10-22 09:01:41,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:41,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:41,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075635929] [2019-10-22 09:01:41,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:41,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:41,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004744463] [2019-10-22 09:01:41,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:41,654 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:41,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:41,654 INFO L87 Difference]: Start difference. First operand 19176 states and 59215 transitions. Second operand 4 states. [2019-10-22 09:01:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,017 INFO L93 Difference]: Finished difference Result 23415 states and 71445 transitions. [2019-10-22 09:01:42,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:42,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:01:42,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,062 INFO L225 Difference]: With dead ends: 23415 [2019-10-22 09:01:42,062 INFO L226 Difference]: Without dead ends: 23415 [2019-10-22 09:01:42,062 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-10-22 09:01:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23415 states. [2019-10-22 09:01:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23415 to 19450. [2019-10-22 09:01:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-10-22 09:01:42,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 59973 transitions. [2019-10-22 09:01:42,336 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 59973 transitions. Word has length 63 [2019-10-22 09:01:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,336 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 59973 transitions. [2019-10-22 09:01:42,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 59973 transitions. [2019-10-22 09:01:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:01:42,346 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,346 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-10-22 09:01:42,346 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1397319804, now seen corresponding path program 1 times [2019-10-22 09:01:42,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284453277] [2019-10-22 09:01:42,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:42,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:42,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284453277] [2019-10-22 09:01:42,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:42,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:42,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624115900] [2019-10-22 09:01:42,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:42,382 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:42,382 INFO L87 Difference]: Start difference. First operand 19450 states and 59973 transitions. Second operand 3 states. [2019-10-22 09:01:42,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:42,602 INFO L93 Difference]: Finished difference Result 19970 states and 61393 transitions. [2019-10-22 09:01:42,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:42,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 09:01:42,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:42,636 INFO L225 Difference]: With dead ends: 19970 [2019-10-22 09:01:42,636 INFO L226 Difference]: Without dead ends: 19970 [2019-10-22 09:01:42,637 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-10-22 09:01:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19970 states. [2019-10-22 09:01:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19970 to 19710. [2019-10-22 09:01:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19710 states. [2019-10-22 09:01:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19710 states to 19710 states and 60663 transitions. [2019-10-22 09:01:42,917 INFO L78 Accepts]: Start accepts. Automaton has 19710 states and 60663 transitions. Word has length 63 [2019-10-22 09:01:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:42,917 INFO L462 AbstractCegarLoop]: Abstraction has 19710 states and 60663 transitions. [2019-10-22 09:01:42,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 19710 states and 60663 transitions. [2019-10-22 09:01:42,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:42,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:42,925 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-10-22 09:01:42,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash 376411073, now seen corresponding path program 1 times [2019-10-22 09:01:42,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:42,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712369645] [2019-10-22 09:01:42,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:42,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:43,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712369645] [2019-10-22 09:01:43,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:01:43,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95852505] [2019-10-22 09:01:43,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:01:43,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:01:43,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:01:43,025 INFO L87 Difference]: Start difference. First operand 19710 states and 60663 transitions. Second operand 6 states. [2019-10-22 09:01:43,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,360 INFO L93 Difference]: Finished difference Result 21322 states and 64528 transitions. [2019-10-22 09:01:43,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:43,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 09:01:43,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:43,385 INFO L225 Difference]: With dead ends: 21322 [2019-10-22 09:01:43,385 INFO L226 Difference]: Without dead ends: 21322 [2019-10-22 09:01:43,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21322 states. [2019-10-22 09:01:43,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21322 to 19934. [2019-10-22 09:01:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19934 states. [2019-10-22 09:01:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19934 states to 19934 states and 60933 transitions. [2019-10-22 09:01:43,609 INFO L78 Accepts]: Start accepts. Automaton has 19934 states and 60933 transitions. Word has length 65 [2019-10-22 09:01:43,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:43,609 INFO L462 AbstractCegarLoop]: Abstraction has 19934 states and 60933 transitions. [2019-10-22 09:01:43,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:01:43,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19934 states and 60933 transitions. [2019-10-22 09:01:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:43,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:43,616 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:43,617 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:43,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 587761986, now seen corresponding path program 1 times [2019-10-22 09:01:43,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:43,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457997225] [2019-10-22 09:01:43,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:43,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:43,673 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457997225] [2019-10-22 09:01:43,673 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:43,673 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:43,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649348121] [2019-10-22 09:01:43,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:43,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:43,674 INFO L87 Difference]: Start difference. First operand 19934 states and 60933 transitions. Second operand 5 states. [2019-10-22 09:01:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:43,992 INFO L93 Difference]: Finished difference Result 25454 states and 77367 transitions. [2019-10-22 09:01:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:43,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,025 INFO L225 Difference]: With dead ends: 25454 [2019-10-22 09:01:44,025 INFO L226 Difference]: Without dead ends: 25454 [2019-10-22 09:01:44,025 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-10-22 09:01:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25454 states. [2019-10-22 09:01:44,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25454 to 23338. [2019-10-22 09:01:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23338 states. [2019-10-22 09:01:44,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23338 states to 23338 states and 70904 transitions. [2019-10-22 09:01:44,291 INFO L78 Accepts]: Start accepts. Automaton has 23338 states and 70904 transitions. Word has length 65 [2019-10-22 09:01:44,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:44,291 INFO L462 AbstractCegarLoop]: Abstraction has 23338 states and 70904 transitions. [2019-10-22 09:01:44,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 23338 states and 70904 transitions. [2019-10-22 09:01:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:44,299 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:44,299 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-10-22 09:01:44,299 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:44,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash 77227809, now seen corresponding path program 1 times [2019-10-22 09:01:44,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:44,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202279993] [2019-10-22 09:01:44,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:44,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:44,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:44,364 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202279993] [2019-10-22 09:01:44,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:44,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:44,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806404750] [2019-10-22 09:01:44,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:44,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:44,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:44,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:44,365 INFO L87 Difference]: Start difference. First operand 23338 states and 70904 transitions. Second operand 5 states. [2019-10-22 09:01:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:44,756 INFO L93 Difference]: Finished difference Result 34432 states and 103272 transitions. [2019-10-22 09:01:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:44,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:44,798 INFO L225 Difference]: With dead ends: 34432 [2019-10-22 09:01:44,798 INFO L226 Difference]: Without dead ends: 34432 [2019-10-22 09:01:44,799 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-10-22 09:01:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34432 states. [2019-10-22 09:01:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34432 to 27780. [2019-10-22 09:01:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27780 states. [2019-10-22 09:01:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27780 states to 27780 states and 83467 transitions. [2019-10-22 09:01:45,198 INFO L78 Accepts]: Start accepts. Automaton has 27780 states and 83467 transitions. Word has length 65 [2019-10-22 09:01:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:45,198 INFO L462 AbstractCegarLoop]: Abstraction has 27780 states and 83467 transitions. [2019-10-22 09:01:45,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27780 states and 83467 transitions. [2019-10-22 09:01:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:45,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:45,209 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-10-22 09:01:45,209 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1730226654, now seen corresponding path program 1 times [2019-10-22 09:01:45,209 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:45,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709664083] [2019-10-22 09:01:45,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:45,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:45,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:45,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709664083] [2019-10-22 09:01:45,266 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:45,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:45,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256454330] [2019-10-22 09:01:45,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:45,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:45,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:45,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:45,267 INFO L87 Difference]: Start difference. First operand 27780 states and 83467 transitions. Second operand 4 states. [2019-10-22 09:01:45,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:45,776 INFO L93 Difference]: Finished difference Result 36580 states and 110203 transitions. [2019-10-22 09:01:45,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:45,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 09:01:45,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:45,819 INFO L225 Difference]: With dead ends: 36580 [2019-10-22 09:01:45,819 INFO L226 Difference]: Without dead ends: 36388 [2019-10-22 09:01:45,819 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-10-22 09:01:45,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36388 states. [2019-10-22 09:01:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36388 to 33740. [2019-10-22 09:01:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33740 states. [2019-10-22 09:01:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33740 states to 33740 states and 101713 transitions. [2019-10-22 09:01:46,186 INFO L78 Accepts]: Start accepts. Automaton has 33740 states and 101713 transitions. Word has length 65 [2019-10-22 09:01:46,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,186 INFO L462 AbstractCegarLoop]: Abstraction has 33740 states and 101713 transitions. [2019-10-22 09:01:46,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 33740 states and 101713 transitions. [2019-10-22 09:01:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:46,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,195 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-10-22 09:01:46,195 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 767789283, now seen corresponding path program 1 times [2019-10-22 09:01:46,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837162610] [2019-10-22 09:01:46,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,268 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837162610] [2019-10-22 09:01:46,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:46,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974645556] [2019-10-22 09:01:46,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:46,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:46,269 INFO L87 Difference]: Start difference. First operand 33740 states and 101713 transitions. Second operand 5 states. [2019-10-22 09:01:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,320 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2019-10-22 09:01:46,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:01:46,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 09:01:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,328 INFO L225 Difference]: With dead ends: 8356 [2019-10-22 09:01:46,328 INFO L226 Difference]: Without dead ends: 6588 [2019-10-22 09:01:46,329 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-10-22 09:01:46,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2019-10-22 09:01:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2019-10-22 09:01:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-10-22 09:01:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2019-10-22 09:01:46,396 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2019-10-22 09:01:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,396 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2019-10-22 09:01:46,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2019-10-22 09:01:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:01:46,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,400 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-10-22 09:01:46,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash 3166969, now seen corresponding path program 1 times [2019-10-22 09:01:46,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274025940] [2019-10-22 09:01:46,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274025940] [2019-10-22 09:01:46,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:46,434 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704563557] [2019-10-22 09:01:46,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:46,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:46,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:46,434 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2019-10-22 09:01:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,466 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2019-10-22 09:01:46,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:46,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 09:01:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,473 INFO L225 Difference]: With dead ends: 7236 [2019-10-22 09:01:46,474 INFO L226 Difference]: Without dead ends: 7236 [2019-10-22 09:01:46,474 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-10-22 09:01:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2019-10-22 09:01:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2019-10-22 09:01:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-10-22 09:01:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2019-10-22 09:01:46,544 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2019-10-22 09:01:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,544 INFO L462 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2019-10-22 09:01:46,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:46,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2019-10-22 09:01:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 09:01:46,547 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,547 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] [2019-10-22 09:01:46,547 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1155493780, now seen corresponding path program 1 times [2019-10-22 09:01:46,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668553808] [2019-10-22 09:01:46,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668553808] [2019-10-22 09:01:46,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:46,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395490514] [2019-10-22 09:01:46,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:46,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:46,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:46,604 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2019-10-22 09:01:46,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:46,745 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2019-10-22 09:01:46,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:46,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-22 09:01:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:46,752 INFO L225 Difference]: With dead ends: 6127 [2019-10-22 09:01:46,752 INFO L226 Difference]: Without dead ends: 6127 [2019-10-22 09:01:46,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:46,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-10-22 09:01:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2019-10-22 09:01:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2019-10-22 09:01:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2019-10-22 09:01:46,819 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2019-10-22 09:01:46,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:46,820 INFO L462 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2019-10-22 09:01:46,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:46,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2019-10-22 09:01:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 09:01:46,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:46,825 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] [2019-10-22 09:01:46,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash 587316555, now seen corresponding path program 1 times [2019-10-22 09:01:46,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:46,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400955715] [2019-10-22 09:01:46,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:46,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:46,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400955715] [2019-10-22 09:01:46,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:46,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:46,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783537410] [2019-10-22 09:01:46,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:46,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:46,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:46,904 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 7 states. [2019-10-22 09:01:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,262 INFO L93 Difference]: Finished difference Result 6682 states and 15558 transitions. [2019-10-22 09:01:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:01:47,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-22 09:01:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,267 INFO L225 Difference]: With dead ends: 6682 [2019-10-22 09:01:47,267 INFO L226 Difference]: Without dead ends: 6627 [2019-10-22 09:01:47,268 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-22 09:01:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2019-10-22 09:01:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 5564. [2019-10-22 09:01:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2019-10-22 09:01:47,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2019-10-22 09:01:47,317 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2019-10-22 09:01:47,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,317 INFO L462 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2019-10-22 09:01:47,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2019-10-22 09:01:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 09:01:47,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,324 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,324 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1550184083, now seen corresponding path program 1 times [2019-10-22 09:01:47,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562617827] [2019-10-22 09:01:47,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562617827] [2019-10-22 09:01:47,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:47,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838667928] [2019-10-22 09:01:47,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:47,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:47,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:47,357 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2019-10-22 09:01:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,491 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2019-10-22 09:01:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:47,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-22 09:01:47,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,496 INFO L225 Difference]: With dead ends: 7293 [2019-10-22 09:01:47,496 INFO L226 Difference]: Without dead ends: 6965 [2019-10-22 09:01:47,496 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-10-22 09:01:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2019-10-22 09:01:47,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2019-10-22 09:01:47,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2019-10-22 09:01:47,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2019-10-22 09:01:47,553 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2019-10-22 09:01:47,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,553 INFO L462 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2019-10-22 09:01:47,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:47,553 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2019-10-22 09:01:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 09:01:47,557 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,558 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1791682793, now seen corresponding path program 2 times [2019-10-22 09:01:47,558 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,558 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249961377] [2019-10-22 09:01:47,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249961377] [2019-10-22 09:01:47,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:47,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144343594] [2019-10-22 09:01:47,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:47,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:47,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:47,616 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2019-10-22 09:01:47,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,690 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2019-10-22 09:01:47,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:47,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-22 09:01:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,695 INFO L225 Difference]: With dead ends: 6823 [2019-10-22 09:01:47,696 INFO L226 Difference]: Without dead ends: 6823 [2019-10-22 09:01:47,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2019-10-22 09:01:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2019-10-22 09:01:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2019-10-22 09:01:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2019-10-22 09:01:47,754 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2019-10-22 09:01:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:47,755 INFO L462 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2019-10-22 09:01:47,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2019-10-22 09:01:47,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:47,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:47,761 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:47,761 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1447316239, now seen corresponding path program 1 times [2019-10-22 09:01:47,761 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:47,761 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581505826] [2019-10-22 09:01:47,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,762 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:47,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:47,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581505826] [2019-10-22 09:01:47,826 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:47,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:47,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995966248] [2019-10-22 09:01:47,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:47,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:47,828 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2019-10-22 09:01:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:47,936 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2019-10-22 09:01:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:47,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 09:01:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:47,945 INFO L225 Difference]: With dead ends: 7324 [2019-10-22 09:01:47,945 INFO L226 Difference]: Without dead ends: 7324 [2019-10-22 09:01:47,945 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:47,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-10-22 09:01:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2019-10-22 09:01:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-10-22 09:01:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2019-10-22 09:01:48,028 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2019-10-22 09:01:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,028 INFO L462 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2019-10-22 09:01:48,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2019-10-22 09:01:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:48,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,036 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,036 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash -290830271, now seen corresponding path program 1 times [2019-10-22 09:01:48,037 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,037 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012843878] [2019-10-22 09:01:48,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012843878] [2019-10-22 09:01:48,090 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:48,090 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:48,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565586518] [2019-10-22 09:01:48,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:48,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:48,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:48,092 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2019-10-22 09:01:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,499 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2019-10-22 09:01:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:01:48,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 09:01:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:48,511 INFO L225 Difference]: With dead ends: 9776 [2019-10-22 09:01:48,511 INFO L226 Difference]: Without dead ends: 9760 [2019-10-22 09:01:48,511 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2019-10-22 09:01:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2019-10-22 09:01:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-10-22 09:01:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2019-10-22 09:01:48,609 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2019-10-22 09:01:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,610 INFO L462 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2019-10-22 09:01:48,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2019-10-22 09:01:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:48,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,617 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,617 INFO L82 PathProgramCache]: Analyzing trace with hash 953934210, now seen corresponding path program 1 times [2019-10-22 09:01:48,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444479453] [2019-10-22 09:01:48,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:48,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444479453] [2019-10-22 09:01:48,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:48,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:01:48,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988956485] [2019-10-22 09:01:48,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:48,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:48,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:48,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:48,669 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 5 states. [2019-10-22 09:01:48,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:48,842 INFO L93 Difference]: Finished difference Result 8563 states and 19548 transitions. [2019-10-22 09:01:48,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:01:48,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 09:01:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:48,849 INFO L225 Difference]: With dead ends: 8563 [2019-10-22 09:01:48,849 INFO L226 Difference]: Without dead ends: 8563 [2019-10-22 09:01:48,850 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8563 states. [2019-10-22 09:01:48,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8563 to 6604. [2019-10-22 09:01:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6604 states. [2019-10-22 09:01:48,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 15185 transitions. [2019-10-22 09:01:48,915 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 15185 transitions. Word has length 92 [2019-10-22 09:01:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:48,915 INFO L462 AbstractCegarLoop]: Abstraction has 6604 states and 15185 transitions. [2019-10-22 09:01:48,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 15185 transitions. [2019-10-22 09:01:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:48,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:48,921 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:48,921 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:48,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1122170160, now seen corresponding path program 1 times [2019-10-22 09:01:48,921 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:48,921 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843895502] [2019-10-22 09:01:48,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,922 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:48,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843895502] [2019-10-22 09:01:49,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:49,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:01:49,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009587647] [2019-10-22 09:01:49,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:01:49,039 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:01:49,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:01:49,040 INFO L87 Difference]: Start difference. First operand 6604 states and 15185 transitions. Second operand 8 states. [2019-10-22 09:01:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:49,348 INFO L93 Difference]: Finished difference Result 10327 states and 23397 transitions. [2019-10-22 09:01:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:01:49,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-22 09:01:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:49,356 INFO L225 Difference]: With dead ends: 10327 [2019-10-22 09:01:49,356 INFO L226 Difference]: Without dead ends: 10327 [2019-10-22 09:01:49,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:01:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10327 states. [2019-10-22 09:01:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10327 to 7449. [2019-10-22 09:01:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7449 states. [2019-10-22 09:01:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 17075 transitions. [2019-10-22 09:01:49,438 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 17075 transitions. Word has length 92 [2019-10-22 09:01:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:49,439 INFO L462 AbstractCegarLoop]: Abstraction has 7449 states and 17075 transitions. [2019-10-22 09:01:49,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:01:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 17075 transitions. [2019-10-22 09:01:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:49,448 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:49,448 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:49,448 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1843397585, now seen corresponding path program 1 times [2019-10-22 09:01:49,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:49,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117399027] [2019-10-22 09:01:49,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:49,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:49,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117399027] [2019-10-22 09:01:49,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:49,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 09:01:49,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585435011] [2019-10-22 09:01:49,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 09:01:49,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 09:01:49,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 09:01:49,566 INFO L87 Difference]: Start difference. First operand 7449 states and 17075 transitions. Second operand 9 states. [2019-10-22 09:01:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:49,973 INFO L93 Difference]: Finished difference Result 10727 states and 24485 transitions. [2019-10-22 09:01:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 09:01:49,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-22 09:01:49,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:49,981 INFO L225 Difference]: With dead ends: 10727 [2019-10-22 09:01:49,981 INFO L226 Difference]: Without dead ends: 10695 [2019-10-22 09:01:49,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-22 09:01:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10695 states. [2019-10-22 09:01:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10695 to 9294. [2019-10-22 09:01:50,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9294 states. [2019-10-22 09:01:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9294 states to 9294 states and 21180 transitions. [2019-10-22 09:01:50,106 INFO L78 Accepts]: Start accepts. Automaton has 9294 states and 21180 transitions. Word has length 92 [2019-10-22 09:01:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:50,107 INFO L462 AbstractCegarLoop]: Abstraction has 9294 states and 21180 transitions. [2019-10-22 09:01:50,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 09:01:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 9294 states and 21180 transitions. [2019-10-22 09:01:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 09:01:50,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:50,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:50,114 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:50,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,115 INFO L82 PathProgramCache]: Analyzing trace with hash 46446226, now seen corresponding path program 1 times [2019-10-22 09:01:50,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049464158] [2019-10-22 09:01:50,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:50,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049464158] [2019-10-22 09:01:50,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:50,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:50,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649885890] [2019-10-22 09:01:50,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:50,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:50,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:50,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:50,169 INFO L87 Difference]: Start difference. First operand 9294 states and 21180 transitions. Second operand 3 states. [2019-10-22 09:01:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:50,205 INFO L93 Difference]: Finished difference Result 9230 states and 20924 transitions. [2019-10-22 09:01:50,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:50,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 09:01:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:50,216 INFO L225 Difference]: With dead ends: 9230 [2019-10-22 09:01:50,216 INFO L226 Difference]: Without dead ends: 9198 [2019-10-22 09:01:50,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:50,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9198 states. [2019-10-22 09:01:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9198 to 7648. [2019-10-22 09:01:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7648 states. [2019-10-22 09:01:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7648 states to 7648 states and 17269 transitions. [2019-10-22 09:01:50,318 INFO L78 Accepts]: Start accepts. Automaton has 7648 states and 17269 transitions. Word has length 92 [2019-10-22 09:01:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:50,319 INFO L462 AbstractCegarLoop]: Abstraction has 7648 states and 17269 transitions. [2019-10-22 09:01:50,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7648 states and 17269 transitions. [2019-10-22 09:01:50,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 09:01:50,327 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:50,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:50,328 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:50,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,328 INFO L82 PathProgramCache]: Analyzing trace with hash -547703321, now seen corresponding path program 1 times [2019-10-22 09:01:50,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,328 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492671423] [2019-10-22 09:01:50,328 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,329 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:50,375 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492671423] [2019-10-22 09:01:50,375 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:50,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:50,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321656103] [2019-10-22 09:01:50,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:50,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:50,377 INFO L87 Difference]: Start difference. First operand 7648 states and 17269 transitions. Second operand 4 states. [2019-10-22 09:01:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:50,603 INFO L93 Difference]: Finished difference Result 8600 states and 19229 transitions. [2019-10-22 09:01:50,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:50,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-22 09:01:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:50,613 INFO L225 Difference]: With dead ends: 8600 [2019-10-22 09:01:50,613 INFO L226 Difference]: Without dead ends: 8484 [2019-10-22 09:01:50,614 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-10-22 09:01:50,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8484 states. [2019-10-22 09:01:50,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8484 to 7929. [2019-10-22 09:01:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7929 states. [2019-10-22 09:01:50,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7929 states to 7929 states and 17783 transitions. [2019-10-22 09:01:50,721 INFO L78 Accepts]: Start accepts. Automaton has 7929 states and 17783 transitions. Word has length 94 [2019-10-22 09:01:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:50,721 INFO L462 AbstractCegarLoop]: Abstraction has 7929 states and 17783 transitions. [2019-10-22 09:01:50,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7929 states and 17783 transitions. [2019-10-22 09:01:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 09:01:50,731 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:50,731 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:50,731 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1458703719, now seen corresponding path program 1 times [2019-10-22 09:01:50,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:50,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909564578] [2019-10-22 09:01:50,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:50,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:50,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-10-22 09:01:50,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909564578] [2019-10-22 09:01:50,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:50,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:01:50,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875746169] [2019-10-22 09:01:50,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:01:50,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:01:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:01:50,845 INFO L87 Difference]: Start difference. First operand 7929 states and 17783 transitions. Second operand 7 states. [2019-10-22 09:01:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:50,975 INFO L93 Difference]: Finished difference Result 9639 states and 21648 transitions. [2019-10-22 09:01:50,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:01:50,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-10-22 09:01:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:50,986 INFO L225 Difference]: With dead ends: 9639 [2019-10-22 09:01:50,986 INFO L226 Difference]: Without dead ends: 9639 [2019-10-22 09:01:50,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:50,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9639 states. [2019-10-22 09:01:51,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9639 to 7405. [2019-10-22 09:01:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7405 states. [2019-10-22 09:01:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 16510 transitions. [2019-10-22 09:01:51,093 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 16510 transitions. Word has length 94 [2019-10-22 09:01:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:51,093 INFO L462 AbstractCegarLoop]: Abstraction has 7405 states and 16510 transitions. [2019-10-22 09:01:51,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:01:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 16510 transitions. [2019-10-22 09:01:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 09:01:51,102 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:51,102 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:51,102 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:51,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1670054632, now seen corresponding path program 1 times [2019-10-22 09:01:51,103 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:51,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686190501] [2019-10-22 09:01:51,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:51,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686190501] [2019-10-22 09:01:51,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:51,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 09:01:51,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153814370] [2019-10-22 09:01:51,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:01:51,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:51,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:01:51,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:51,250 INFO L87 Difference]: Start difference. First operand 7405 states and 16510 transitions. Second operand 10 states. [2019-10-22 09:01:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:51,624 INFO L93 Difference]: Finished difference Result 23956 states and 54128 transitions. [2019-10-22 09:01:51,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 09:01:51,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-22 09:01:51,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:51,645 INFO L225 Difference]: With dead ends: 23956 [2019-10-22 09:01:51,645 INFO L226 Difference]: Without dead ends: 15983 [2019-10-22 09:01:51,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-22 09:01:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15983 states. [2019-10-22 09:01:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15983 to 7264. [2019-10-22 09:01:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7264 states. [2019-10-22 09:01:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 16119 transitions. [2019-10-22 09:01:51,785 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 16119 transitions. Word has length 94 [2019-10-22 09:01:51,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:51,785 INFO L462 AbstractCegarLoop]: Abstraction has 7264 states and 16119 transitions. [2019-10-22 09:01:51,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:01:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 16119 transitions. [2019-10-22 09:01:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 09:01:51,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:51,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:51,793 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1963815528, now seen corresponding path program 2 times [2019-10-22 09:01:51,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:51,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083941946] [2019-10-22 09:01:51,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,797 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:51,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:01:51,881 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:01:51,881 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:01:52,024 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:01:52,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:52 BasicIcfg [2019-10-22 09:01:52,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:52,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:52,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:52,026 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:52,026 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:23" (3/4) ... [2019-10-22 09:01:52,028 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:01:52,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_25c1ea3d-1ada-4dcc-a3a8-2daab4ef10dd/bin/uautomizer/witness.graphml [2019-10-22 09:01:52,145 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:52,146 INFO L168 Benchmark]: Toolchain (without parser) took 30039.49 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 939.1 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,146 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:52,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.76 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,147 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 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-10-22 09:01:52,147 INFO L168 Benchmark]: RCFGBuilder took 830.07 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,147 INFO L168 Benchmark]: TraceAbstraction took 28425.01 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,148 INFO L168 Benchmark]: Witness Printer took 119.44 ms. Allocated memory is still 3.9 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:52,149 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.76 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.88 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 830.07 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28425.01 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 119.44 ms. Allocated memory is still 3.9 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 pthread_t t1441; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK 0 pthread_create(&t1441, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1442; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1442, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 28.3s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8568 SDtfs, 8129 SDslu, 18327 SDs, 0 SdLazy, 6184 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 90 SyntacticMatches, 15 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63434occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 84828 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2268 NumberOfCodeBlocks, 2268 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2143 ConstructedInterpolants, 0 QuantifiedInterpolants, 369890 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...