./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/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 69417dd099e45f70ae9a3d3ca34de041dff6082f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 12:27:04,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:27:04,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:27:04,731 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:27:04,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:27:04,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:27:04,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:27:04,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:27:04,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:27:04,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:27:04,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:27:04,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:27:04,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:27:04,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:27:04,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:27:04,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:27:04,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:27:04,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:27:04,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:27:04,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:27:04,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:27:04,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:27:04,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:27:04,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:27:04,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:27:04,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:27:04,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:27:04,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:27:04,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:27:04,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:27:04,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:27:04,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:27:04,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:27:04,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:27:04,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:27:04,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:27:04,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:27:04,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:27:04,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:27:04,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:27:04,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:27:04,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:27:04,763 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:27:04,763 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:27:04,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:27:04,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:27:04,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:27:04,765 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:27:04,765 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:27:04,766 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:27:04,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:27:04,766 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_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/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 -> 69417dd099e45f70ae9a3d3ca34de041dff6082f [2019-12-07 12:27:04,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:27:04,872 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:27:04,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:27:04,876 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:27:04,876 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:27:04,876 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix000_power.opt.i [2019-12-07 12:27:04,914 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/data/462542fd5/96ed7f7aacd64ed0a61fed3b825d8f45/FLAGfd81925a1 [2019-12-07 12:27:05,385 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:27:05,386 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/sv-benchmarks/c/pthread-wmm/mix000_power.opt.i [2019-12-07 12:27:05,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/data/462542fd5/96ed7f7aacd64ed0a61fed3b825d8f45/FLAGfd81925a1 [2019-12-07 12:27:05,409 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/data/462542fd5/96ed7f7aacd64ed0a61fed3b825d8f45 [2019-12-07 12:27:05,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:27:05,413 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:27:05,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:05,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:27:05,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:27:05,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05, skipping insertion in model container [2019-12-07 12:27:05,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:27:05,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:27:05,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:27:05,709 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:27:05,752 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:27:05,796 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:27:05,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05 WrapperNode [2019-12-07 12:27:05,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:27:05,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:27:05,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:27:05,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:27:05,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:27:05,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:27:05,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:27:05,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:27:05,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... [2019-12-07 12:27:05,862 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:27:05,863 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:27:05,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:27:05,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:27:05,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/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-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:27:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:27:05,904 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:27:05,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:27:05,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:27:05,906 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:27:06,276 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:27:06,276 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:27:06,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:06 BoogieIcfgContainer [2019-12-07 12:27:06,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:27:06,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:27:06,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:27:06,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:27:06,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:27:05" (1/3) ... [2019-12-07 12:27:06,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e66bf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:06, skipping insertion in model container [2019-12-07 12:27:06,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:27:05" (2/3) ... [2019-12-07 12:27:06,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e66bf4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:27:06, skipping insertion in model container [2019-12-07 12:27:06,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:06" (3/3) ... [2019-12-07 12:27:06,282 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_power.opt.i [2019-12-07 12:27:06,288 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:27:06,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:27:06,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:27:06,293 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,327 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,328 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,329 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,330 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,331 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,340 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:27:06,373 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:27:06,385 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:27:06,385 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:27:06,386 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:27:06,386 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:27:06,386 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:27:06,386 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:27:06,386 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:27:06,386 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:27:06,396 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-07 12:27:06,398 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:27:06,455 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:27:06,455 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:27:06,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:27:06,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-07 12:27:06,520 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-07 12:27:06,520 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:27:06,526 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 918 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 12:27:06,546 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 12:27:06,547 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:27:09,389 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 12:27:09,560 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 12:27:09,660 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123043 [2019-12-07 12:27:09,661 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 12:27:09,663 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 128 transitions [2019-12-07 12:27:10,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23592 states. [2019-12-07 12:27:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 23592 states. [2019-12-07 12:27:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 12:27:10,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:10,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 12:27:10,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:10,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:10,825 INFO L82 PathProgramCache]: Analyzing trace with hash 962357028, now seen corresponding path program 1 times [2019-12-07 12:27:10,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:10,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302328312] [2019-12-07 12:27:10,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:10,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302328312] [2019-12-07 12:27:10,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:10,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:27:10,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836105270] [2019-12-07 12:27:10,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:10,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:10,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:10,996 INFO L87 Difference]: Start difference. First operand 23592 states. Second operand 3 states. [2019-12-07 12:27:11,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:11,277 INFO L93 Difference]: Finished difference Result 23438 states and 83922 transitions. [2019-12-07 12:27:11,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:11,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 12:27:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:11,409 INFO L225 Difference]: With dead ends: 23438 [2019-12-07 12:27:11,409 INFO L226 Difference]: Without dead ends: 21828 [2019-12-07 12:27:11,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 12:27:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21828 states. [2019-12-07 12:27:12,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21828 to 21828. [2019-12-07 12:27:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21828 states. [2019-12-07 12:27:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21828 states to 21828 states and 78096 transitions. [2019-12-07 12:27:12,248 INFO L78 Accepts]: Start accepts. Automaton has 21828 states and 78096 transitions. Word has length 5 [2019-12-07 12:27:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:12,248 INFO L462 AbstractCegarLoop]: Abstraction has 21828 states and 78096 transitions. [2019-12-07 12:27:12,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:12,248 INFO L276 IsEmpty]: Start isEmpty. Operand 21828 states and 78096 transitions. [2019-12-07 12:27:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:27:12,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:12,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:12,252 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:12,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:12,252 INFO L82 PathProgramCache]: Analyzing trace with hash -549370662, now seen corresponding path program 1 times [2019-12-07 12:27:12,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:12,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231763919] [2019-12-07 12:27:12,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:12,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231763919] [2019-12-07 12:27:12,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:12,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:12,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565450930] [2019-12-07 12:27:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:12,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:12,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:12,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:12,323 INFO L87 Difference]: Start difference. First operand 21828 states and 78096 transitions. Second operand 4 states. [2019-12-07 12:27:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:12,783 INFO L93 Difference]: Finished difference Result 34804 states and 119015 transitions. [2019-12-07 12:27:12,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:12,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:27:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:12,955 INFO L225 Difference]: With dead ends: 34804 [2019-12-07 12:27:12,955 INFO L226 Difference]: Without dead ends: 34788 [2019-12-07 12:27:12,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 12:27:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-07 12:27:13,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 33965. [2019-12-07 12:27:13,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-12-07 12:27:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 116837 transitions. [2019-12-07 12:27:13,862 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 116837 transitions. Word has length 11 [2019-12-07 12:27:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:13,862 INFO L462 AbstractCegarLoop]: Abstraction has 33965 states and 116837 transitions. [2019-12-07 12:27:13,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 116837 transitions. [2019-12-07 12:27:13,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:27:13,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:13,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:13,865 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:13,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:13,866 INFO L82 PathProgramCache]: Analyzing trace with hash -779218677, now seen corresponding path program 1 times [2019-12-07 12:27:13,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:13,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59024307] [2019-12-07 12:27:13,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:13,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:13,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59024307] [2019-12-07 12:27:13,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:13,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:13,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639261627] [2019-12-07 12:27:13,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:13,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:13,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:13,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:13,910 INFO L87 Difference]: Start difference. First operand 33965 states and 116837 transitions. Second operand 4 states. [2019-12-07 12:27:14,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:14,191 INFO L93 Difference]: Finished difference Result 44062 states and 148933 transitions. [2019-12-07 12:27:14,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:14,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:27:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:14,280 INFO L225 Difference]: With dead ends: 44062 [2019-12-07 12:27:14,280 INFO L226 Difference]: Without dead ends: 44047 [2019-12-07 12:27:14,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 12:27:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44047 states. [2019-12-07 12:27:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44047 to 39221. [2019-12-07 12:27:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39221 states. [2019-12-07 12:27:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39221 states to 39221 states and 134004 transitions. [2019-12-07 12:27:15,195 INFO L78 Accepts]: Start accepts. Automaton has 39221 states and 134004 transitions. Word has length 14 [2019-12-07 12:27:15,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:15,196 INFO L462 AbstractCegarLoop]: Abstraction has 39221 states and 134004 transitions. [2019-12-07 12:27:15,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:15,196 INFO L276 IsEmpty]: Start isEmpty. Operand 39221 states and 134004 transitions. [2019-12-07 12:27:15,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:27:15,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:15,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:15,199 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:15,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1614053436, now seen corresponding path program 1 times [2019-12-07 12:27:15,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:15,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211875164] [2019-12-07 12:27:15,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:15,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211875164] [2019-12-07 12:27:15,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:15,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:15,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034607173] [2019-12-07 12:27:15,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:15,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:15,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:15,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:15,228 INFO L87 Difference]: Start difference. First operand 39221 states and 134004 transitions. Second operand 3 states. [2019-12-07 12:27:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:15,462 INFO L93 Difference]: Finished difference Result 64200 states and 209661 transitions. [2019-12-07 12:27:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:15,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 12:27:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:15,566 INFO L225 Difference]: With dead ends: 64200 [2019-12-07 12:27:15,567 INFO L226 Difference]: Without dead ends: 64200 [2019-12-07 12:27:15,567 INFO L630 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-12-07 12:27:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64200 states. [2019-12-07 12:27:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64200 to 57180. [2019-12-07 12:27:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-12-07 12:27:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 189699 transitions. [2019-12-07 12:27:16,870 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 189699 transitions. Word has length 15 [2019-12-07 12:27:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:16,870 INFO L462 AbstractCegarLoop]: Abstraction has 57180 states and 189699 transitions. [2019-12-07 12:27:16,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 189699 transitions. [2019-12-07 12:27:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:27:16,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:16,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:16,874 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:16,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:16,875 INFO L82 PathProgramCache]: Analyzing trace with hash -223387027, now seen corresponding path program 1 times [2019-12-07 12:27:16,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:16,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960077898] [2019-12-07 12:27:16,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:16,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960077898] [2019-12-07 12:27:16,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:16,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:16,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089092958] [2019-12-07 12:27:16,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:16,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:16,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:16,932 INFO L87 Difference]: Start difference. First operand 57180 states and 189699 transitions. Second operand 4 states. [2019-12-07 12:27:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:16,973 INFO L93 Difference]: Finished difference Result 9360 states and 25413 transitions. [2019-12-07 12:27:16,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:27:16,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:27:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:16,979 INFO L225 Difference]: With dead ends: 9360 [2019-12-07 12:27:16,979 INFO L226 Difference]: Without dead ends: 5784 [2019-12-07 12:27:16,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 12:27:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2019-12-07 12:27:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2019-12-07 12:27:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5784 states. [2019-12-07 12:27:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 13603 transitions. [2019-12-07 12:27:17,031 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 13603 transitions. Word has length 16 [2019-12-07 12:27:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:17,031 INFO L462 AbstractCegarLoop]: Abstraction has 5784 states and 13603 transitions. [2019-12-07 12:27:17,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 13603 transitions. [2019-12-07 12:27:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 12:27:17,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:17,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:17,032 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:17,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:17,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1852908680, now seen corresponding path program 1 times [2019-12-07 12:27:17,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:17,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014607222] [2019-12-07 12:27:17,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:17,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014607222] [2019-12-07 12:27:17,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:17,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:17,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687688191] [2019-12-07 12:27:17,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:17,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:17,076 INFO L87 Difference]: Start difference. First operand 5784 states and 13603 transitions. Second operand 4 states. [2019-12-07 12:27:17,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:17,272 INFO L93 Difference]: Finished difference Result 7282 states and 16815 transitions. [2019-12-07 12:27:17,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:17,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 12:27:17,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:17,278 INFO L225 Difference]: With dead ends: 7282 [2019-12-07 12:27:17,278 INFO L226 Difference]: Without dead ends: 7254 [2019-12-07 12:27:17,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 12:27:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7254 states. [2019-12-07 12:27:17,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7254 to 5763. [2019-12-07 12:27:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-12-07 12:27:17,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 13545 transitions. [2019-12-07 12:27:17,339 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 13545 transitions. Word has length 17 [2019-12-07 12:27:17,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:17,340 INFO L462 AbstractCegarLoop]: Abstraction has 5763 states and 13545 transitions. [2019-12-07 12:27:17,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:17,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 13545 transitions. [2019-12-07 12:27:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:27:17,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:17,343 INFO L410 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] [2019-12-07 12:27:17,343 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:17,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1652760743, now seen corresponding path program 1 times [2019-12-07 12:27:17,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:17,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616827819] [2019-12-07 12:27:17,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:17,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616827819] [2019-12-07 12:27:17,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:17,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:17,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811137463] [2019-12-07 12:27:17,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:17,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:17,404 INFO L87 Difference]: Start difference. First operand 5763 states and 13545 transitions. Second operand 5 states. [2019-12-07 12:27:17,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:17,670 INFO L93 Difference]: Finished difference Result 7869 states and 17987 transitions. [2019-12-07 12:27:17,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:27:17,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:27:17,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:17,676 INFO L225 Difference]: With dead ends: 7869 [2019-12-07 12:27:17,676 INFO L226 Difference]: Without dead ends: 7868 [2019-12-07 12:27:17,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:17,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7868 states. [2019-12-07 12:27:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7868 to 7238. [2019-12-07 12:27:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7238 states. [2019-12-07 12:27:17,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7238 states to 7238 states and 16736 transitions. [2019-12-07 12:27:17,751 INFO L78 Accepts]: Start accepts. Automaton has 7238 states and 16736 transitions. Word has length 28 [2019-12-07 12:27:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:17,751 INFO L462 AbstractCegarLoop]: Abstraction has 7238 states and 16736 transitions. [2019-12-07 12:27:17,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7238 states and 16736 transitions. [2019-12-07 12:27:17,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:27:17,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:17,755 INFO L410 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] [2019-12-07 12:27:17,755 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:17,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:17,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1044355322, now seen corresponding path program 1 times [2019-12-07 12:27:17,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:17,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531144060] [2019-12-07 12:27:17,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:17,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:17,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531144060] [2019-12-07 12:27:17,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:17,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:17,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024299341] [2019-12-07 12:27:17,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:17,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:17,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:17,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:17,779 INFO L87 Difference]: Start difference. First operand 7238 states and 16736 transitions. Second operand 3 states. [2019-12-07 12:27:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:17,831 INFO L93 Difference]: Finished difference Result 7743 states and 16952 transitions. [2019-12-07 12:27:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:17,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:27:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:17,837 INFO L225 Difference]: With dead ends: 7743 [2019-12-07 12:27:17,837 INFO L226 Difference]: Without dead ends: 7743 [2019-12-07 12:27:17,837 INFO L630 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-12-07 12:27:17,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7743 states. [2019-12-07 12:27:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7743 to 7211. [2019-12-07 12:27:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-12-07 12:27:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 15844 transitions. [2019-12-07 12:27:17,908 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 15844 transitions. Word has length 31 [2019-12-07 12:27:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:17,908 INFO L462 AbstractCegarLoop]: Abstraction has 7211 states and 15844 transitions. [2019-12-07 12:27:17,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 15844 transitions. [2019-12-07 12:27:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:27:17,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:17,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:17,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 525279466, now seen corresponding path program 1 times [2019-12-07 12:27:17,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:17,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129557435] [2019-12-07 12:27:17,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:17,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:17,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129557435] [2019-12-07 12:27:17,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:17,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:27:17,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798963087] [2019-12-07 12:27:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:17,952 INFO L87 Difference]: Start difference. First operand 7211 states and 15844 transitions. Second operand 3 states. [2019-12-07 12:27:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:17,971 INFO L93 Difference]: Finished difference Result 7105 states and 15616 transitions. [2019-12-07 12:27:17,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:17,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:27:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:17,977 INFO L225 Difference]: With dead ends: 7105 [2019-12-07 12:27:17,977 INFO L226 Difference]: Without dead ends: 7105 [2019-12-07 12:27:17,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 12:27:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2019-12-07 12:27:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 7105. [2019-12-07 12:27:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7105 states. [2019-12-07 12:27:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 15616 transitions. [2019-12-07 12:27:18,044 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 15616 transitions. Word has length 33 [2019-12-07 12:27:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:18,044 INFO L462 AbstractCegarLoop]: Abstraction has 7105 states and 15616 transitions. [2019-12-07 12:27:18,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 15616 transitions. [2019-12-07 12:27:18,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 12:27:18,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:18,049 INFO L410 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] [2019-12-07 12:27:18,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:18,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:18,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1333269799, now seen corresponding path program 1 times [2019-12-07 12:27:18,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:18,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118158818] [2019-12-07 12:27:18,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:18,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:18,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118158818] [2019-12-07 12:27:18,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:18,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:18,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917916295] [2019-12-07 12:27:18,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:18,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:18,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:18,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:18,099 INFO L87 Difference]: Start difference. First operand 7105 states and 15616 transitions. Second operand 5 states. [2019-12-07 12:27:18,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:18,350 INFO L93 Difference]: Finished difference Result 7988 states and 17297 transitions. [2019-12-07 12:27:18,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:27:18,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 12:27:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:18,356 INFO L225 Difference]: With dead ends: 7988 [2019-12-07 12:27:18,356 INFO L226 Difference]: Without dead ends: 7987 [2019-12-07 12:27:18,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:27:18,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7987 states. [2019-12-07 12:27:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7987 to 6266. [2019-12-07 12:27:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6266 states. [2019-12-07 12:27:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 13920 transitions. [2019-12-07 12:27:18,420 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 13920 transitions. Word has length 34 [2019-12-07 12:27:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:18,420 INFO L462 AbstractCegarLoop]: Abstraction has 6266 states and 13920 transitions. [2019-12-07 12:27:18,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 13920 transitions. [2019-12-07 12:27:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 12:27:18,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:18,426 INFO L410 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] [2019-12-07 12:27:18,426 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:18,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 135630366, now seen corresponding path program 1 times [2019-12-07 12:27:18,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:18,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137796368] [2019-12-07 12:27:18,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:18,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137796368] [2019-12-07 12:27:18,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:18,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:27:18,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932489984] [2019-12-07 12:27:18,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:27:18,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:18,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:27:18,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:27:18,461 INFO L87 Difference]: Start difference. First operand 6266 states and 13920 transitions. Second operand 3 states. [2019-12-07 12:27:18,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:18,481 INFO L93 Difference]: Finished difference Result 6266 states and 13770 transitions. [2019-12-07 12:27:18,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:27:18,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 12:27:18,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:18,486 INFO L225 Difference]: With dead ends: 6266 [2019-12-07 12:27:18,486 INFO L226 Difference]: Without dead ends: 6266 [2019-12-07 12:27:18,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 12:27:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2019-12-07 12:27:18,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6136. [2019-12-07 12:27:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6136 states. [2019-12-07 12:27:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6136 states to 6136 states and 13512 transitions. [2019-12-07 12:27:18,543 INFO L78 Accepts]: Start accepts. Automaton has 6136 states and 13512 transitions. Word has length 41 [2019-12-07 12:27:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:18,543 INFO L462 AbstractCegarLoop]: Abstraction has 6136 states and 13512 transitions. [2019-12-07 12:27:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:27:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 6136 states and 13512 transitions. [2019-12-07 12:27:18,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:27:18,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:18,549 INFO L410 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] [2019-12-07 12:27:18,549 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:18,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -73517057, now seen corresponding path program 1 times [2019-12-07 12:27:18,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:18,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380788462] [2019-12-07 12:27:18,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:18,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380788462] [2019-12-07 12:27:18,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:18,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:27:18,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121309090] [2019-12-07 12:27:18,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:27:18,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:18,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:27:18,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:27:18,739 INFO L87 Difference]: Start difference. First operand 6136 states and 13512 transitions. Second operand 11 states. [2019-12-07 12:27:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:19,629 INFO L93 Difference]: Finished difference Result 8072 states and 17698 transitions. [2019-12-07 12:27:19,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 12:27:19,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 12:27:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:19,643 INFO L225 Difference]: With dead ends: 8072 [2019-12-07 12:27:19,643 INFO L226 Difference]: Without dead ends: 7676 [2019-12-07 12:27:19,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:27:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7676 states. [2019-12-07 12:27:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7676 to 7511. [2019-12-07 12:27:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7511 states. [2019-12-07 12:27:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7511 states to 7511 states and 16539 transitions. [2019-12-07 12:27:19,716 INFO L78 Accepts]: Start accepts. Automaton has 7511 states and 16539 transitions. Word has length 42 [2019-12-07 12:27:19,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:19,716 INFO L462 AbstractCegarLoop]: Abstraction has 7511 states and 16539 transitions. [2019-12-07 12:27:19,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:27:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7511 states and 16539 transitions. [2019-12-07 12:27:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:27:19,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:19,723 INFO L410 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] [2019-12-07 12:27:19,723 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash -915744505, now seen corresponding path program 1 times [2019-12-07 12:27:19,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:19,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840010671] [2019-12-07 12:27:19,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:19,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840010671] [2019-12-07 12:27:19,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:19,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:27:19,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839765456] [2019-12-07 12:27:19,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:19,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:19,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:19,773 INFO L87 Difference]: Start difference. First operand 7511 states and 16539 transitions. Second operand 5 states. [2019-12-07 12:27:19,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:19,802 INFO L93 Difference]: Finished difference Result 4902 states and 10897 transitions. [2019-12-07 12:27:19,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:19,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 12:27:19,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:19,806 INFO L225 Difference]: With dead ends: 4902 [2019-12-07 12:27:19,806 INFO L226 Difference]: Without dead ends: 4648 [2019-12-07 12:27:19,806 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12-07 12:27:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2019-12-07 12:27:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3793. [2019-12-07 12:27:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3793 states. [2019-12-07 12:27:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 8468 transitions. [2019-12-07 12:27:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 8468 transitions. Word has length 43 [2019-12-07 12:27:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:19,854 INFO L462 AbstractCegarLoop]: Abstraction has 3793 states and 8468 transitions. [2019-12-07 12:27:19,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 8468 transitions. [2019-12-07 12:27:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:27:19,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:19,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:19,858 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash 879996346, now seen corresponding path program 1 times [2019-12-07 12:27:19,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:19,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255777379] [2019-12-07 12:27:19,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:19,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255777379] [2019-12-07 12:27:19,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:19,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:27:19,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140695075] [2019-12-07 12:27:19,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:19,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:19,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:19,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:19,925 INFO L87 Difference]: Start difference. First operand 3793 states and 8468 transitions. Second operand 4 states. [2019-12-07 12:27:20,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:20,051 INFO L93 Difference]: Finished difference Result 4087 states and 8972 transitions. [2019-12-07 12:27:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:27:20,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:27:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:20,054 INFO L225 Difference]: With dead ends: 4087 [2019-12-07 12:27:20,054 INFO L226 Difference]: Without dead ends: 4087 [2019-12-07 12:27:20,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4087 states. [2019-12-07 12:27:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4087 to 3951. [2019-12-07 12:27:20,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-12-07 12:27:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 8696 transitions. [2019-12-07 12:27:20,088 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 8696 transitions. Word has length 59 [2019-12-07 12:27:20,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:20,088 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 8696 transitions. [2019-12-07 12:27:20,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:20,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 8696 transitions. [2019-12-07 12:27:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:27:20,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:20,093 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:20,093 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1460301056, now seen corresponding path program 2 times [2019-12-07 12:27:20,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:20,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664910628] [2019-12-07 12:27:20,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:20,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664910628] [2019-12-07 12:27:20,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:20,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:27:20,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023899466] [2019-12-07 12:27:20,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:27:20,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:27:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:27:20,230 INFO L87 Difference]: Start difference. First operand 3951 states and 8696 transitions. Second operand 11 states. [2019-12-07 12:27:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,000 INFO L93 Difference]: Finished difference Result 6736 states and 14703 transitions. [2019-12-07 12:27:21,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 12:27:21,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 12:27:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,009 INFO L225 Difference]: With dead ends: 6736 [2019-12-07 12:27:21,009 INFO L226 Difference]: Without dead ends: 6592 [2019-12-07 12:27:21,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:27:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2019-12-07 12:27:21,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 5680. [2019-12-07 12:27:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5680 states. [2019-12-07 12:27:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5680 states to 5680 states and 12542 transitions. [2019-12-07 12:27:21,073 INFO L78 Accepts]: Start accepts. Automaton has 5680 states and 12542 transitions. Word has length 59 [2019-12-07 12:27:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,074 INFO L462 AbstractCegarLoop]: Abstraction has 5680 states and 12542 transitions. [2019-12-07 12:27:21,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:27:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5680 states and 12542 transitions. [2019-12-07 12:27:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:27:21,079 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,079 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 610981762, now seen corresponding path program 3 times [2019-12-07 12:27:21,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:21,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693957341] [2019-12-07 12:27:21,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:21,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693957341] [2019-12-07 12:27:21,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:27:21,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410895884] [2019-12-07 12:27:21,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:27:21,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:21,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:27:21,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:27:21,139 INFO L87 Difference]: Start difference. First operand 5680 states and 12542 transitions. Second operand 8 states. [2019-12-07 12:27:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,382 INFO L93 Difference]: Finished difference Result 9823 states and 21600 transitions. [2019-12-07 12:27:21,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:27:21,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-07 12:27:21,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,389 INFO L225 Difference]: With dead ends: 9823 [2019-12-07 12:27:21,389 INFO L226 Difference]: Without dead ends: 9071 [2019-12-07 12:27:21,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:27:21,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9071 states. [2019-12-07 12:27:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9071 to 7560. [2019-12-07 12:27:21,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7560 states. [2019-12-07 12:27:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 16921 transitions. [2019-12-07 12:27:21,474 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 16921 transitions. Word has length 59 [2019-12-07 12:27:21,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,474 INFO L462 AbstractCegarLoop]: Abstraction has 7560 states and 16921 transitions. [2019-12-07 12:27:21,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:27:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 16921 transitions. [2019-12-07 12:27:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:27:21,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,482 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,482 INFO L82 PathProgramCache]: Analyzing trace with hash 326528728, now seen corresponding path program 4 times [2019-12-07 12:27:21,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:21,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958837772] [2019-12-07 12:27:21,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,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-12-07 12:27:21,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958837772] [2019-12-07 12:27:21,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:27:21,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794674979] [2019-12-07 12:27:21,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:27:21,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:27:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:27:21,538 INFO L87 Difference]: Start difference. First operand 7560 states and 16921 transitions. Second operand 4 states. [2019-12-07 12:27:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,576 INFO L93 Difference]: Finished difference Result 8088 states and 18049 transitions. [2019-12-07 12:27:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:21,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:27:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,582 INFO L225 Difference]: With dead ends: 8088 [2019-12-07 12:27:21,582 INFO L226 Difference]: Without dead ends: 7458 [2019-12-07 12:27:21,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 12:27:21,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2019-12-07 12:27:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6857. [2019-12-07 12:27:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6857 states. [2019-12-07 12:27:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6857 states to 6857 states and 15224 transitions. [2019-12-07 12:27:21,648 INFO L78 Accepts]: Start accepts. Automaton has 6857 states and 15224 transitions. Word has length 59 [2019-12-07 12:27:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,648 INFO L462 AbstractCegarLoop]: Abstraction has 6857 states and 15224 transitions. [2019-12-07 12:27:21,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:27:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 6857 states and 15224 transitions. [2019-12-07 12:27:21,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:27:21,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,655 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,655 INFO L82 PathProgramCache]: Analyzing trace with hash 868826946, now seen corresponding path program 5 times [2019-12-07 12:27:21,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:21,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545921378] [2019-12-07 12:27:21,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:21,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545921378] [2019-12-07 12:27:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:27:21,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315203429] [2019-12-07 12:27:21,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:27:21,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:27:21,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:27:21,719 INFO L87 Difference]: Start difference. First operand 6857 states and 15224 transitions. Second operand 5 states. [2019-12-07 12:27:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:21,753 INFO L93 Difference]: Finished difference Result 7382 states and 16347 transitions. [2019-12-07 12:27:21,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:27:21,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-12-07 12:27:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:21,754 INFO L225 Difference]: With dead ends: 7382 [2019-12-07 12:27:21,754 INFO L226 Difference]: Without dead ends: 585 [2019-12-07 12:27:21,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:27:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-12-07 12:27:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-12-07 12:27:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-12-07 12:27:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1201 transitions. [2019-12-07 12:27:21,759 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1201 transitions. Word has length 59 [2019-12-07 12:27:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:21,759 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 1201 transitions. [2019-12-07 12:27:21,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:27:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1201 transitions. [2019-12-07 12:27:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:27:21,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:21,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:21,760 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1561092922, now seen corresponding path program 1 times [2019-12-07 12:27:21,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:21,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857277052] [2019-12-07 12:27:21,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:27:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:27:21,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857277052] [2019-12-07 12:27:21,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:27:21,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:27:21,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656423866] [2019-12-07 12:27:21,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:27:21,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:27:21,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:27:21,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:27:21,890 INFO L87 Difference]: Start difference. First operand 585 states and 1201 transitions. Second operand 12 states. [2019-12-07 12:27:22,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:27:22,407 INFO L93 Difference]: Finished difference Result 1090 states and 2188 transitions. [2019-12-07 12:27:22,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:27:22,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-07 12:27:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:27:22,408 INFO L225 Difference]: With dead ends: 1090 [2019-12-07 12:27:22,408 INFO L226 Difference]: Without dead ends: 783 [2019-12-07 12:27:22,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-12-07 12:27:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-12-07 12:27:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 601. [2019-12-07 12:27:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-07 12:27:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1231 transitions. [2019-12-07 12:27:22,413 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1231 transitions. Word has length 60 [2019-12-07 12:27:22,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:27:22,414 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1231 transitions. [2019-12-07 12:27:22,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:27:22,414 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1231 transitions. [2019-12-07 12:27:22,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 12:27:22,414 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:27:22,414 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:27:22,415 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:27:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:27:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash -328419130, now seen corresponding path program 2 times [2019-12-07 12:27:22,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:27:22,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996342708] [2019-12-07 12:27:22,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:27:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:27:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:27:22,502 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:27:22,502 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:27:22,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t0~0.base_34| 4)) (= v_~__unbuffered_p1_EBX~0_50 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t0~0.base_34|) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34|) 0) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34|) |v_ULTIMATE.start_main_~#t0~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd2~0_438) (= |v_ULTIMATE.start_main_~#t0~0.offset_24| 0) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34| 1) |v_#valid_57|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_24|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ~y~0=v_~y~0_47, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_34|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t0~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t0~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:27:22,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1~0.base_12|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_12| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-07 12:27:22,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 12:27:22,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1054205833 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1054205833 256)))) (or (and (= ~x$w_buff1~0_In1054205833 |P1Thread1of1ForFork1_#t~ite28_Out1054205833|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff0~0_In1054205833 |P1Thread1of1ForFork1_#t~ite28_Out1054205833|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1054205833, ~x$w_buff1~0=~x$w_buff1~0_In1054205833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1054205833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1054205833} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1054205833, ~x$w_buff1~0=~x$w_buff1~0_In1054205833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1054205833, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1054205833|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1054205833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:27:22,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:27:22,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:27:22,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1900978352 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out-1900978352| ~x~0_In-1900978352)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out-1900978352| ~x$mem_tmp~0_In-1900978352) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1900978352, ~x$mem_tmp~0=~x$mem_tmp~0_In-1900978352, ~x~0=~x~0_In-1900978352} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1900978352, ~x$mem_tmp~0=~x$mem_tmp~0_In-1900978352, ~x~0=~x~0_In-1900978352, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1900978352|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:27:22,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1278240355 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1278240355 256)))) (or (and (= ~x$w_buff0_used~0_In1278240355 |P1Thread1of1ForFork1_#t~ite51_Out1278240355|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out1278240355|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278240355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278240355} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1278240355|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278240355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278240355} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:27:22,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-220670553 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-220670553 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-220670553 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-220670553 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-220670553|)) (and (= ~x$w_buff1_used~0_In-220670553 |P1Thread1of1ForFork1_#t~ite52_Out-220670553|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-220670553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-220670553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-220670553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-220670553} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-220670553|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-220670553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-220670553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-220670553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-220670553} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:27:22,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1240823646 256))) (.cse0 (= ~x$r_buff0_thd2~0_In1240823646 ~x$r_buff0_thd2~0_Out1240823646)) (.cse2 (= (mod ~x$w_buff0_used~0_In1240823646 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1240823646)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1240823646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240823646} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1240823646|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1240823646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240823646} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:27:22,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1903062835 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1903062835 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1903062835 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1903062835 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out1903062835| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite54_Out1903062835| ~x$r_buff1_thd2~0_In1903062835) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1903062835, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1903062835, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1903062835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903062835} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1903062835, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1903062835, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1903062835|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1903062835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903062835} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:27:22,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:27:22,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In897069285 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out897069285| ~x$mem_tmp~0_In897069285)) (and .cse0 (= ~x~0_In897069285 |P0Thread1of1ForFork0_#t~ite25_Out897069285|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In897069285, ~x$mem_tmp~0=~x$mem_tmp~0_In897069285, ~x~0=~x~0_In897069285} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out897069285|, ~x$flush_delayed~0=~x$flush_delayed~0_In897069285, ~x$mem_tmp~0=~x$mem_tmp~0_In897069285, ~x~0=~x~0_In897069285} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:27:22,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:27:22,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:27:22,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-983054893| |ULTIMATE.start_main_#t~ite57_Out-983054893|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-983054893 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-983054893 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-983054893 |ULTIMATE.start_main_#t~ite57_Out-983054893|) .cse2) (and (= |ULTIMATE.start_main_#t~ite57_Out-983054893| ~x~0_In-983054893) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-983054893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-983054893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-983054893, ~x~0=~x~0_In-983054893} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-983054893, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-983054893|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-983054893|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-983054893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-983054893, ~x~0=~x~0_In-983054893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:27:22,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1349663545 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1349663545 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1349663545 |ULTIMATE.start_main_#t~ite59_Out-1349663545|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1349663545|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1349663545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1349663545} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1349663545, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1349663545|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1349663545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:27:22,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1724519294 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1724519294 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1724519294 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1724519294 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1724519294 |ULTIMATE.start_main_#t~ite60_Out-1724519294|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1724519294|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1724519294, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724519294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1724519294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724519294} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1724519294, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1724519294|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724519294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1724519294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724519294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:27:22,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-540892566 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-540892566 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-540892566|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-540892566 |ULTIMATE.start_main_#t~ite61_Out-540892566|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540892566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540892566} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540892566, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-540892566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540892566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:27:22,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In435213344 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In435213344 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In435213344 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In435213344 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In435213344 |ULTIMATE.start_main_#t~ite62_Out435213344|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out435213344|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435213344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435213344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435213344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435213344} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out435213344|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435213344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435213344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435213344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435213344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:27:22,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:27:22,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:27:22 BasicIcfg [2019-12-07 12:27:22,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:27:22,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:27:22,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:27:22,577 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:27:22,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:27:06" (3/4) ... [2019-12-07 12:27:22,579 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:27:22,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd1~0_264 0) (= 0 v_~x$w_buff0~0_204) (= v_~main$tmp_guard1~0_44 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t0~0.base_34| 4)) (= v_~__unbuffered_p1_EBX~0_50 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t0~0.base_34|) (= 0 v_~weak$$choice0~0_151) (= 0 v_~x$mem_tmp~0_161) (= 0 v_~x$w_buff1~0_194) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34|) 0) (= v_~__unbuffered_p0_EBX~0_54 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~x$w_buff1_used~0_447) (= 0 v_~x$w_buff0_used~0_844) (= 0 v_~x$r_buff1_thd2~0_308) (= v_~y~0_47 0) (= 0 v_~x~0_246) (= v_~x$r_buff1_thd0~0_211 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p0_EAX~0_71) (< 0 |v_#StackHeapBarrier_14|) (= v_~x$flush_delayed~0_185 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_69) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t0~0.base_34|) |v_ULTIMATE.start_main_~#t0~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~x$r_buff0_thd2~0_438) (= |v_ULTIMATE.start_main_~#t0~0.offset_24| 0) (= v_~weak$$choice2~0_232 0) (= 0 v_~x$r_buff0_thd0~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_34| 1) |v_#valid_57|) (= v_~x$r_buff0_thd1~0_297 0) (= 0 v_~__unbuffered_cnt~0_47))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_204, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_297, ~x$flush_delayed~0=v_~x$flush_delayed~0_185, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_16|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_264, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~x$mem_tmp~0=v_~x$mem_tmp~0_161, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_24|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_71, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_69, #length=|v_#length_19|, ~y~0=v_~y~0_47, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_98, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_50, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_54, ~x$w_buff1~0=v_~x$w_buff1~0_194, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_97|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_447, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_308, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_153|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_211, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_438, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_34|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_844, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_91|, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_23|, ~weak$$choice0~0=v_~weak$$choice0~0_151, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_117|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_31|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~weak$$choice2~0=v_~weak$$choice2~0_232, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_18|, ~x~0=v_~x~0_246, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t0~0.offset, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t0~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t1~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:27:22,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1~0.base_12|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_12| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12| 1)) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1~0.base_12|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-07 12:27:22,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~x$w_buff0_used~0_158) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~x$w_buff0_used~0_158 256))))) 1 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0~0_35) (= v_~x$w_buff1_used~0_84 v_~x$w_buff0_used~0_159) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~x$w_buff0~0_36 v_~x$w_buff1~0_51) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_36, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_159} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~x$w_buff1~0=v_~x$w_buff1~0_51, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_84, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 12:27:22,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1054205833 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1054205833 256)))) (or (and (= ~x$w_buff1~0_In1054205833 |P1Thread1of1ForFork1_#t~ite28_Out1054205833|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff0~0_In1054205833 |P1Thread1of1ForFork1_#t~ite28_Out1054205833|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1054205833, ~x$w_buff1~0=~x$w_buff1~0_In1054205833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1054205833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1054205833} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1054205833, ~x$w_buff1~0=~x$w_buff1~0_In1054205833, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1054205833, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1054205833|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1054205833} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:27:22,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L775-4-->L776: Formula: (= v_~x~0_72 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~x~0=v_~x~0_72, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~x~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 12:27:22,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~x$r_buff0_thd2~0_86 v_~x$r_buff0_thd2~0_85)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:27:22,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-1900978352 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite48_Out-1900978352| ~x~0_In-1900978352)) (and (= |P1Thread1of1ForFork1_#t~ite48_Out-1900978352| ~x$mem_tmp~0_In-1900978352) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1900978352, ~x$mem_tmp~0=~x$mem_tmp~0_In-1900978352, ~x~0=~x~0_In-1900978352} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In-1900978352, ~x$mem_tmp~0=~x$mem_tmp~0_In-1900978352, ~x~0=~x~0_In-1900978352, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1900978352|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 12:27:22,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1278240355 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1278240355 256)))) (or (and (= ~x$w_buff0_used~0_In1278240355 |P1Thread1of1ForFork1_#t~ite51_Out1278240355|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out1278240355|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278240355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278240355} OutVars{P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1278240355|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278240355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278240355} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 12:27:22,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L792-->L792-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-220670553 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-220670553 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-220670553 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-220670553 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite52_Out-220670553|)) (and (= ~x$w_buff1_used~0_In-220670553 |P1Thread1of1ForFork1_#t~ite52_Out-220670553|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-220670553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-220670553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-220670553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-220670553} OutVars{P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out-220670553|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-220670553, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-220670553, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-220670553, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-220670553} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 12:27:22,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1240823646 256))) (.cse0 (= ~x$r_buff0_thd2~0_In1240823646 ~x$r_buff0_thd2~0_Out1240823646)) (.cse2 (= (mod ~x$w_buff0_used~0_In1240823646 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1240823646)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1240823646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240823646} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1240823646|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1240823646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1240823646} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 12:27:22,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1903062835 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1903062835 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1903062835 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1903062835 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite54_Out1903062835| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite54_Out1903062835| ~x$r_buff1_thd2~0_In1903062835) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1903062835, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1903062835, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1903062835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903062835} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1903062835, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1903062835, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out1903062835|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1903062835, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903062835} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 12:27:22,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_117 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_117, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:27:22,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In897069285 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out897069285| ~x$mem_tmp~0_In897069285)) (and .cse0 (= ~x~0_In897069285 |P0Thread1of1ForFork0_#t~ite25_Out897069285|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In897069285, ~x$mem_tmp~0=~x$mem_tmp~0_In897069285, ~x~0=~x~0_In897069285} OutVars{P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out897069285|, ~x$flush_delayed~0=~x$flush_delayed~0_In897069285, ~x$mem_tmp~0=~x$mem_tmp~0_In897069285, ~x~0=~x~0_In897069285} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 12:27:22,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= v_~x$flush_delayed~0_78 0) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= |v_P0Thread1of1ForFork0_#t~ite25_18| v_~x~0_123)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~x~0=v_~x~0_123} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 12:27:22,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L819-->L821-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_30 256)) (= (mod v_~x$w_buff0_used~0_209 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_209} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:27:22,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [928] [928] L821-2-->L821-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-983054893| |ULTIMATE.start_main_#t~ite57_Out-983054893|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-983054893 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-983054893 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-983054893 |ULTIMATE.start_main_#t~ite57_Out-983054893|) .cse2) (and (= |ULTIMATE.start_main_#t~ite57_Out-983054893| ~x~0_In-983054893) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-983054893, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-983054893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-983054893, ~x~0=~x~0_In-983054893} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-983054893, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-983054893|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-983054893|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-983054893, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-983054893, ~x~0=~x~0_In-983054893} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 12:27:22,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1349663545 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1349663545 256) 0))) (or (and (= ~x$w_buff0_used~0_In-1349663545 |ULTIMATE.start_main_#t~ite59_Out-1349663545|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out-1349663545|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1349663545, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1349663545} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1349663545, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1349663545|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1349663545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:27:22,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1724519294 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1724519294 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1724519294 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1724519294 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1724519294 |ULTIMATE.start_main_#t~ite60_Out-1724519294|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite60_Out-1724519294|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1724519294, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724519294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1724519294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724519294} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1724519294, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1724519294|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1724519294, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1724519294, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1724519294} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 12:27:22,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [939] [939] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-540892566 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-540892566 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out-540892566|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-540892566 |ULTIMATE.start_main_#t~ite61_Out-540892566|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540892566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540892566} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-540892566, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-540892566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-540892566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:27:22,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In435213344 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In435213344 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In435213344 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In435213344 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd0~0_In435213344 |ULTIMATE.start_main_#t~ite62_Out435213344|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out435213344|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435213344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435213344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435213344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435213344} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out435213344|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In435213344, ~x$w_buff1_used~0=~x$w_buff1_used~0_In435213344, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In435213344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In435213344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:27:22,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_21 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite62_50|) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_27 0) (= 1 v_~__unbuffered_p1_EAX~0_38) (= v_~__unbuffered_p0_EBX~0_31 0))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_50|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_49|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:27:22,661 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e90b3496-50fa-4e75-9cb4-c4213fbbaa76/bin/uautomizer/witness.graphml [2019-12-07 12:27:22,661 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:27:22,662 INFO L168 Benchmark]: Toolchain (without parser) took 17250.04 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 939.8 MB in the beginning and 740.3 MB in the end (delta: 199.5 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,663 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:27:22,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,663 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:27:22,664 INFO L168 Benchmark]: Boogie Preprocessor took 25.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,664 INFO L168 Benchmark]: RCFGBuilder took 414.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,664 INFO L168 Benchmark]: TraceAbstraction took 16298.94 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 929.6 MB). Free memory was 1.0 GB in the beginning and 785.5 MB in the end (delta: 218.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,665 INFO L168 Benchmark]: Witness Printer took 84.39 ms. Allocated memory is still 2.1 GB. Free memory was 785.5 MB in the beginning and 740.3 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:27:22,667 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.8 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 414.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16298.94 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 929.6 MB). Free memory was 1.0 GB in the beginning and 785.5 MB in the end (delta: 218.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 84.39 ms. Allocated memory is still 2.1 GB. Free memory was 785.5 MB in the beginning and 740.3 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 179 ProgramPointsBefore, 104 ProgramPointsAfterwards, 228 TransitionsBefore, 128 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9002 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 297 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 123043 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 x$flush_delayed = weak$$choice2 [L774] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0] [L775] 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=0] [L776] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L778] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x = x$flush_delayed ? x$mem_tmp : x [L784] 2 x$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 y = 1 [L732] 1 __unbuffered_p0_EAX = y [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1] [L739] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L739] 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) [L740] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 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)) [L741] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 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)) [L742] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 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)) [L743] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L743] 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)) [L744] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 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)) [L745] 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=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L745] 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)) [L746] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, 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=1] [L821] 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) [L822] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 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 [L824] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.1s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3993 SDtfs, 4390 SDslu, 9457 SDs, 0 SdLazy, 4431 SolverSat, 227 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 32 SyntacticMatches, 9 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57180occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 21535 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 181316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...