./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.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_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/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 1eea28d6d3162d72f6609e8b294e8fcf6c5f2e5e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03:00,715 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:03:00,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:03:00,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:03:00,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:03:00,726 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:03:00,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:03:00,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:03:00,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:03:00,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:03:00,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:03:00,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:03:00,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:03:00,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:03:00,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:03:00,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:03:00,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:03:00,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:03:00,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:03:00,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:03:00,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:03:00,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:03:00,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:03:00,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:03:00,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:03:00,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:03:00,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:03:00,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:03:00,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:03:00,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:03:00,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:03:00,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:03:00,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:03:00,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:03:00,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:03:00,748 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:03:00,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:03:00,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:03:00,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:03:00,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:03:00,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:03:00,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:03:00,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:03:00,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:03:00,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:03:00,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:03:00,763 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:03:00,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:03:00,763 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:03:00,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:03:00,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:03:00,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:03:00,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:03:00,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:03:00,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:03:00,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:03:00,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:03:00,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:03:00,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:03:00,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:03:00,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:03:00,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:03:00,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:03:00,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:03:00,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:03:00,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:03:00,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:03:00,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:03:00,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:03:00,767 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:03:00,767 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_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/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 -> 1eea28d6d3162d72f6609e8b294e8fcf6c5f2e5e [2019-10-22 09:03:00,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:03:00,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:03:00,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:03:00,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:03:00,805 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:03:00,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-10-22 09:03:00,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/data/5fd23e592/013b64b6261342d48a24cf9de2f5a5df/FLAGe3d1ed9f6 [2019-10-22 09:03:01,313 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:03:01,314 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/sv-benchmarks/c/pthread-wmm/rfi003_pso.oepc.i [2019-10-22 09:03:01,326 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/data/5fd23e592/013b64b6261342d48a24cf9de2f5a5df/FLAGe3d1ed9f6 [2019-10-22 09:03:01,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/data/5fd23e592/013b64b6261342d48a24cf9de2f5a5df [2019-10-22 09:03:01,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:03:01,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:03:01,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:01,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:03:01,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:03:01,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c191d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:01, skipping insertion in model container [2019-10-22 09:03:01,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:03:01" (1/1) ... [2019-10-22 09:03:01,670 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:03:01,714 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:03:02,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:02,119 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:03:02,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:03:02,251 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:03:02,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02 WrapperNode [2019-10-22 09:03:02,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:03:02,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:02,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:03:02,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:03:02,260 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:03:02" (1/1) ... [2019-10-22 09:03:02,275 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:03:02" (1/1) ... [2019-10-22 09:03:02,297 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:03:02,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:03:02,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:03:02,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:03:02,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... [2019-10-22 09:03:02,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:03:02,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:03:02,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:03:02,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:03:02,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/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:03:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:03:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 09:03:02,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:03:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:03:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 09:03:02,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 09:03:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 09:03:02,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 09:03:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 09:03:02,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:03:02,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:03:02,378 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:03:02,859 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:03:02,859 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 09:03:02,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02 BoogieIcfgContainer [2019-10-22 09:03:02,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:03:02,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:03:02,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:03:02,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:03:02,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:03:01" (1/3) ... [2019-10-22 09:03:02,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d97059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:03:02, skipping insertion in model container [2019-10-22 09:03:02,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:03:02" (2/3) ... [2019-10-22 09:03:02,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16d97059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:03:02, skipping insertion in model container [2019-10-22 09:03:02,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02" (3/3) ... [2019-10-22 09:03:02,866 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_pso.oepc.i [2019-10-22 09:03:02,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,901 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,902 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,902 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,903 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,903 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,904 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,905 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,906 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,906 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,906 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,906 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,907 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,908 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,909 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,910 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,911 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,912 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,913 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,914 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,915 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,916 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,917 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,917 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,917 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,917 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,917 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,918 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,919 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,920 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,921 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,922 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,922 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,922 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,922 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,922 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,923 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 09:03:02,928 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 09:03:02,928 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:03:02,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 09:03:02,947 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 09:03:02,962 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:03:02,962 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:03:02,962 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:03:02,962 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:03:02,962 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:03:02,963 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:03:02,963 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:03:02,963 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:03:02,972 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 163 transitions [2019-10-22 09:03:04,917 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2019-10-22 09:03:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2019-10-22 09:03:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 09:03:04,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:04,926 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] [2019-10-22 09:03:04,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:04,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -361473251, now seen corresponding path program 1 times [2019-10-22 09:03:04,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:04,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790500694] [2019-10-22 09:03:04,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:04,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:05,141 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:03:05,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790500694] [2019-10-22 09:03:05,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:05,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:05,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980088797] [2019-10-22 09:03:05,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:05,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:05,162 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2019-10-22 09:03:05,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:05,735 INFO L93 Difference]: Finished difference Result 28523 states and 108880 transitions. [2019-10-22 09:03:05,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:05,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 09:03:05,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:06,131 INFO L225 Difference]: With dead ends: 28523 [2019-10-22 09:03:06,132 INFO L226 Difference]: Without dead ends: 21755 [2019-10-22 09:03:06,134 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:03:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21755 states. [2019-10-22 09:03:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21755 to 21755. [2019-10-22 09:03:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2019-10-22 09:03:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2019-10-22 09:03:06,999 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2019-10-22 09:03:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:06,999 INFO L462 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2019-10-22 09:03:06,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2019-10-22 09:03:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 09:03:07,004 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:07,005 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:07,005 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:07,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:07,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1780861984, now seen corresponding path program 1 times [2019-10-22 09:03:07,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:07,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283467307] [2019-10-22 09:03:07,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:07,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:07,117 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:03:07,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283467307] [2019-10-22 09:03:07,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:07,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:07,117 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81751133] [2019-10-22 09:03:07,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:07,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:07,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:07,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:07,119 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2019-10-22 09:03:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:08,076 INFO L93 Difference]: Finished difference Result 34169 states and 124040 transitions. [2019-10-22 09:03:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:08,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 09:03:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:08,202 INFO L225 Difference]: With dead ends: 34169 [2019-10-22 09:03:08,202 INFO L226 Difference]: Without dead ends: 33601 [2019-10-22 09:03:08,203 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:03:08,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states. [2019-10-22 09:03:09,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 31795. [2019-10-22 09:03:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-10-22 09:03:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2019-10-22 09:03:09,107 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2019-10-22 09:03:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:09,108 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2019-10-22 09:03:09,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2019-10-22 09:03:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 09:03:09,395 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:09,395 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:03:09,396 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1509414878, now seen corresponding path program 1 times [2019-10-22 09:03:09,397 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:09,397 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041013775] [2019-10-22 09:03:09,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,397 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:09,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:09,505 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:03:09,509 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041013775] [2019-10-22 09:03:09,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:09,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:09,510 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630382490] [2019-10-22 09:03:09,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:09,510 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:09,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:09,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:09,511 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2019-10-22 09:03:09,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:09,976 INFO L93 Difference]: Finished difference Result 41643 states and 149742 transitions. [2019-10-22 09:03:09,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:09,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 09:03:09,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:10,128 INFO L225 Difference]: With dead ends: 41643 [2019-10-22 09:03:10,128 INFO L226 Difference]: Without dead ends: 41179 [2019-10-22 09:03:10,128 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:03:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41179 states. [2019-10-22 09:03:10,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41179 to 35363. [2019-10-22 09:03:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2019-10-22 09:03:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2019-10-22 09:03:11,034 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2019-10-22 09:03:11,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:11,035 INFO L462 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2019-10-22 09:03:11,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2019-10-22 09:03:11,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 09:03:11,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:11,044 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] [2019-10-22 09:03:11,044 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:11,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:11,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1591090696, now seen corresponding path program 1 times [2019-10-22 09:03:11,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:11,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154835187] [2019-10-22 09:03:11,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:11,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:11,094 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:03:11,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154835187] [2019-10-22 09:03:11,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:11,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:11,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579185372] [2019-10-22 09:03:11,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:11,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:11,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:11,099 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2019-10-22 09:03:11,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:11,783 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2019-10-22 09:03:11,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:11,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 09:03:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:11,975 INFO L225 Difference]: With dead ends: 45909 [2019-10-22 09:03:11,975 INFO L226 Difference]: Without dead ends: 45909 [2019-10-22 09:03:11,975 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:03:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2019-10-22 09:03:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2019-10-22 09:03:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2019-10-22 09:03:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2019-10-22 09:03:12,798 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2019-10-22 09:03:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:12,799 INFO L462 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2019-10-22 09:03:12,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:12,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2019-10-22 09:03:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:03:12,811 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:12,811 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:12,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash -518299885, now seen corresponding path program 1 times [2019-10-22 09:03:12,811 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:12,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580989032] [2019-10-22 09:03:12,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:12,876 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:03:12,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580989032] [2019-10-22 09:03:12,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:12,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:12,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565278951] [2019-10-22 09:03:12,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:12,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:12,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:12,878 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2019-10-22 09:03:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:13,879 INFO L93 Difference]: Finished difference Result 52465 states and 185476 transitions. [2019-10-22 09:03:13,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 09:03:13,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 09:03:13,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:13,972 INFO L225 Difference]: With dead ends: 52465 [2019-10-22 09:03:13,973 INFO L226 Difference]: Without dead ends: 51929 [2019-10-22 09:03:13,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51929 states. [2019-10-22 09:03:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51929 to 40897. [2019-10-22 09:03:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2019-10-22 09:03:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2019-10-22 09:03:14,781 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2019-10-22 09:03:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:14,782 INFO L462 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2019-10-22 09:03:14,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2019-10-22 09:03:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:03:14,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:14,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:14,794 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:14,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:14,794 INFO L82 PathProgramCache]: Analyzing trace with hash -173831608, now seen corresponding path program 1 times [2019-10-22 09:03:14,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:14,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377072888] [2019-10-22 09:03:14,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:14,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:14,885 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:03:14,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377072888] [2019-10-22 09:03:14,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:14,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:14,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998532603] [2019-10-22 09:03:14,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:14,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:14,886 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2019-10-22 09:03:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:15,541 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2019-10-22 09:03:15,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:15,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 09:03:15,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:15,644 INFO L225 Difference]: With dead ends: 56598 [2019-10-22 09:03:15,644 INFO L226 Difference]: Without dead ends: 55459 [2019-10-22 09:03:15,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2019-10-22 09:03:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2019-10-22 09:03:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2019-10-22 09:03:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2019-10-22 09:03:17,199 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2019-10-22 09:03:17,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:17,200 INFO L462 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2019-10-22 09:03:17,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:17,200 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2019-10-22 09:03:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:03:17,213 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:17,214 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:17,214 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:17,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1970782967, now seen corresponding path program 1 times [2019-10-22 09:03:17,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:17,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539488361] [2019-10-22 09:03:17,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:17,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:17,311 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:03:17,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539488361] [2019-10-22 09:03:17,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:17,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:17,311 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576927464] [2019-10-22 09:03:17,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:17,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:17,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:17,313 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2019-10-22 09:03:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:18,222 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2019-10-22 09:03:18,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:03:18,222 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 09:03:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:18,362 INFO L225 Difference]: With dead ends: 75637 [2019-10-22 09:03:18,362 INFO L226 Difference]: Without dead ends: 75637 [2019-10-22 09:03:18,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:03:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2019-10-22 09:03:19,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2019-10-22 09:03:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2019-10-22 09:03:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2019-10-22 09:03:19,500 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2019-10-22 09:03:19,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:19,501 INFO L462 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2019-10-22 09:03:19,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:19,501 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2019-10-22 09:03:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 09:03:19,512 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:19,512 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:19,512 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:19,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1083279286, now seen corresponding path program 1 times [2019-10-22 09:03:19,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:19,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778697380] [2019-10-22 09:03:19,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:19,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:19,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:20,067 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:03:20,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778697380] [2019-10-22 09:03:20,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:20,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:20,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498453145] [2019-10-22 09:03:20,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:20,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:20,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:20,068 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2019-10-22 09:03:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:20,117 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2019-10-22 09:03:20,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:20,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 09:03:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:20,130 INFO L225 Difference]: With dead ends: 13777 [2019-10-22 09:03:20,131 INFO L226 Difference]: Without dead ends: 12160 [2019-10-22 09:03:20,131 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:03:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2019-10-22 09:03:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2019-10-22 09:03:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2019-10-22 09:03:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2019-10-22 09:03:20,252 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2019-10-22 09:03:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:20,252 INFO L462 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2019-10-22 09:03:20,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2019-10-22 09:03:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:20,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:20,257 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:03:20,257 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:20,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:20,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1572618351, now seen corresponding path program 1 times [2019-10-22 09:03:20,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:20,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932527279] [2019-10-22 09:03:20,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:20,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:20,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:20,307 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:03:20,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932527279] [2019-10-22 09:03:20,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:20,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:20,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060472303] [2019-10-22 09:03:20,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:20,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:20,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:20,309 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2019-10-22 09:03:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:20,461 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2019-10-22 09:03:20,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:20,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 09:03:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:20,481 INFO L225 Difference]: With dead ends: 14275 [2019-10-22 09:03:20,481 INFO L226 Difference]: Without dead ends: 14275 [2019-10-22 09:03:20,481 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:03:20,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2019-10-22 09:03:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2019-10-22 09:03:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2019-10-22 09:03:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2019-10-22 09:03:20,654 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2019-10-22 09:03:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:20,655 INFO L462 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2019-10-22 09:03:20,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:20,655 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2019-10-22 09:03:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 09:03:20,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:20,661 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:03:20,661 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:20,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash 170191984, now seen corresponding path program 1 times [2019-10-22 09:03:20,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:20,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009086639] [2019-10-22 09:03:20,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:20,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:20,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:20,731 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:03:20,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009086639] [2019-10-22 09:03:20,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:20,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:20,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16151048] [2019-10-22 09:03:20,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:20,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:20,733 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2019-10-22 09:03:21,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:21,122 INFO L93 Difference]: Finished difference Result 16769 states and 51611 transitions. [2019-10-22 09:03:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 09:03:21,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-22 09:03:21,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:21,144 INFO L225 Difference]: With dead ends: 16769 [2019-10-22 09:03:21,144 INFO L226 Difference]: Without dead ends: 16705 [2019-10-22 09:03:21,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2019-10-22 09:03:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 13812. [2019-10-22 09:03:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2019-10-22 09:03:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2019-10-22 09:03:21,340 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2019-10-22 09:03:21,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:21,340 INFO L462 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2019-10-22 09:03:21,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2019-10-22 09:03:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:21,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:21,347 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:03:21,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:21,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -830371060, now seen corresponding path program 1 times [2019-10-22 09:03:21,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:21,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545883026] [2019-10-22 09:03:21,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:21,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:21,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:21,422 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:03:21,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545883026] [2019-10-22 09:03:21,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:21,422 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:21,422 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882307096] [2019-10-22 09:03:21,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:21,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:21,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:21,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:21,423 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2019-10-22 09:03:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:21,634 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2019-10-22 09:03:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:21,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 09:03:21,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:21,657 INFO L225 Difference]: With dead ends: 17359 [2019-10-22 09:03:21,657 INFO L226 Difference]: Without dead ends: 17359 [2019-10-22 09:03:21,658 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:03:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2019-10-22 09:03:21,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2019-10-22 09:03:21,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2019-10-22 09:03:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2019-10-22 09:03:21,858 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2019-10-22 09:03:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:21,859 INFO L462 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2019-10-22 09:03:21,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2019-10-22 09:03:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 09:03:21,866 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:21,866 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:03:21,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:21,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:21,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1387386893, now seen corresponding path program 1 times [2019-10-22 09:03:21,867 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:21,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822822196] [2019-10-22 09:03:21,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:21,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:21,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:21,910 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:03:21,911 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822822196] [2019-10-22 09:03:21,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:21,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:03:21,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836353211] [2019-10-22 09:03:21,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:03:21,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:21,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:03:21,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:03:21,912 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2019-10-22 09:03:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:22,054 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2019-10-22 09:03:22,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:03:22,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 09:03:22,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:22,080 INFO L225 Difference]: With dead ends: 16413 [2019-10-22 09:03:22,080 INFO L226 Difference]: Without dead ends: 16413 [2019-10-22 09:03:22,080 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:03:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2019-10-22 09:03:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2019-10-22 09:03:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-10-22 09:03:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2019-10-22 09:03:22,253 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2019-10-22 09:03:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:22,253 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2019-10-22 09:03:22,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:03:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2019-10-22 09:03:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:22,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:22,262 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] [2019-10-22 09:03:22,262 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1580877020, now seen corresponding path program 1 times [2019-10-22 09:03:22,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:22,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253792649] [2019-10-22 09:03:22,262 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:22,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:22,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:22,345 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:03:22,345 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253792649] [2019-10-22 09:03:22,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:22,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:22,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720516387] [2019-10-22 09:03:22,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:22,346 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:22,346 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2019-10-22 09:03:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:22,762 INFO L93 Difference]: Finished difference Result 17577 states and 53335 transitions. [2019-10-22 09:03:22,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:22,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 09:03:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:22,785 INFO L225 Difference]: With dead ends: 17577 [2019-10-22 09:03:22,785 INFO L226 Difference]: Without dead ends: 17577 [2019-10-22 09:03:22,786 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-10-22 09:03:22,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 17008. [2019-10-22 09:03:22,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17008 states. [2019-10-22 09:03:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17008 states to 17008 states and 51782 transitions. [2019-10-22 09:03:22,997 INFO L78 Accepts]: Start accepts. Automaton has 17008 states and 51782 transitions. Word has length 67 [2019-10-22 09:03:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:22,997 INFO L462 AbstractCegarLoop]: Abstraction has 17008 states and 51782 transitions. [2019-10-22 09:03:22,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17008 states and 51782 transitions. [2019-10-22 09:03:23,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:23,009 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:23,009 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] [2019-10-22 09:03:23,009 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:23,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:23,010 INFO L82 PathProgramCache]: Analyzing trace with hash -496332323, now seen corresponding path program 1 times [2019-10-22 09:03:23,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:23,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633397535] [2019-10-22 09:03:23,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:23,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:23,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:23,123 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:03:23,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633397535] [2019-10-22 09:03:23,123 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:23,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:23,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082542178] [2019-10-22 09:03:23,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:23,124 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:23,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:23,125 INFO L87 Difference]: Start difference. First operand 17008 states and 51782 transitions. Second operand 6 states. [2019-10-22 09:03:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:23,416 INFO L93 Difference]: Finished difference Result 19873 states and 58892 transitions. [2019-10-22 09:03:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:03:23,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 09:03:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:23,441 INFO L225 Difference]: With dead ends: 19873 [2019-10-22 09:03:23,441 INFO L226 Difference]: Without dead ends: 19873 [2019-10-22 09:03:23,442 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:03:23,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19873 states. [2019-10-22 09:03:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19873 to 17684. [2019-10-22 09:03:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2019-10-22 09:03:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 52848 transitions. [2019-10-22 09:03:23,669 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 52848 transitions. Word has length 67 [2019-10-22 09:03:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:23,669 INFO L462 AbstractCegarLoop]: Abstraction has 17684 states and 52848 transitions. [2019-10-22 09:03:23,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 52848 transitions. [2019-10-22 09:03:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:23,680 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:23,680 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] [2019-10-22 09:03:23,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash -284981410, now seen corresponding path program 1 times [2019-10-22 09:03:23,681 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:23,681 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096431084] [2019-10-22 09:03:23,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:23,681 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:23,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:23,755 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:03:23,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096431084] [2019-10-22 09:03:23,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:23,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:23,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119827546] [2019-10-22 09:03:23,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:23,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:23,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:23,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:23,757 INFO L87 Difference]: Start difference. First operand 17684 states and 52848 transitions. Second operand 5 states. [2019-10-22 09:03:24,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:24,016 INFO L93 Difference]: Finished difference Result 22458 states and 66796 transitions. [2019-10-22 09:03:24,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:24,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 09:03:24,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:24,050 INFO L225 Difference]: With dead ends: 22458 [2019-10-22 09:03:24,050 INFO L226 Difference]: Without dead ends: 22458 [2019-10-22 09:03:24,050 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:03:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2019-10-22 09:03:24,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 18978. [2019-10-22 09:03:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18978 states. [2019-10-22 09:03:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18978 states to 18978 states and 56244 transitions. [2019-10-22 09:03:24,615 INFO L78 Accepts]: Start accepts. Automaton has 18978 states and 56244 transitions. Word has length 67 [2019-10-22 09:03:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:24,615 INFO L462 AbstractCegarLoop]: Abstraction has 18978 states and 56244 transitions. [2019-10-22 09:03:24,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 18978 states and 56244 transitions. [2019-10-22 09:03:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:24,624 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:24,624 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] [2019-10-22 09:03:24,624 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:24,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -795515587, now seen corresponding path program 1 times [2019-10-22 09:03:24,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:24,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810286492] [2019-10-22 09:03:24,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:24,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:24,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:24,694 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:03:24,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810286492] [2019-10-22 09:03:24,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:24,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:24,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985436959] [2019-10-22 09:03:24,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:24,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:24,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:24,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:24,695 INFO L87 Difference]: Start difference. First operand 18978 states and 56244 transitions. Second operand 5 states. [2019-10-22 09:03:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:24,992 INFO L93 Difference]: Finished difference Result 25572 states and 75564 transitions. [2019-10-22 09:03:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:24,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 09:03:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:25,023 INFO L225 Difference]: With dead ends: 25572 [2019-10-22 09:03:25,023 INFO L226 Difference]: Without dead ends: 25572 [2019-10-22 09:03:25,023 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:03:25,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25572 states. [2019-10-22 09:03:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25572 to 20144. [2019-10-22 09:03:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20144 states. [2019-10-22 09:03:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 59688 transitions. [2019-10-22 09:03:25,259 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 59688 transitions. Word has length 67 [2019-10-22 09:03:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:25,259 INFO L462 AbstractCegarLoop]: Abstraction has 20144 states and 59688 transitions. [2019-10-22 09:03:25,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 59688 transitions. [2019-10-22 09:03:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:25,267 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:25,267 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] [2019-10-22 09:03:25,268 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1691997246, now seen corresponding path program 1 times [2019-10-22 09:03:25,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:25,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119169216] [2019-10-22 09:03:25,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:25,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:25,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:25,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:03:25,324 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119169216] [2019-10-22 09:03:25,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:25,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:03:25,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543345432] [2019-10-22 09:03:25,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:03:25,324 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:03:25,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:03:25,325 INFO L87 Difference]: Start difference. First operand 20144 states and 59688 transitions. Second operand 4 states. [2019-10-22 09:03:25,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:25,691 INFO L93 Difference]: Finished difference Result 26772 states and 79459 transitions. [2019-10-22 09:03:25,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:25,691 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-10-22 09:03:25,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:25,721 INFO L225 Difference]: With dead ends: 26772 [2019-10-22 09:03:25,721 INFO L226 Difference]: Without dead ends: 26392 [2019-10-22 09:03:25,721 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:03:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26392 states. [2019-10-22 09:03:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26392 to 24448. [2019-10-22 09:03:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24448 states. [2019-10-22 09:03:25,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24448 states to 24448 states and 72600 transitions. [2019-10-22 09:03:25,987 INFO L78 Accepts]: Start accepts. Automaton has 24448 states and 72600 transitions. Word has length 67 [2019-10-22 09:03:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:25,987 INFO L462 AbstractCegarLoop]: Abstraction has 24448 states and 72600 transitions. [2019-10-22 09:03:25,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:03:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24448 states and 72600 transitions. [2019-10-22 09:03:26,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 09:03:26,000 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:26,000 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] [2019-10-22 09:03:26,001 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:26,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:26,001 INFO L82 PathProgramCache]: Analyzing trace with hash -104954113, now seen corresponding path program 1 times [2019-10-22 09:03:26,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:26,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651641184] [2019-10-22 09:03:26,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:26,075 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:03:26,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651641184] [2019-10-22 09:03:26,076 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:26,076 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:26,076 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978654197] [2019-10-22 09:03:26,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:26,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:26,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:26,076 INFO L87 Difference]: Start difference. First operand 24448 states and 72600 transitions. Second operand 5 states. [2019-10-22 09:03:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:26,109 INFO L93 Difference]: Finished difference Result 6904 states and 16562 transitions. [2019-10-22 09:03:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:26,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 09:03:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:26,113 INFO L225 Difference]: With dead ends: 6904 [2019-10-22 09:03:26,113 INFO L226 Difference]: Without dead ends: 5460 [2019-10-22 09:03:26,114 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:03:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2019-10-22 09:03:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 4790. [2019-10-22 09:03:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-10-22 09:03:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 11258 transitions. [2019-10-22 09:03:26,149 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 11258 transitions. Word has length 67 [2019-10-22 09:03:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:26,150 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 11258 transitions. [2019-10-22 09:03:26,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 11258 transitions. [2019-10-22 09:03:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:26,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:26,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:26,153 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash 835678018, now seen corresponding path program 1 times [2019-10-22 09:03:26,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:26,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988198233] [2019-10-22 09:03:26,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:26,212 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:03:26,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988198233] [2019-10-22 09:03:26,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:26,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:03:26,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603510898] [2019-10-22 09:03:26,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:03:26,213 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:03:26,214 INFO L87 Difference]: Start difference. First operand 4790 states and 11258 transitions. Second operand 5 states. [2019-10-22 09:03:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:26,358 INFO L93 Difference]: Finished difference Result 5631 states and 13084 transitions. [2019-10-22 09:03:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:26,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-22 09:03:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:26,362 INFO L225 Difference]: With dead ends: 5631 [2019-10-22 09:03:26,363 INFO L226 Difference]: Without dead ends: 5597 [2019-10-22 09:03:26,363 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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:03:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-10-22 09:03:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4943. [2019-10-22 09:03:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4943 states. [2019-10-22 09:03:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 11559 transitions. [2019-10-22 09:03:26,401 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 11559 transitions. Word has length 82 [2019-10-22 09:03:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:26,401 INFO L462 AbstractCegarLoop]: Abstraction has 4943 states and 11559 transitions. [2019-10-22 09:03:26,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:03:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 11559 transitions. [2019-10-22 09:03:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:26,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:26,406 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:26,406 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:26,407 INFO L82 PathProgramCache]: Analyzing trace with hash 442023446, now seen corresponding path program 2 times [2019-10-22 09:03:26,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:26,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999594784] [2019-10-22 09:03:26,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:26,468 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:03:26,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999594784] [2019-10-22 09:03:26,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:26,469 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:26,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105467562] [2019-10-22 09:03:26,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:26,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:26,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:26,469 INFO L87 Difference]: Start difference. First operand 4943 states and 11559 transitions. Second operand 6 states. [2019-10-22 09:03:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:26,722 INFO L93 Difference]: Finished difference Result 4831 states and 11334 transitions. [2019-10-22 09:03:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:03:26,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:26,725 INFO L225 Difference]: With dead ends: 4831 [2019-10-22 09:03:26,725 INFO L226 Difference]: Without dead ends: 4831 [2019-10-22 09:03:26,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2019-10-22 09:03:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4184. [2019-10-22 09:03:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4184 states. [2019-10-22 09:03:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4184 states to 4184 states and 9750 transitions. [2019-10-22 09:03:26,756 INFO L78 Accepts]: Start accepts. Automaton has 4184 states and 9750 transitions. Word has length 82 [2019-10-22 09:03:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:26,756 INFO L462 AbstractCegarLoop]: Abstraction has 4184 states and 9750 transitions. [2019-10-22 09:03:26,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 4184 states and 9750 transitions. [2019-10-22 09:03:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:26,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:26,759 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:26,759 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:26,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:26,759 INFO L82 PathProgramCache]: Analyzing trace with hash 919737465, now seen corresponding path program 1 times [2019-10-22 09:03:26,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:26,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071807037] [2019-10-22 09:03:26,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:26,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:26,847 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:03:26,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071807037] [2019-10-22 09:03:26,847 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:26,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:26,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363130840] [2019-10-22 09:03:26,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:26,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:26,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:26,849 INFO L87 Difference]: Start difference. First operand 4184 states and 9750 transitions. Second operand 6 states. [2019-10-22 09:03:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:27,094 INFO L93 Difference]: Finished difference Result 5614 states and 13146 transitions. [2019-10-22 09:03:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:27,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:27,100 INFO L225 Difference]: With dead ends: 5614 [2019-10-22 09:03:27,100 INFO L226 Difference]: Without dead ends: 5582 [2019-10-22 09:03:27,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:03:27,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5582 states. [2019-10-22 09:03:27,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5582 to 4541. [2019-10-22 09:03:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4541 states. [2019-10-22 09:03:27,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4541 states to 4541 states and 10624 transitions. [2019-10-22 09:03:27,156 INFO L78 Accepts]: Start accepts. Automaton has 4541 states and 10624 transitions. Word has length 82 [2019-10-22 09:03:27,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:27,156 INFO L462 AbstractCegarLoop]: Abstraction has 4541 states and 10624 transitions. [2019-10-22 09:03:27,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:27,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4541 states and 10624 transitions. [2019-10-22 09:03:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:27,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:27,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:27,162 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:27,162 INFO L82 PathProgramCache]: Analyzing trace with hash -877213894, now seen corresponding path program 1 times [2019-10-22 09:03:27,162 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:27,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928394213] [2019-10-22 09:03:27,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:27,238 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:03:27,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928394213] [2019-10-22 09:03:27,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:27,239 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:27,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814488742] [2019-10-22 09:03:27,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:27,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:27,240 INFO L87 Difference]: Start difference. First operand 4541 states and 10624 transitions. Second operand 7 states. [2019-10-22 09:03:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:27,544 INFO L93 Difference]: Finished difference Result 6603 states and 15907 transitions. [2019-10-22 09:03:27,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 09:03:27,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 09:03:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:27,551 INFO L225 Difference]: With dead ends: 6603 [2019-10-22 09:03:27,551 INFO L226 Difference]: Without dead ends: 6603 [2019-10-22 09:03:27,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-22 09:03:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6603 states. [2019-10-22 09:03:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6603 to 5282. [2019-10-22 09:03:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5282 states. [2019-10-22 09:03:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 12508 transitions. [2019-10-22 09:03:27,621 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 12508 transitions. Word has length 82 [2019-10-22 09:03:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:27,621 INFO L462 AbstractCegarLoop]: Abstraction has 5282 states and 12508 transitions. [2019-10-22 09:03:27,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 12508 transitions. [2019-10-22 09:03:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:27,626 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:27,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:27,626 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 10289787, now seen corresponding path program 1 times [2019-10-22 09:03:27,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:27,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072747569] [2019-10-22 09:03:27,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:27,727 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:03:27,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072747569] [2019-10-22 09:03:27,727 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:27,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:27,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234810107] [2019-10-22 09:03:27,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:27,730 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:27,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:27,731 INFO L87 Difference]: Start difference. First operand 5282 states and 12508 transitions. Second operand 6 states. [2019-10-22 09:03:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:27,780 INFO L93 Difference]: Finished difference Result 5784 states and 13772 transitions. [2019-10-22 09:03:27,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:27,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:27,786 INFO L225 Difference]: With dead ends: 5784 [2019-10-22 09:03:27,787 INFO L226 Difference]: Without dead ends: 5784 [2019-10-22 09:03:27,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2019-10-22 09:03:27,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 4621. [2019-10-22 09:03:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4621 states. [2019-10-22 09:03:27,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 10824 transitions. [2019-10-22 09:03:27,843 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 10824 transitions. Word has length 82 [2019-10-22 09:03:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:27,844 INFO L462 AbstractCegarLoop]: Abstraction has 4621 states and 10824 transitions. [2019-10-22 09:03:27,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 10824 transitions. [2019-10-22 09:03:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 09:03:27,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:27,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:27,849 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:27,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1721685765, now seen corresponding path program 1 times [2019-10-22 09:03:27,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:27,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45031743] [2019-10-22 09:03:27,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:27,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:27,947 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:03:27,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45031743] [2019-10-22 09:03:27,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:27,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:27,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759263641] [2019-10-22 09:03:27,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:27,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:27,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:27,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:27,949 INFO L87 Difference]: Start difference. First operand 4621 states and 10824 transitions. Second operand 6 states. [2019-10-22 09:03:28,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:28,068 INFO L93 Difference]: Finished difference Result 4237 states and 9656 transitions. [2019-10-22 09:03:28,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:28,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 09:03:28,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:28,073 INFO L225 Difference]: With dead ends: 4237 [2019-10-22 09:03:28,073 INFO L226 Difference]: Without dead ends: 4237 [2019-10-22 09:03:28,074 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4237 states. [2019-10-22 09:03:28,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4237 to 2468. [2019-10-22 09:03:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-10-22 09:03:28,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 5627 transitions. [2019-10-22 09:03:28,109 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 5627 transitions. Word has length 82 [2019-10-22 09:03:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:28,109 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 5627 transitions. [2019-10-22 09:03:28,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 5627 transitions. [2019-10-22 09:03:28,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:28,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:28,111 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] [2019-10-22 09:03:28,112 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash -974894291, now seen corresponding path program 1 times [2019-10-22 09:03:28,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:28,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945495183] [2019-10-22 09:03:28,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:28,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:28,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:28,203 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:03:28,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945495183] [2019-10-22 09:03:28,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:28,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:28,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931430796] [2019-10-22 09:03:28,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:28,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:28,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:28,204 INFO L87 Difference]: Start difference. First operand 2468 states and 5627 transitions. Second operand 7 states. [2019-10-22 09:03:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:28,635 INFO L93 Difference]: Finished difference Result 3075 states and 6946 transitions. [2019-10-22 09:03:28,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 09:03:28,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 09:03:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:28,639 INFO L225 Difference]: With dead ends: 3075 [2019-10-22 09:03:28,639 INFO L226 Difference]: Without dead ends: 3041 [2019-10-22 09:03:28,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 09:03:28,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-10-22 09:03:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2586. [2019-10-22 09:03:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-10-22 09:03:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 5862 transitions. [2019-10-22 09:03:28,670 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 5862 transitions. Word has length 84 [2019-10-22 09:03:28,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:28,670 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 5862 transitions. [2019-10-22 09:03:28,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 5862 transitions. [2019-10-22 09:03:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:28,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:28,673 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] [2019-10-22 09:03:28,673 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:28,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:28,673 INFO L82 PathProgramCache]: Analyzing trace with hash -624094354, now seen corresponding path program 1 times [2019-10-22 09:03:28,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:28,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595989442] [2019-10-22 09:03:28,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:28,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:28,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:28,785 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:03:28,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595989442] [2019-10-22 09:03:28,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:28,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:28,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409031953] [2019-10-22 09:03:28,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:28,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:28,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:28,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:28,786 INFO L87 Difference]: Start difference. First operand 2586 states and 5862 transitions. Second operand 7 states. [2019-10-22 09:03:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:29,007 INFO L93 Difference]: Finished difference Result 3045 states and 6923 transitions. [2019-10-22 09:03:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:03:29,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 09:03:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:29,011 INFO L225 Difference]: With dead ends: 3045 [2019-10-22 09:03:29,011 INFO L226 Difference]: Without dead ends: 3045 [2019-10-22 09:03:29,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:03:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2019-10-22 09:03:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3029. [2019-10-22 09:03:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3029 states. [2019-10-22 09:03:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 6883 transitions. [2019-10-22 09:03:29,045 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 6883 transitions. Word has length 84 [2019-10-22 09:03:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:29,045 INFO L462 AbstractCegarLoop]: Abstraction has 3029 states and 6883 transitions. [2019-10-22 09:03:29,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 6883 transitions. [2019-10-22 09:03:29,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:29,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:29,048 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] [2019-10-22 09:03:29,049 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:29,049 INFO L82 PathProgramCache]: Analyzing trace with hash 263409327, now seen corresponding path program 1 times [2019-10-22 09:03:29,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:29,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713552052] [2019-10-22 09:03:29,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:29,135 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:03:29,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713552052] [2019-10-22 09:03:29,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:29,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 09:03:29,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431978587] [2019-10-22 09:03:29,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:03:29,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:03:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:03:29,137 INFO L87 Difference]: Start difference. First operand 3029 states and 6883 transitions. Second operand 7 states. [2019-10-22 09:03:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:29,204 INFO L93 Difference]: Finished difference Result 5079 states and 11657 transitions. [2019-10-22 09:03:29,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:03:29,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 09:03:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:29,207 INFO L225 Difference]: With dead ends: 5079 [2019-10-22 09:03:29,207 INFO L226 Difference]: Without dead ends: 2136 [2019-10-22 09:03:29,207 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:03:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2136 states. [2019-10-22 09:03:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2136 to 2136. [2019-10-22 09:03:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2019-10-22 09:03:29,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4923 transitions. [2019-10-22 09:03:29,228 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4923 transitions. Word has length 84 [2019-10-22 09:03:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:29,228 INFO L462 AbstractCegarLoop]: Abstraction has 2136 states and 4923 transitions. [2019-10-22 09:03:29,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:03:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4923 transitions. [2019-10-22 09:03:29,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:29,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:29,230 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] [2019-10-22 09:03:29,230 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:29,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:29,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1037747623, now seen corresponding path program 2 times [2019-10-22 09:03:29,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:29,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747938154] [2019-10-22 09:03:29,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:29,306 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:03:29,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747938154] [2019-10-22 09:03:29,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:29,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:03:29,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31665472] [2019-10-22 09:03:29,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 09:03:29,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:29,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 09:03:29,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:29,307 INFO L87 Difference]: Start difference. First operand 2136 states and 4923 transitions. Second operand 6 states. [2019-10-22 09:03:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:29,489 INFO L93 Difference]: Finished difference Result 2360 states and 5457 transitions. [2019-10-22 09:03:29,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 09:03:29,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-22 09:03:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:29,491 INFO L225 Difference]: With dead ends: 2360 [2019-10-22 09:03:29,491 INFO L226 Difference]: Without dead ends: 2360 [2019-10-22 09:03:29,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 09:03:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2019-10-22 09:03:29,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 2078. [2019-10-22 09:03:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2078 states. [2019-10-22 09:03:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 4801 transitions. [2019-10-22 09:03:29,509 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 4801 transitions. Word has length 84 [2019-10-22 09:03:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:29,509 INFO L462 AbstractCegarLoop]: Abstraction has 2078 states and 4801 transitions. [2019-10-22 09:03:29,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 09:03:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 4801 transitions. [2019-10-22 09:03:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:29,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:29,510 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] [2019-10-22 09:03:29,510 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:29,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:29,510 INFO L82 PathProgramCache]: Analyzing trace with hash 736802086, now seen corresponding path program 2 times [2019-10-22 09:03:29,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:29,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084748152] [2019-10-22 09:03:29,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:29,635 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:03:29,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084748152] [2019-10-22 09:03:29,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:29,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 09:03:29,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872503606] [2019-10-22 09:03:29,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 09:03:29,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 09:03:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 09:03:29,636 INFO L87 Difference]: Start difference. First operand 2078 states and 4801 transitions. Second operand 8 states. [2019-10-22 09:03:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:29,857 INFO L93 Difference]: Finished difference Result 2423 states and 5610 transitions. [2019-10-22 09:03:29,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:03:29,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-10-22 09:03:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:29,859 INFO L225 Difference]: With dead ends: 2423 [2019-10-22 09:03:29,859 INFO L226 Difference]: Without dead ends: 2423 [2019-10-22 09:03:29,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 09:03:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-10-22 09:03:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2095. [2019-10-22 09:03:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-10-22 09:03:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 4836 transitions. [2019-10-22 09:03:29,875 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 4836 transitions. Word has length 84 [2019-10-22 09:03:29,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:29,875 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 4836 transitions. [2019-10-22 09:03:29,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 09:03:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 4836 transitions. [2019-10-22 09:03:29,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:29,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:29,876 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] [2019-10-22 09:03:29,876 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:29,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:29,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1624305767, now seen corresponding path program 2 times [2019-10-22 09:03:29,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:29,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588519770] [2019-10-22 09:03:29,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,877 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:29,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:29,993 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:03:29,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588519770] [2019-10-22 09:03:29,994 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:03:29,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 09:03:29,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856318149] [2019-10-22 09:03:29,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:03:29,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:03:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:03:29,995 INFO L87 Difference]: Start difference. First operand 2095 states and 4836 transitions. Second operand 10 states. [2019-10-22 09:03:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:30,260 INFO L93 Difference]: Finished difference Result 4187 states and 9739 transitions. [2019-10-22 09:03:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 09:03:30,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 09:03:30,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:03:30,262 INFO L225 Difference]: With dead ends: 4187 [2019-10-22 09:03:30,262 INFO L226 Difference]: Without dead ends: 2460 [2019-10-22 09:03:30,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-10-22 09:03:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2019-10-22 09:03:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 2132. [2019-10-22 09:03:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2132 states. [2019-10-22 09:03:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2132 states to 2132 states and 4865 transitions. [2019-10-22 09:03:30,280 INFO L78 Accepts]: Start accepts. Automaton has 2132 states and 4865 transitions. Word has length 84 [2019-10-22 09:03:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:03:30,281 INFO L462 AbstractCegarLoop]: Abstraction has 2132 states and 4865 transitions. [2019-10-22 09:03:30,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:03:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2132 states and 4865 transitions. [2019-10-22 09:03:30,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:03:30,282 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:03:30,282 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] [2019-10-22 09:03:30,283 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:03:30,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:30,283 INFO L82 PathProgramCache]: Analyzing trace with hash -700928025, now seen corresponding path program 3 times [2019-10-22 09:03:30,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:30,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325584775] [2019-10-22 09:03:30,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:30,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:30,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:30,366 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:30,367 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:03:30,497 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 09:03:30,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:03:30 BasicIcfg [2019-10-22 09:03:30,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:03:30,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:30,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:30,499 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:30,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:03:02" (3/4) ... [2019-10-22 09:03:30,504 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:03:30,631 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8825beef-ce6d-4ab8-b3e5-3dfb63c960f4/bin/uautomizer/witness.graphml [2019-10-22 09:03:30,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:30,633 INFO L168 Benchmark]: Toolchain (without parser) took 28975.54 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 937.8 MB in the beginning and 3.3 GB in the end (delta: -2.3 GB). Peak memory consumption was 772.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:30,633 INFO L168 Benchmark]: CDTParser took 0.14 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:03:30,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:30,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.87 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:03:30,633 INFO L168 Benchmark]: Boogie Preprocessor took 28.08 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:03:30,634 INFO L168 Benchmark]: RCFGBuilder took 535.10 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:30,634 INFO L168 Benchmark]: TraceAbstraction took 27637.60 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 723.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:30,634 INFO L168 Benchmark]: Witness Printer took 131.81 ms. Allocated memory is still 4.2 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:30,635 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.14 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 594.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.87 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 28.08 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 535.10 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: 48.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27637.60 ms. Allocated memory was 1.2 GB in the beginning and 4.2 GB in the end (delta: 3.0 GB). Free memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 723.2 MB. Max. memory is 11.5 GB. * Witness Printer took 131.81 ms. Allocated memory is still 4.2 GB. Free memory was 3.3 GB in the beginning and 3.3 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1637; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] FCALL, FORK 0 pthread_create(&t1637, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 0 pthread_t t1638; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1638, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. Result: UNSAFE, OverallTime: 27.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7724 SDtfs, 8817 SDslu, 17456 SDs, 0 SdLazy, 6334 SolverSat, 409 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 75 SyntacticMatches, 17 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 30 MinimizatonAttempts, 70508 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 2130 NumberOfCodeBlocks, 2130 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2016 ConstructedInterpolants, 0 QuantifiedInterpolants, 394888 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...