./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/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 d557fcdf9e422bdd0c5ac00696fcc79c766638d1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:30:20,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:30:20,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:30:20,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:30:20,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:30:20,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:30:20,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:30:20,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:30:20,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:30:20,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:30:20,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:30:20,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:30:20,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:30:20,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:30:20,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:30:20,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:30:20,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:30:20,861 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:30:20,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:30:20,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:30:20,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:30:20,871 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:30:20,873 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:30:20,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:30:20,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:30:20,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:30:20,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:30:20,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:30:20,877 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:30:20,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:30:20,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:30:20,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:30:20,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:30:20,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:30:20,881 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:30:20,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:30:20,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:30:20,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:30:20,883 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:30:20,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:30:20,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:30:20,885 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:30:20,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:30:20,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:30:20,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:30:20,910 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:30:20,910 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:30:20,910 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:30:20,910 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:30:20,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:30:20,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:30:20,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:30:20,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:30:20,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:30:20,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:30:20,912 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:30:20,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:30:20,912 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:30:20,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:30:20,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:30:20,913 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:30:20,913 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:30:20,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:30:20,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:20,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:30:20,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:30:20,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:30:20,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:30:20,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:30:20,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:30:20,915 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/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 -> d557fcdf9e422bdd0c5ac00696fcc79c766638d1 [2019-11-16 00:30:20,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:30:20,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:30:20,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:30:20,974 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:30:20,974 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:30:20,976 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-11-16 00:30:21,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/data/22388db38/bf020fe8550443ad9d248205a5e89628/FLAG57cac9156 [2019-11-16 00:30:21,552 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:30:21,554 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/sv-benchmarks/c/pthread-wmm/safe033_pso.opt.i [2019-11-16 00:30:21,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/data/22388db38/bf020fe8550443ad9d248205a5e89628/FLAG57cac9156 [2019-11-16 00:30:21,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/data/22388db38/bf020fe8550443ad9d248205a5e89628 [2019-11-16 00:30:21,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:30:21,865 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:30:21,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:21,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:30:21,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:30:21,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:21" (1/1) ... [2019-11-16 00:30:21,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433af1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:21, skipping insertion in model container [2019-11-16 00:30:21,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:21" (1/1) ... [2019-11-16 00:30:21,886 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:30:21,929 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:30:22,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:22,423 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:30:22,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:30:22,555 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:30:22,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22 WrapperNode [2019-11-16 00:30:22,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:30:22,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:22,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:30:22,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:30:22,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:30:22,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:30:22,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:30:22,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:30:22,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,638 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... [2019-11-16 00:30:22,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:30:22,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:30:22,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:30:22,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:30:22,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:30:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:30:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:30:22,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:30:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:30:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:30:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:30:22,715 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:30:22,715 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:30:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:30:22,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:30:22,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:30:22,718 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:30:23,352 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:30:23,352 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:30:23,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:23 BoogieIcfgContainer [2019-11-16 00:30:23,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:30:23,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:30:23,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:30:23,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:30:23,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:21" (1/3) ... [2019-11-16 00:30:23,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f11a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:23, skipping insertion in model container [2019-11-16 00:30:23,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:22" (2/3) ... [2019-11-16 00:30:23,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f11a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:23, skipping insertion in model container [2019-11-16 00:30:23,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:23" (3/3) ... [2019-11-16 00:30:23,361 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.opt.i [2019-11-16 00:30:23,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,425 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,425 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,426 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,427 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,428 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,429 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,430 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,430 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,430 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,430 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,430 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,431 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,431 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,431 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,431 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,431 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,432 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,432 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,432 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,432 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,432 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,433 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,433 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,433 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,434 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,434 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,434 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,435 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,435 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,435 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,435 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,436 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,437 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,438 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,439 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,439 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,440 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,440 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,440 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,440 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,440 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,441 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,442 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,443 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,443 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,444 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,444 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,444 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,444 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,445 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,445 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,445 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,445 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,446 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,449 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,449 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,449 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,450 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,451 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,451 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,451 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,458 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,459 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,459 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,459 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,459 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,460 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,461 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,461 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,461 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,461 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:30:23,468 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:30:23,468 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:30:23,475 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:30:23,486 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:30:23,505 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:30:23,505 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:30:23,505 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:30:23,505 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:30:23,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:30:23,506 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:30:23,506 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:30:23,506 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:30:23,523 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 127 places, 159 transitions [2019-11-16 00:30:25,456 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25973 states. [2019-11-16 00:30:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 25973 states. [2019-11-16 00:30:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:30:25,467 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:25,467 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:25,469 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:25,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:25,473 INFO L82 PathProgramCache]: Analyzing trace with hash 531989487, now seen corresponding path program 1 times [2019-11-16 00:30:25,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:25,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485708097] [2019-11-16 00:30:25,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:25,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:25,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:25,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485708097] [2019-11-16 00:30:25,717 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:25,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:25,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018397326] [2019-11-16 00:30:25,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:25,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:25,737 INFO L87 Difference]: Start difference. First operand 25973 states. Second operand 4 states. [2019-11-16 00:30:26,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:26,254 INFO L93 Difference]: Finished difference Result 26613 states and 102118 transitions. [2019-11-16 00:30:26,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:26,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-11-16 00:30:26,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:26,467 INFO L225 Difference]: With dead ends: 26613 [2019-11-16 00:30:26,467 INFO L226 Difference]: Without dead ends: 20357 [2019-11-16 00:30:26,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:27,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20357 states. [2019-11-16 00:30:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20357 to 20357. [2019-11-16 00:30:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20357 states. [2019-11-16 00:30:27,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20357 states to 20357 states and 78422 transitions. [2019-11-16 00:30:27,791 INFO L78 Accepts]: Start accepts. Automaton has 20357 states and 78422 transitions. Word has length 36 [2019-11-16 00:30:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:27,792 INFO L462 AbstractCegarLoop]: Abstraction has 20357 states and 78422 transitions. [2019-11-16 00:30:27,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 20357 states and 78422 transitions. [2019-11-16 00:30:27,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-16 00:30:27,804 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:27,804 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:27,805 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:27,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:27,805 INFO L82 PathProgramCache]: Analyzing trace with hash 998522529, now seen corresponding path program 1 times [2019-11-16 00:30:27,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:27,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710312284] [2019-11-16 00:30:27,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:27,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:27,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:27,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710312284] [2019-11-16 00:30:27,960 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:27,960 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:27,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62315083] [2019-11-16 00:30:27,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:27,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:27,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:27,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:27,963 INFO L87 Difference]: Start difference. First operand 20357 states and 78422 transitions. Second operand 5 states. [2019-11-16 00:30:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:28,639 INFO L93 Difference]: Finished difference Result 31835 states and 116039 transitions. [2019-11-16 00:30:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:28,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-11-16 00:30:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:28,761 INFO L225 Difference]: With dead ends: 31835 [2019-11-16 00:30:28,761 INFO L226 Difference]: Without dead ends: 31283 [2019-11-16 00:30:28,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:29,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31283 states. [2019-11-16 00:30:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31283 to 29702. [2019-11-16 00:30:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29702 states. [2019-11-16 00:30:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29702 states to 29702 states and 109516 transitions. [2019-11-16 00:30:29,991 INFO L78 Accepts]: Start accepts. Automaton has 29702 states and 109516 transitions. Word has length 44 [2019-11-16 00:30:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:29,992 INFO L462 AbstractCegarLoop]: Abstraction has 29702 states and 109516 transitions. [2019-11-16 00:30:29,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29702 states and 109516 transitions. [2019-11-16 00:30:29,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-16 00:30:29,999 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:29,999 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:30,000 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:30,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:30,000 INFO L82 PathProgramCache]: Analyzing trace with hash -192170192, now seen corresponding path program 1 times [2019-11-16 00:30:30,001 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:30,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787005988] [2019-11-16 00:30:30,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:30,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:30,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:30,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787005988] [2019-11-16 00:30:30,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:30,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:30,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593246844] [2019-11-16 00:30:30,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:30,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:30,132 INFO L87 Difference]: Start difference. First operand 29702 states and 109516 transitions. Second operand 5 states. [2019-11-16 00:30:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:31,040 INFO L93 Difference]: Finished difference Result 38693 states and 139688 transitions. [2019-11-16 00:30:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:31,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-16 00:30:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:31,136 INFO L225 Difference]: With dead ends: 38693 [2019-11-16 00:30:31,136 INFO L226 Difference]: Without dead ends: 38245 [2019-11-16 00:30:31,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:31,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38245 states. [2019-11-16 00:30:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38245 to 32948. [2019-11-16 00:30:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32948 states. [2019-11-16 00:30:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32948 states to 32948 states and 120525 transitions. [2019-11-16 00:30:31,996 INFO L78 Accepts]: Start accepts. Automaton has 32948 states and 120525 transitions. Word has length 45 [2019-11-16 00:30:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:31,996 INFO L462 AbstractCegarLoop]: Abstraction has 32948 states and 120525 transitions. [2019-11-16 00:30:31,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:31,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32948 states and 120525 transitions. [2019-11-16 00:30:32,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:30:32,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:32,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:32,004 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:32,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1923602230, now seen corresponding path program 1 times [2019-11-16 00:30:32,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:32,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470441214] [2019-11-16 00:30:32,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:32,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470441214] [2019-11-16 00:30:32,057 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:32,057 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:32,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670266024] [2019-11-16 00:30:32,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:32,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:32,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:32,059 INFO L87 Difference]: Start difference. First operand 32948 states and 120525 transitions. Second operand 3 states. [2019-11-16 00:30:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:32,288 INFO L93 Difference]: Finished difference Result 42409 states and 152016 transitions. [2019-11-16 00:30:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:32,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-11-16 00:30:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:32,408 INFO L225 Difference]: With dead ends: 42409 [2019-11-16 00:30:32,408 INFO L226 Difference]: Without dead ends: 42409 [2019-11-16 00:30:32,409 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42409 states. [2019-11-16 00:30:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42409 to 37662. [2019-11-16 00:30:33,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37662 states. [2019-11-16 00:30:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37662 states to 37662 states and 136329 transitions. [2019-11-16 00:30:33,574 INFO L78 Accepts]: Start accepts. Automaton has 37662 states and 136329 transitions. Word has length 47 [2019-11-16 00:30:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:33,574 INFO L462 AbstractCegarLoop]: Abstraction has 37662 states and 136329 transitions. [2019-11-16 00:30:33,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 37662 states and 136329 transitions. [2019-11-16 00:30:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:33,589 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:33,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:33,589 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -629683857, now seen corresponding path program 1 times [2019-11-16 00:30:33,590 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:33,590 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574116406] [2019-11-16 00:30:33,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,590 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:33,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:33,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:33,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574116406] [2019-11-16 00:30:33,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:33,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:33,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427302360] [2019-11-16 00:30:33,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:33,666 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:33,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:33,667 INFO L87 Difference]: Start difference. First operand 37662 states and 136329 transitions. Second operand 6 states. [2019-11-16 00:30:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:34,344 INFO L93 Difference]: Finished difference Result 48753 states and 172978 transitions. [2019-11-16 00:30:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:30:34,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:30:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:34,429 INFO L225 Difference]: With dead ends: 48753 [2019-11-16 00:30:34,429 INFO L226 Difference]: Without dead ends: 48233 [2019-11-16 00:30:34,430 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:30:35,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48233 states. [2019-11-16 00:30:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48233 to 38226. [2019-11-16 00:30:35,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38226 states. [2019-11-16 00:30:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38226 states to 38226 states and 138492 transitions. [2019-11-16 00:30:35,795 INFO L78 Accepts]: Start accepts. Automaton has 38226 states and 138492 transitions. Word has length 51 [2019-11-16 00:30:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:35,795 INFO L462 AbstractCegarLoop]: Abstraction has 38226 states and 138492 transitions. [2019-11-16 00:30:35,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 38226 states and 138492 transitions. [2019-11-16 00:30:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:35,807 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:35,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:35,808 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1938707736, now seen corresponding path program 1 times [2019-11-16 00:30:35,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:35,809 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78910252] [2019-11-16 00:30:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:35,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:35,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:35,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78910252] [2019-11-16 00:30:35,963 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:35,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:35,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401002508] [2019-11-16 00:30:35,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:35,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:35,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:35,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:35,965 INFO L87 Difference]: Start difference. First operand 38226 states and 138492 transitions. Second operand 6 states. [2019-11-16 00:30:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:36,675 INFO L93 Difference]: Finished difference Result 53002 states and 189568 transitions. [2019-11-16 00:30:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:36,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-11-16 00:30:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:36,781 INFO L225 Difference]: With dead ends: 53002 [2019-11-16 00:30:36,781 INFO L226 Difference]: Without dead ends: 52026 [2019-11-16 00:30:36,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52026 states. [2019-11-16 00:30:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52026 to 48779. [2019-11-16 00:30:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48779 states. [2019-11-16 00:30:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48779 states to 48779 states and 175223 transitions. [2019-11-16 00:30:41,367 INFO L78 Accepts]: Start accepts. Automaton has 48779 states and 175223 transitions. Word has length 51 [2019-11-16 00:30:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:41,368 INFO L462 AbstractCegarLoop]: Abstraction has 48779 states and 175223 transitions. [2019-11-16 00:30:41,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 48779 states and 175223 transitions. [2019-11-16 00:30:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:41,380 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:41,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:41,380 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash 559308201, now seen corresponding path program 1 times [2019-11-16 00:30:41,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:41,381 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475381370] [2019-11-16 00:30:41,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:41,381 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:41,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475381370] [2019-11-16 00:30:41,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:41,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:41,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495318446] [2019-11-16 00:30:41,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:41,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:41,494 INFO L87 Difference]: Start difference. First operand 48779 states and 175223 transitions. Second operand 7 states. [2019-11-16 00:30:42,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:42,514 INFO L93 Difference]: Finished difference Result 70894 states and 244520 transitions. [2019-11-16 00:30:42,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:30:42,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-16 00:30:42,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:42,644 INFO L225 Difference]: With dead ends: 70894 [2019-11-16 00:30:42,644 INFO L226 Difference]: Without dead ends: 70894 [2019-11-16 00:30:42,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70894 states. [2019-11-16 00:30:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70894 to 57887. [2019-11-16 00:30:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57887 states. [2019-11-16 00:30:43,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57887 states to 57887 states and 203147 transitions. [2019-11-16 00:30:43,717 INFO L78 Accepts]: Start accepts. Automaton has 57887 states and 203147 transitions. Word has length 51 [2019-11-16 00:30:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:43,717 INFO L462 AbstractCegarLoop]: Abstraction has 57887 states and 203147 transitions. [2019-11-16 00:30:43,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:43,717 INFO L276 IsEmpty]: Start isEmpty. Operand 57887 states and 203147 transitions. [2019-11-16 00:30:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-16 00:30:43,730 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:43,730 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:43,730 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1446811882, now seen corresponding path program 1 times [2019-11-16 00:30:43,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:43,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496234019] [2019-11-16 00:30:43,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:43,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:43,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:43,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496234019] [2019-11-16 00:30:43,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:43,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:30:43,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982086683] [2019-11-16 00:30:43,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:30:43,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:30:43,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:43,785 INFO L87 Difference]: Start difference. First operand 57887 states and 203147 transitions. Second operand 3 states. [2019-11-16 00:30:44,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:44,470 INFO L93 Difference]: Finished difference Result 43853 states and 152830 transitions. [2019-11-16 00:30:44,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:30:44,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-16 00:30:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:44,567 INFO L225 Difference]: With dead ends: 43853 [2019-11-16 00:30:44,567 INFO L226 Difference]: Without dead ends: 43349 [2019-11-16 00:30:44,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:30:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43349 states. [2019-11-16 00:30:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43349 to 41883. [2019-11-16 00:30:45,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41883 states. [2019-11-16 00:30:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41883 states to 41883 states and 146701 transitions. [2019-11-16 00:30:45,342 INFO L78 Accepts]: Start accepts. Automaton has 41883 states and 146701 transitions. Word has length 51 [2019-11-16 00:30:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:45,342 INFO L462 AbstractCegarLoop]: Abstraction has 41883 states and 146701 transitions. [2019-11-16 00:30:45,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:30:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 41883 states and 146701 transitions. [2019-11-16 00:30:45,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:30:45,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:45,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:45,353 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:45,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:45,353 INFO L82 PathProgramCache]: Analyzing trace with hash 371712380, now seen corresponding path program 1 times [2019-11-16 00:30:45,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:45,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243506334] [2019-11-16 00:30:45,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:45,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:45,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:45,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:45,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243506334] [2019-11-16 00:30:45,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:45,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:45,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722645461] [2019-11-16 00:30:45,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:45,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:45,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:45,454 INFO L87 Difference]: Start difference. First operand 41883 states and 146701 transitions. Second operand 6 states. [2019-11-16 00:30:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:46,122 INFO L93 Difference]: Finished difference Result 54546 states and 184831 transitions. [2019-11-16 00:30:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:46,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-16 00:30:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:46,219 INFO L225 Difference]: With dead ends: 54546 [2019-11-16 00:30:46,219 INFO L226 Difference]: Without dead ends: 54546 [2019-11-16 00:30:46,219 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54546 states. [2019-11-16 00:30:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54546 to 45858. [2019-11-16 00:30:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45858 states. [2019-11-16 00:30:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45858 states to 45858 states and 158164 transitions. [2019-11-16 00:30:47,014 INFO L78 Accepts]: Start accepts. Automaton has 45858 states and 158164 transitions. Word has length 52 [2019-11-16 00:30:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:47,014 INFO L462 AbstractCegarLoop]: Abstraction has 45858 states and 158164 transitions. [2019-11-16 00:30:47,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 45858 states and 158164 transitions. [2019-11-16 00:30:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-16 00:30:47,024 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:47,024 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:47,024 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:47,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:47,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1259216061, now seen corresponding path program 1 times [2019-11-16 00:30:47,024 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:47,024 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038232897] [2019-11-16 00:30:47,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:47,086 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038232897] [2019-11-16 00:30:47,086 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:47,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:47,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178880157] [2019-11-16 00:30:47,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:47,087 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:47,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:47,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:47,087 INFO L87 Difference]: Start difference. First operand 45858 states and 158164 transitions. Second operand 4 states. [2019-11-16 00:30:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:47,135 INFO L93 Difference]: Finished difference Result 8160 states and 24868 transitions. [2019-11-16 00:30:47,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:30:47,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-16 00:30:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:47,145 INFO L225 Difference]: With dead ends: 8160 [2019-11-16 00:30:47,146 INFO L226 Difference]: Without dead ends: 6751 [2019-11-16 00:30:47,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6751 states. [2019-11-16 00:30:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6751 to 6703. [2019-11-16 00:30:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6703 states. [2019-11-16 00:30:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6703 states to 6703 states and 20037 transitions. [2019-11-16 00:30:47,223 INFO L78 Accepts]: Start accepts. Automaton has 6703 states and 20037 transitions. Word has length 52 [2019-11-16 00:30:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:47,224 INFO L462 AbstractCegarLoop]: Abstraction has 6703 states and 20037 transitions. [2019-11-16 00:30:47,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6703 states and 20037 transitions. [2019-11-16 00:30:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:30:47,227 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:47,227 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:47,227 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1556006386, now seen corresponding path program 1 times [2019-11-16 00:30:47,227 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:47,227 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323449407] [2019-11-16 00:30:47,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,227 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:47,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323449407] [2019-11-16 00:30:47,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:47,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:47,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870971856] [2019-11-16 00:30:47,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:47,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:47,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:47,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:47,268 INFO L87 Difference]: Start difference. First operand 6703 states and 20037 transitions. Second operand 4 states. [2019-11-16 00:30:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:47,404 INFO L93 Difference]: Finished difference Result 7888 states and 23386 transitions. [2019-11-16 00:30:47,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:30:47,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-11-16 00:30:47,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:47,413 INFO L225 Difference]: With dead ends: 7888 [2019-11-16 00:30:47,413 INFO L226 Difference]: Without dead ends: 7888 [2019-11-16 00:30:47,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7888 states. [2019-11-16 00:30:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7888 to 7210. [2019-11-16 00:30:47,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7210 states. [2019-11-16 00:30:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7210 states to 7210 states and 21443 transitions. [2019-11-16 00:30:47,500 INFO L78 Accepts]: Start accepts. Automaton has 7210 states and 21443 transitions. Word has length 61 [2019-11-16 00:30:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:47,500 INFO L462 AbstractCegarLoop]: Abstraction has 7210 states and 21443 transitions. [2019-11-16 00:30:47,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:47,500 INFO L276 IsEmpty]: Start isEmpty. Operand 7210 states and 21443 transitions. [2019-11-16 00:30:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:30:47,504 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:47,504 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:47,504 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:47,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 186803949, now seen corresponding path program 1 times [2019-11-16 00:30:47,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:47,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259771121] [2019-11-16 00:30:47,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:47,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:47,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:47,570 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259771121] [2019-11-16 00:30:47,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:47,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:47,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079266140] [2019-11-16 00:30:47,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:47,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:47,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:47,571 INFO L87 Difference]: Start difference. First operand 7210 states and 21443 transitions. Second operand 6 states. [2019-11-16 00:30:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:47,903 INFO L93 Difference]: Finished difference Result 9265 states and 27192 transitions. [2019-11-16 00:30:47,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:30:47,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-11-16 00:30:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:47,914 INFO L225 Difference]: With dead ends: 9265 [2019-11-16 00:30:47,914 INFO L226 Difference]: Without dead ends: 9217 [2019-11-16 00:30:47,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:30:47,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9217 states. [2019-11-16 00:30:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9217 to 8049. [2019-11-16 00:30:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8049 states. [2019-11-16 00:30:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8049 states to 8049 states and 23823 transitions. [2019-11-16 00:30:48,033 INFO L78 Accepts]: Start accepts. Automaton has 8049 states and 23823 transitions. Word has length 61 [2019-11-16 00:30:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:48,034 INFO L462 AbstractCegarLoop]: Abstraction has 8049 states and 23823 transitions. [2019-11-16 00:30:48,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8049 states and 23823 transitions. [2019-11-16 00:30:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:48,043 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:48,043 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:48,043 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1202030726, now seen corresponding path program 1 times [2019-11-16 00:30:48,044 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:48,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511119685] [2019-11-16 00:30:48,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:48,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:48,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:48,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:48,121 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511119685] [2019-11-16 00:30:48,121 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:48,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:48,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73701135] [2019-11-16 00:30:48,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:48,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:48,123 INFO L87 Difference]: Start difference. First operand 8049 states and 23823 transitions. Second operand 4 states. [2019-11-16 00:30:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:48,544 INFO L93 Difference]: Finished difference Result 10662 states and 31172 transitions. [2019-11-16 00:30:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:30:48,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:30:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:48,561 INFO L225 Difference]: With dead ends: 10662 [2019-11-16 00:30:48,562 INFO L226 Difference]: Without dead ends: 10662 [2019-11-16 00:30:48,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:48,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10662 states. [2019-11-16 00:30:48,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 9072. [2019-11-16 00:30:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9072 states. [2019-11-16 00:30:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9072 states to 9072 states and 26642 transitions. [2019-11-16 00:30:48,680 INFO L78 Accepts]: Start accepts. Automaton has 9072 states and 26642 transitions. Word has length 65 [2019-11-16 00:30:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 9072 states and 26642 transitions. [2019-11-16 00:30:48,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 9072 states and 26642 transitions. [2019-11-16 00:30:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:48,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:48,688 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:48,688 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1848172089, now seen corresponding path program 1 times [2019-11-16 00:30:48,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:48,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848220868] [2019-11-16 00:30:48,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:48,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:48,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:48,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:48,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848220868] [2019-11-16 00:30:48,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:48,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:48,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026118237] [2019-11-16 00:30:48,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:48,786 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:48,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:48,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:48,786 INFO L87 Difference]: Start difference. First operand 9072 states and 26642 transitions. Second operand 6 states. [2019-11-16 00:30:49,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:49,283 INFO L93 Difference]: Finished difference Result 10382 states and 29893 transitions. [2019-11-16 00:30:49,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:30:49,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:30:49,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:49,295 INFO L225 Difference]: With dead ends: 10382 [2019-11-16 00:30:49,295 INFO L226 Difference]: Without dead ends: 10382 [2019-11-16 00:30:49,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:30:49,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10382 states. [2019-11-16 00:30:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10382 to 10079. [2019-11-16 00:30:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10079 states. [2019-11-16 00:30:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 29116 transitions. [2019-11-16 00:30:49,409 INFO L78 Accepts]: Start accepts. Automaton has 10079 states and 29116 transitions. Word has length 65 [2019-11-16 00:30:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:49,409 INFO L462 AbstractCegarLoop]: Abstraction has 10079 states and 29116 transitions. [2019-11-16 00:30:49,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10079 states and 29116 transitions. [2019-11-16 00:30:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:49,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:49,417 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:49,417 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:49,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:49,417 INFO L82 PathProgramCache]: Analyzing trace with hash 369585864, now seen corresponding path program 1 times [2019-11-16 00:30:49,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:49,418 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235836211] [2019-11-16 00:30:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:49,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:49,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:49,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235836211] [2019-11-16 00:30:49,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:49,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:49,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759582376] [2019-11-16 00:30:49,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:49,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:49,537 INFO L87 Difference]: Start difference. First operand 10079 states and 29116 transitions. Second operand 6 states. [2019-11-16 00:30:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:49,904 INFO L93 Difference]: Finished difference Result 11996 states and 33623 transitions. [2019-11-16 00:30:49,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:30:49,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-16 00:30:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:49,917 INFO L225 Difference]: With dead ends: 11996 [2019-11-16 00:30:49,917 INFO L226 Difference]: Without dead ends: 11996 [2019-11-16 00:30:49,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:30:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11996 states. [2019-11-16 00:30:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11996 to 10298. [2019-11-16 00:30:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10298 states. [2019-11-16 00:30:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10298 states to 10298 states and 29168 transitions. [2019-11-16 00:30:50,040 INFO L78 Accepts]: Start accepts. Automaton has 10298 states and 29168 transitions. Word has length 65 [2019-11-16 00:30:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:50,040 INFO L462 AbstractCegarLoop]: Abstraction has 10298 states and 29168 transitions. [2019-11-16 00:30:50,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10298 states and 29168 transitions. [2019-11-16 00:30:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:50,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:50,049 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:50,049 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash 580936777, now seen corresponding path program 1 times [2019-11-16 00:30:50,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:50,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135449753] [2019-11-16 00:30:50,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:50,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:50,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:50,113 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135449753] [2019-11-16 00:30:50,113 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:50,113 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:50,113 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288961198] [2019-11-16 00:30:50,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:50,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:50,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:50,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:50,114 INFO L87 Difference]: Start difference. First operand 10298 states and 29168 transitions. Second operand 5 states. [2019-11-16 00:30:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:50,386 INFO L93 Difference]: Finished difference Result 12573 states and 35461 transitions. [2019-11-16 00:30:50,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:50,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:30:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:50,400 INFO L225 Difference]: With dead ends: 12573 [2019-11-16 00:30:50,400 INFO L226 Difference]: Without dead ends: 12573 [2019-11-16 00:30:50,400 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12573 states. [2019-11-16 00:30:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12573 to 11073. [2019-11-16 00:30:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11073 states. [2019-11-16 00:30:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11073 states to 11073 states and 31102 transitions. [2019-11-16 00:30:50,531 INFO L78 Accepts]: Start accepts. Automaton has 11073 states and 31102 transitions. Word has length 65 [2019-11-16 00:30:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:50,532 INFO L462 AbstractCegarLoop]: Abstraction has 11073 states and 31102 transitions. [2019-11-16 00:30:50,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 11073 states and 31102 transitions. [2019-11-16 00:30:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:50,541 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:50,541 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:50,541 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:50,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:50,542 INFO L82 PathProgramCache]: Analyzing trace with hash 70402600, now seen corresponding path program 1 times [2019-11-16 00:30:50,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:50,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549948938] [2019-11-16 00:30:50,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:50,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:50,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:50,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549948938] [2019-11-16 00:30:50,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:50,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:30:50,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306023274] [2019-11-16 00:30:50,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:30:50,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:30:50,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:30:50,619 INFO L87 Difference]: Start difference. First operand 11073 states and 31102 transitions. Second operand 4 states. [2019-11-16 00:30:51,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:51,063 INFO L93 Difference]: Finished difference Result 13629 states and 38377 transitions. [2019-11-16 00:30:51,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:30:51,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-16 00:30:51,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:51,085 INFO L225 Difference]: With dead ends: 13629 [2019-11-16 00:30:51,086 INFO L226 Difference]: Without dead ends: 13254 [2019-11-16 00:30:51,086 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13254 states. [2019-11-16 00:30:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13254 to 12711. [2019-11-16 00:30:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12711 states. [2019-11-16 00:30:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12711 states to 12711 states and 35686 transitions. [2019-11-16 00:30:51,270 INFO L78 Accepts]: Start accepts. Automaton has 12711 states and 35686 transitions. Word has length 65 [2019-11-16 00:30:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:51,270 INFO L462 AbstractCegarLoop]: Abstraction has 12711 states and 35686 transitions. [2019-11-16 00:30:51,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:30:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 12711 states and 35686 transitions. [2019-11-16 00:30:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:51,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:51,278 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:51,278 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1726548759, now seen corresponding path program 1 times [2019-11-16 00:30:51,279 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:51,279 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023000260] [2019-11-16 00:30:51,279 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:51,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:51,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:51,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023000260] [2019-11-16 00:30:51,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:51,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:51,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629618637] [2019-11-16 00:30:51,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:51,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:51,401 INFO L87 Difference]: Start difference. First operand 12711 states and 35686 transitions. Second operand 7 states. [2019-11-16 00:30:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:51,769 INFO L93 Difference]: Finished difference Result 15473 states and 42651 transitions. [2019-11-16 00:30:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:30:51,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-11-16 00:30:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:51,787 INFO L225 Difference]: With dead ends: 15473 [2019-11-16 00:30:51,787 INFO L226 Difference]: Without dead ends: 15473 [2019-11-16 00:30:51,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:30:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15473 states. [2019-11-16 00:30:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15473 to 12107. [2019-11-16 00:30:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12107 states. [2019-11-16 00:30:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12107 states to 12107 states and 33422 transitions. [2019-11-16 00:30:51,936 INFO L78 Accepts]: Start accepts. Automaton has 12107 states and 33422 transitions. Word has length 65 [2019-11-16 00:30:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:51,936 INFO L462 AbstractCegarLoop]: Abstraction has 12107 states and 33422 transitions. [2019-11-16 00:30:51,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:51,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12107 states and 33422 transitions. [2019-11-16 00:30:51,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-16 00:30:51,942 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:51,942 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:51,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:51,943 INFO L82 PathProgramCache]: Analyzing trace with hash -839045078, now seen corresponding path program 1 times [2019-11-16 00:30:51,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:51,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063964411] [2019-11-16 00:30:51,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:51,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:51,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:52,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063964411] [2019-11-16 00:30:52,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:52,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:30:52,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280949332] [2019-11-16 00:30:52,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:30:52,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:52,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:30:52,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:30:52,018 INFO L87 Difference]: Start difference. First operand 12107 states and 33422 transitions. Second operand 5 states. [2019-11-16 00:30:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:52,065 INFO L93 Difference]: Finished difference Result 4022 states and 9369 transitions. [2019-11-16 00:30:52,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:30:52,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-16 00:30:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:52,070 INFO L225 Difference]: With dead ends: 4022 [2019-11-16 00:30:52,070 INFO L226 Difference]: Without dead ends: 3349 [2019-11-16 00:30:52,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2019-11-16 00:30:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3089. [2019-11-16 00:30:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2019-11-16 00:30:52,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 7075 transitions. [2019-11-16 00:30:52,110 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 7075 transitions. Word has length 65 [2019-11-16 00:30:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:52,110 INFO L462 AbstractCegarLoop]: Abstraction has 3089 states and 7075 transitions. [2019-11-16 00:30:52,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:30:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 7075 transitions. [2019-11-16 00:30:52,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:30:52,114 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:52,114 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:52,115 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1377720652, now seen corresponding path program 1 times [2019-11-16 00:30:52,115 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:52,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695319308] [2019-11-16 00:30:52,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:52,116 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:52,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:52,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695319308] [2019-11-16 00:30:52,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:52,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:52,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092618432] [2019-11-16 00:30:52,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:52,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:52,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:52,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:52,249 INFO L87 Difference]: Start difference. First operand 3089 states and 7075 transitions. Second operand 7 states. [2019-11-16 00:30:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:52,715 INFO L93 Difference]: Finished difference Result 3728 states and 8436 transitions. [2019-11-16 00:30:52,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:30:52,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:30:52,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:52,718 INFO L225 Difference]: With dead ends: 3728 [2019-11-16 00:30:52,718 INFO L226 Difference]: Without dead ends: 3697 [2019-11-16 00:30:52,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:30:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3697 states. [2019-11-16 00:30:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3697 to 3243. [2019-11-16 00:30:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3243 states. [2019-11-16 00:30:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 7398 transitions. [2019-11-16 00:30:52,748 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 7398 transitions. Word has length 82 [2019-11-16 00:30:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:52,748 INFO L462 AbstractCegarLoop]: Abstraction has 3243 states and 7398 transitions. [2019-11-16 00:30:52,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 7398 transitions. [2019-11-16 00:30:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:30:52,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:52,751 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:52,751 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 733569717, now seen corresponding path program 1 times [2019-11-16 00:30:52,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:52,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587627229] [2019-11-16 00:30:52,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:52,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:52,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:52,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587627229] [2019-11-16 00:30:52,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:52,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:30:52,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139275213] [2019-11-16 00:30:52,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:30:52,905 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:52,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:30:52,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:30:52,908 INFO L87 Difference]: Start difference. First operand 3243 states and 7398 transitions. Second operand 9 states. [2019-11-16 00:30:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:53,278 INFO L93 Difference]: Finished difference Result 11538 states and 26510 transitions. [2019-11-16 00:30:53,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-16 00:30:53,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-11-16 00:30:53,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:53,284 INFO L225 Difference]: With dead ends: 11538 [2019-11-16 00:30:53,284 INFO L226 Difference]: Without dead ends: 7339 [2019-11-16 00:30:53,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:30:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7339 states. [2019-11-16 00:30:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7339 to 3321. [2019-11-16 00:30:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-11-16 00:30:53,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 7546 transitions. [2019-11-16 00:30:53,328 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 7546 transitions. Word has length 82 [2019-11-16 00:30:53,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:53,328 INFO L462 AbstractCegarLoop]: Abstraction has 3321 states and 7546 transitions. [2019-11-16 00:30:53,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:30:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 7546 transitions. [2019-11-16 00:30:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:30:53,331 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:53,331 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:53,331 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:53,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:53,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1812519390, now seen corresponding path program 2 times [2019-11-16 00:30:53,332 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:53,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849825532] [2019-11-16 00:30:53,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,333 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:53,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849825532] [2019-11-16 00:30:53,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:53,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:30:53,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404022389] [2019-11-16 00:30:53,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:30:53,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:30:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:30:53,463 INFO L87 Difference]: Start difference. First operand 3321 states and 7546 transitions. Second operand 6 states. [2019-11-16 00:30:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:53,686 INFO L93 Difference]: Finished difference Result 3701 states and 8348 transitions. [2019-11-16 00:30:53,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:53,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-11-16 00:30:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:53,691 INFO L225 Difference]: With dead ends: 3701 [2019-11-16 00:30:53,691 INFO L226 Difference]: Without dead ends: 3629 [2019-11-16 00:30:53,691 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-11-16 00:30:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3104. [2019-11-16 00:30:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-11-16 00:30:53,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 7014 transitions. [2019-11-16 00:30:53,733 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 7014 transitions. Word has length 82 [2019-11-16 00:30:53,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:53,733 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 7014 transitions. [2019-11-16 00:30:53,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:30:53,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 7014 transitions. [2019-11-16 00:30:53,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:30:53,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:53,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:53,737 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:53,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1781499583, now seen corresponding path program 2 times [2019-11-16 00:30:53,738 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:53,738 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744727350] [2019-11-16 00:30:53,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,738 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:30:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:30:53,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744727350] [2019-11-16 00:30:53,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:30:53,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:30:53,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306992984] [2019-11-16 00:30:53,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:30:53,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:30:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:30:53,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:30:53,888 INFO L87 Difference]: Start difference. First operand 3104 states and 7014 transitions. Second operand 7 states. [2019-11-16 00:30:53,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:30:53,954 INFO L93 Difference]: Finished difference Result 5310 states and 12039 transitions. [2019-11-16 00:30:53,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:30:53,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-11-16 00:30:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:30:53,958 INFO L225 Difference]: With dead ends: 5310 [2019-11-16 00:30:53,958 INFO L226 Difference]: Without dead ends: 2294 [2019-11-16 00:30:53,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:30:53,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-11-16 00:30:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2294. [2019-11-16 00:30:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2294 states. [2019-11-16 00:30:53,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 5172 transitions. [2019-11-16 00:30:53,983 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 5172 transitions. Word has length 82 [2019-11-16 00:30:53,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:30:53,983 INFO L462 AbstractCegarLoop]: Abstraction has 2294 states and 5172 transitions. [2019-11-16 00:30:53,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:30:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 5172 transitions. [2019-11-16 00:30:53,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-16 00:30:53,985 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:30:53,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:30:53,985 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:30:53,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:30:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1233614151, now seen corresponding path program 3 times [2019-11-16 00:30:53,986 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:30:53,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858420178] [2019-11-16 00:30:53,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:30:53,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:30:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:30:54,075 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:30:54,075 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:30:54,247 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:30:54,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:30:54 BasicIcfg [2019-11-16 00:30:54,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:30:54,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:30:54,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:30:54,250 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:30:54,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:30:23" (3/4) ... [2019-11-16 00:30:54,253 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:30:54,391 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_97e5d6f8-1bd9-444e-80ab-c3d7fcbfda15/bin/uautomizer/witness.graphml [2019-11-16 00:30:54,392 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:30:54,394 INFO L168 Benchmark]: Toolchain (without parser) took 32528.31 ms. Allocated memory was 1.0 GB in the beginning and 4.6 GB in the end (delta: 3.6 GB). Free memory was 946.1 MB in the beginning and 4.1 GB in the end (delta: -3.1 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:54,394 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:54,394 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:54,395 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 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-11-16 00:30:54,395 INFO L168 Benchmark]: Boogie Preprocessor took 40.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:30:54,396 INFO L168 Benchmark]: RCFGBuilder took 702.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:54,396 INFO L168 Benchmark]: TraceAbstraction took 30894.90 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -613.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-16 00:30:54,397 INFO L168 Benchmark]: Witness Printer took 142.13 ms. Allocated memory was 4.0 GB in the beginning and 4.6 GB in the end (delta: 591.9 MB). Free memory was 1.7 GB in the beginning and 4.1 GB in the end (delta: -2.4 GB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:30:54,399 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 691.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 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 40.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 702.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.4 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30894.90 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -613.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * Witness Printer took 142.13 ms. Allocated memory was 4.0 GB in the beginning and 4.6 GB in the end (delta: 591.9 MB). Free memory was 1.7 GB in the beginning and 4.1 GB in the end (delta: -2.4 GB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L699] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L701] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L703] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L704] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L705] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L706] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L707] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L708] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L709] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L710] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L711] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L712] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L713] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L714] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L715] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 0 pthread_t t2567; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] FCALL, FORK 0 pthread_create(&t2567, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] 0 pthread_t t2568; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2568, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L759] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L760] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L761] 2 x$r_buff0_thd2 = (_Bool)1 [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L733] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L737] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x = x$flush_delayed ? x$mem_tmp : x [L741] 1 x$flush_delayed = (_Bool)0 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L794] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 193 locations, 3 error locations. Result: UNSAFE, OverallTime: 30.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6054 SDtfs, 7749 SDslu, 14044 SDs, 0 SdLazy, 5136 SolverSat, 389 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57887occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 64191 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1467 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 238611 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...