./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.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_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/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 7b5d7369926368b2e5be55a7d8f704223c826e06 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:26:57,658 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:26:57,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:26:57,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:26:57,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:26:57,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:26:57,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:26:57,670 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:26:57,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:26:57,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:26:57,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:26:57,673 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:26:57,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:26:57,674 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:26:57,675 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:26:57,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:26:57,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:26:57,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:26:57,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:26:57,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:26:57,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:26:57,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:26:57,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:26:57,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:26:57,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:26:57,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:26:57,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:26:57,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:26:57,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:26:57,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:26:57,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:26:57,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:26:57,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:26:57,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:26:57,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:26:57,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:26:57,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:26:57,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:26:57,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:26:57,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:26:57,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:26:57,689 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:26:57,699 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:26:57,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:26:57,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:26:57,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:26:57,700 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:26:57,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:26:57,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:26:57,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:26:57,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:26:57,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:26:57,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:26:57,703 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_cfbc224c-147a-4c17-8c90-71504be0d00a/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 -> 7b5d7369926368b2e5be55a7d8f704223c826e06 [2019-12-07 13:26:57,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:26:57,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:26:57,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:26:57,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:26:57,814 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:26:57,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-12-07 13:26:57,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/data/8f98be70a/8c0fcfd6e34640e99396f1e97c893510/FLAG38f0959e4 [2019-12-07 13:26:58,220 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:26:58,221 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-12-07 13:26:58,231 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/data/8f98be70a/8c0fcfd6e34640e99396f1e97c893510/FLAG38f0959e4 [2019-12-07 13:26:58,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/data/8f98be70a/8c0fcfd6e34640e99396f1e97c893510 [2019-12-07 13:26:58,242 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:26:58,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:26:58,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:26:58,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:26:58,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:26:58,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58, skipping insertion in model container [2019-12-07 13:26:58,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:26:58,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:26:58,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:26:58,536 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:26:58,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:26:58,624 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:26:58,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58 WrapperNode [2019-12-07 13:26:58,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:26:58,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:26:58,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:26:58,625 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:26:58,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,644 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:26:58,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:26:58,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:26:58,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:26:58,671 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... [2019-12-07 13:26:58,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:26:58,690 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:26:58,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:26:58,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:26:58,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/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 13:26:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:26:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:26:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:26:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:26:58,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:26:58,738 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:26:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:26:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:26:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:26:58,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:26:58,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:26:58,741 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 13:26:59,096 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:26:59,096 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:26:59,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:26:59 BoogieIcfgContainer [2019-12-07 13:26:59,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:26:59,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:26:59,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:26:59,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:26:59,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:26:58" (1/3) ... [2019-12-07 13:26:59,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c7d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:26:59, skipping insertion in model container [2019-12-07 13:26:59,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:26:58" (2/3) ... [2019-12-07 13:26:59,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c7d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:26:59, skipping insertion in model container [2019-12-07 13:26:59,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:26:59" (3/3) ... [2019-12-07 13:26:59,101 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-12-07 13:26:59,107 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:26:59,108 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:26:59,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:26:59,113 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,146 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,147 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,148 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:26:59,166 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:26:59,179 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:26:59,179 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:26:59,179 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:26:59,179 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:26:59,179 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:26:59,179 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:26:59,179 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:26:59,179 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:26:59,190 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-12-07 13:26:59,191 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 13:26:59,240 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 13:26:59,241 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:26:59,249 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:26:59,259 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-12-07 13:26:59,286 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-12-07 13:26:59,286 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:26:59,290 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:26:59,299 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:26:59,300 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:27:02,225 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 13:27:02,329 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-12-07 13:27:02,329 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-12-07 13:27:02,331 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-12-07 13:27:02,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 13:27:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 13:27:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:27:02,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:02,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:27:02,640 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:02,644 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-12-07 13:27:02,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:02,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043339502] [2019-12-07 13:27:02,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:02,776 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 13:27:02,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043339502] [2019-12-07 13:27:02,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:02,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:27:02,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654475734] [2019-12-07 13:27:02,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:02,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:02,794 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 13:27:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:02,991 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-12-07 13:27:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:02,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:27:02,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:03,055 INFO L225 Difference]: With dead ends: 8472 [2019-12-07 13:27:03,056 INFO L226 Difference]: Without dead ends: 7980 [2019-12-07 13:27:03,056 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 13:27:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-12-07 13:27:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-12-07 13:27:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-12-07 13:27:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-12-07 13:27:03,330 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-12-07 13:27:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:03,331 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-12-07 13:27:03,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-12-07 13:27:03,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:27:03,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:03,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:03,334 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-12-07 13:27:03,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:03,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834075610] [2019-12-07 13:27:03,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:03,413 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 13:27:03,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834075610] [2019-12-07 13:27:03,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:03,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:27:03,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492281626] [2019-12-07 13:27:03,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:03,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:03,415 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 4 states. [2019-12-07 13:27:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:03,687 INFO L93 Difference]: Finished difference Result 12172 states and 38421 transitions. [2019-12-07 13:27:03,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:03,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:27:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:03,750 INFO L225 Difference]: With dead ends: 12172 [2019-12-07 13:27:03,750 INFO L226 Difference]: Without dead ends: 12165 [2019-12-07 13:27:03,751 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 13:27:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-07 13:27:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10976. [2019-12-07 13:27:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10976 states. [2019-12-07 13:27:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 35289 transitions. [2019-12-07 13:27:04,060 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 35289 transitions. Word has length 11 [2019-12-07 13:27:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:04,061 INFO L462 AbstractCegarLoop]: Abstraction has 10976 states and 35289 transitions. [2019-12-07 13:27:04,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 35289 transitions. [2019-12-07 13:27:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:27:04,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:04,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:04,066 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-12-07 13:27:04,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:04,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617142705] [2019-12-07 13:27:04,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:04,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:04,104 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 13:27:04,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617142705] [2019-12-07 13:27:04,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:04,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:04,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982047682] [2019-12-07 13:27:04,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:04,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:04,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:04,106 INFO L87 Difference]: Start difference. First operand 10976 states and 35289 transitions. Second operand 3 states. [2019-12-07 13:27:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:04,212 INFO L93 Difference]: Finished difference Result 16162 states and 51860 transitions. [2019-12-07 13:27:04,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:04,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 13:27:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:04,273 INFO L225 Difference]: With dead ends: 16162 [2019-12-07 13:27:04,273 INFO L226 Difference]: Without dead ends: 16162 [2019-12-07 13:27:04,273 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 13:27:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16162 states. [2019-12-07 13:27:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16162 to 12780. [2019-12-07 13:27:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12780 states. [2019-12-07 13:27:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12780 states to 12780 states and 41531 transitions. [2019-12-07 13:27:04,531 INFO L78 Accepts]: Start accepts. Automaton has 12780 states and 41531 transitions. Word has length 14 [2019-12-07 13:27:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:04,532 INFO L462 AbstractCegarLoop]: Abstraction has 12780 states and 41531 transitions. [2019-12-07 13:27:04,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 12780 states and 41531 transitions. [2019-12-07 13:27:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:27:04,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:04,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:04,534 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-12-07 13:27:04,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:04,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561165988] [2019-12-07 13:27:04,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:04,588 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 13:27:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561165988] [2019-12-07 13:27:04,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:04,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:27:04,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031660429] [2019-12-07 13:27:04,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:04,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:04,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:04,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:04,589 INFO L87 Difference]: Start difference. First operand 12780 states and 41531 transitions. Second operand 4 states. [2019-12-07 13:27:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:04,738 INFO L93 Difference]: Finished difference Result 15429 states and 49294 transitions. [2019-12-07 13:27:04,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:04,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:27:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:04,768 INFO L225 Difference]: With dead ends: 15429 [2019-12-07 13:27:04,768 INFO L226 Difference]: Without dead ends: 15429 [2019-12-07 13:27:04,768 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 13:27:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-07 13:27:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14033. [2019-12-07 13:27:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-12-07 13:27:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 45307 transitions. [2019-12-07 13:27:05,030 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 45307 transitions. Word has length 14 [2019-12-07 13:27:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:05,030 INFO L462 AbstractCegarLoop]: Abstraction has 14033 states and 45307 transitions. [2019-12-07 13:27:05,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 45307 transitions. [2019-12-07 13:27:05,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:27:05,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:05,032 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:05,033 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-12-07 13:27:05,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:05,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773836431] [2019-12-07 13:27:05,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:05,068 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 13:27:05,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773836431] [2019-12-07 13:27:05,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:05,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:27:05,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825437594] [2019-12-07 13:27:05,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:05,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:05,070 INFO L87 Difference]: Start difference. First operand 14033 states and 45307 transitions. Second operand 4 states. [2019-12-07 13:27:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:05,224 INFO L93 Difference]: Finished difference Result 16676 states and 53317 transitions. [2019-12-07 13:27:05,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:05,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:27:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:05,246 INFO L225 Difference]: With dead ends: 16676 [2019-12-07 13:27:05,246 INFO L226 Difference]: Without dead ends: 16676 [2019-12-07 13:27:05,247 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 13:27:05,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2019-12-07 13:27:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 14306. [2019-12-07 13:27:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14306 states. [2019-12-07 13:27:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14306 states to 14306 states and 46219 transitions. [2019-12-07 13:27:05,493 INFO L78 Accepts]: Start accepts. Automaton has 14306 states and 46219 transitions. Word has length 14 [2019-12-07 13:27:05,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:05,493 INFO L462 AbstractCegarLoop]: Abstraction has 14306 states and 46219 transitions. [2019-12-07 13:27:05,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:05,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14306 states and 46219 transitions. [2019-12-07 13:27:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:27:05,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:05,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:05,496 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:05,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:05,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1305033028, now seen corresponding path program 1 times [2019-12-07 13:27:05,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:05,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872138650] [2019-12-07 13:27:05,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:05,543 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 13:27:05,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872138650] [2019-12-07 13:27:05,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:05,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:27:05,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325177375] [2019-12-07 13:27:05,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:05,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:05,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:05,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:05,544 INFO L87 Difference]: Start difference. First operand 14306 states and 46219 transitions. Second operand 3 states. [2019-12-07 13:27:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:05,587 INFO L93 Difference]: Finished difference Result 13528 states and 43047 transitions. [2019-12-07 13:27:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:05,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:27:05,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:05,605 INFO L225 Difference]: With dead ends: 13528 [2019-12-07 13:27:05,605 INFO L226 Difference]: Without dead ends: 13528 [2019-12-07 13:27:05,605 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 13:27:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2019-12-07 13:27:05,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 13448. [2019-12-07 13:27:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13448 states. [2019-12-07 13:27:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13448 states to 13448 states and 42815 transitions. [2019-12-07 13:27:05,803 INFO L78 Accepts]: Start accepts. Automaton has 13448 states and 42815 transitions. Word has length 16 [2019-12-07 13:27:05,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:05,804 INFO L462 AbstractCegarLoop]: Abstraction has 13448 states and 42815 transitions. [2019-12-07 13:27:05,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 13448 states and 42815 transitions. [2019-12-07 13:27:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:27:05,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:05,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:27:05,807 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1252676989, now seen corresponding path program 1 times [2019-12-07 13:27:05,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:05,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138598179] [2019-12-07 13:27:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:05,840 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 13:27:05,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138598179] [2019-12-07 13:27:05,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:05,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:27:05,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784677388] [2019-12-07 13:27:05,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:27:05,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:05,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:27:05,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:27:05,842 INFO L87 Difference]: Start difference. First operand 13448 states and 42815 transitions. Second operand 3 states. [2019-12-07 13:27:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:05,851 INFO L93 Difference]: Finished difference Result 1752 states and 4007 transitions. [2019-12-07 13:27:05,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:05,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:27:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:05,853 INFO L225 Difference]: With dead ends: 1752 [2019-12-07 13:27:05,854 INFO L226 Difference]: Without dead ends: 1752 [2019-12-07 13:27:05,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:27:05,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-07 13:27:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-12-07 13:27:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-12-07 13:27:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4007 transitions. [2019-12-07 13:27:05,874 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4007 transitions. Word has length 16 [2019-12-07 13:27:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:05,875 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4007 transitions. [2019-12-07 13:27:05,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:27:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4007 transitions. [2019-12-07 13:27:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:27:05,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:05,877 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] [2019-12-07 13:27:05,877 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-12-07 13:27:05,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:05,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867117729] [2019-12-07 13:27:05,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:05,928 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 13:27:05,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867117729] [2019-12-07 13:27:05,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:05,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:05,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736044514] [2019-12-07 13:27:05,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:05,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:05,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:05,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:05,930 INFO L87 Difference]: Start difference. First operand 1752 states and 4007 transitions. Second operand 5 states. [2019-12-07 13:27:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:06,099 INFO L93 Difference]: Finished difference Result 2261 states and 5020 transitions. [2019-12-07 13:27:06,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:27:06,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:27:06,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:06,101 INFO L225 Difference]: With dead ends: 2261 [2019-12-07 13:27:06,101 INFO L226 Difference]: Without dead ends: 2261 [2019-12-07 13:27:06,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 13:27:06,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-12-07 13:27:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1820. [2019-12-07 13:27:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-12-07 13:27:06,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4147 transitions. [2019-12-07 13:27:06,119 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4147 transitions. Word has length 25 [2019-12-07 13:27:06,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:06,119 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4147 transitions. [2019-12-07 13:27:06,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4147 transitions. [2019-12-07 13:27:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:27:06,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:06,121 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] [2019-12-07 13:27:06,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:06,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-12-07 13:27:06,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:06,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072596614] [2019-12-07 13:27:06,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:06,172 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 13:27:06,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072596614] [2019-12-07 13:27:06,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:06,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:06,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152639124] [2019-12-07 13:27:06,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:06,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:06,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:06,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:06,173 INFO L87 Difference]: Start difference. First operand 1820 states and 4147 transitions. Second operand 5 states. [2019-12-07 13:27:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:06,324 INFO L93 Difference]: Finished difference Result 2275 states and 5049 transitions. [2019-12-07 13:27:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:27:06,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:27:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:06,326 INFO L225 Difference]: With dead ends: 2275 [2019-12-07 13:27:06,326 INFO L226 Difference]: Without dead ends: 2275 [2019-12-07 13:27:06,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 13:27:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-12-07 13:27:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1766. [2019-12-07 13:27:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-12-07 13:27:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4036 transitions. [2019-12-07 13:27:06,341 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4036 transitions. Word has length 26 [2019-12-07 13:27:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:06,342 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4036 transitions. [2019-12-07 13:27:06,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4036 transitions. [2019-12-07 13:27:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:27:06,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:06,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] [2019-12-07 13:27:06,344 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash 898927989, now seen corresponding path program 1 times [2019-12-07 13:27:06,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:06,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511000206] [2019-12-07 13:27:06,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:06,376 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 13:27:06,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511000206] [2019-12-07 13:27:06,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:06,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:06,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011565405] [2019-12-07 13:27:06,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:06,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:06,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:06,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:06,377 INFO L87 Difference]: Start difference. First operand 1766 states and 4036 transitions. Second operand 4 states. [2019-12-07 13:27:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:06,386 INFO L93 Difference]: Finished difference Result 859 states and 1946 transitions. [2019-12-07 13:27:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:06,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 13:27:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:06,387 INFO L225 Difference]: With dead ends: 859 [2019-12-07 13:27:06,387 INFO L226 Difference]: Without dead ends: 859 [2019-12-07 13:27:06,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 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 13:27:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-12-07 13:27:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2019-12-07 13:27:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-12-07 13:27:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1946 transitions. [2019-12-07 13:27:06,395 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1946 transitions. Word has length 27 [2019-12-07 13:27:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:06,395 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1946 transitions. [2019-12-07 13:27:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1946 transitions. [2019-12-07 13:27:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:27:06,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:06,397 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] [2019-12-07 13:27:06,397 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1144531918, now seen corresponding path program 1 times [2019-12-07 13:27:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:06,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022262571] [2019-12-07 13:27:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:06,488 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 13:27:06,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022262571] [2019-12-07 13:27:06,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:06,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:27:06,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716905151] [2019-12-07 13:27:06,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:06,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:06,489 INFO L87 Difference]: Start difference. First operand 859 states and 1946 transitions. Second operand 7 states. [2019-12-07 13:27:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:06,707 INFO L93 Difference]: Finished difference Result 2533 states and 5646 transitions. [2019-12-07 13:27:06,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:27:06,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:27:06,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:06,708 INFO L225 Difference]: With dead ends: 2533 [2019-12-07 13:27:06,708 INFO L226 Difference]: Without dead ends: 1727 [2019-12-07 13:27:06,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 13:27:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2019-12-07 13:27:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 957. [2019-12-07 13:27:06,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-07 13:27:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 2172 transitions. [2019-12-07 13:27:06,719 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 2172 transitions. Word has length 52 [2019-12-07 13:27:06,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:06,719 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 2172 transitions. [2019-12-07 13:27:06,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:06,719 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 2172 transitions. [2019-12-07 13:27:06,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:27:06,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:06,721 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] [2019-12-07 13:27:06,721 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -896850810, now seen corresponding path program 2 times [2019-12-07 13:27:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:06,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777172459] [2019-12-07 13:27:06,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:06,858 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 13:27:06,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777172459] [2019-12-07 13:27:06,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:06,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:27:06,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743785636] [2019-12-07 13:27:06,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:27:06,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:06,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:27:06,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:27:06,860 INFO L87 Difference]: Start difference. First operand 957 states and 2172 transitions. Second operand 9 states. [2019-12-07 13:27:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:07,377 INFO L93 Difference]: Finished difference Result 1463 states and 3193 transitions. [2019-12-07 13:27:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:27:07,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2019-12-07 13:27:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:07,379 INFO L225 Difference]: With dead ends: 1463 [2019-12-07 13:27:07,379 INFO L226 Difference]: Without dead ends: 1463 [2019-12-07 13:27:07,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:27:07,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2019-12-07 13:27:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1061. [2019-12-07 13:27:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-12-07 13:27:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 2344 transitions. [2019-12-07 13:27:07,388 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 2344 transitions. Word has length 52 [2019-12-07 13:27:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:07,388 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 2344 transitions. [2019-12-07 13:27:07,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:27:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 2344 transitions. [2019-12-07 13:27:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:27:07,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:07,390 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] [2019-12-07 13:27:07,390 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash 241436152, now seen corresponding path program 3 times [2019-12-07 13:27:07,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:07,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371718708] [2019-12-07 13:27:07,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:27:07,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371718708] [2019-12-07 13:27:07,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:07,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:07,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840385869] [2019-12-07 13:27:07,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:07,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:07,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:07,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:07,463 INFO L87 Difference]: Start difference. First operand 1061 states and 2344 transitions. Second operand 5 states. [2019-12-07 13:27:07,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:07,481 INFO L93 Difference]: Finished difference Result 1745 states and 3829 transitions. [2019-12-07 13:27:07,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:07,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 13:27:07,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:07,482 INFO L225 Difference]: With dead ends: 1745 [2019-12-07 13:27:07,482 INFO L226 Difference]: Without dead ends: 723 [2019-12-07 13:27:07,482 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 13:27:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-07 13:27:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2019-12-07 13:27:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-12-07 13:27:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 1555 transitions. [2019-12-07 13:27:07,488 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 1555 transitions. Word has length 52 [2019-12-07 13:27:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:07,488 INFO L462 AbstractCegarLoop]: Abstraction has 723 states and 1555 transitions. [2019-12-07 13:27:07,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 1555 transitions. [2019-12-07 13:27:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:27:07,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:07,489 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] [2019-12-07 13:27:07,489 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:07,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:07,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1643675972, now seen corresponding path program 4 times [2019-12-07 13:27:07,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:07,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827220529] [2019-12-07 13:27:07,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:07,540 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 13:27:07,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827220529] [2019-12-07 13:27:07,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:07,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:27:07,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261052518] [2019-12-07 13:27:07,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:07,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:07,542 INFO L87 Difference]: Start difference. First operand 723 states and 1555 transitions. Second operand 4 states. [2019-12-07 13:27:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:07,580 INFO L93 Difference]: Finished difference Result 887 states and 1883 transitions. [2019-12-07 13:27:07,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:27:07,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:27:07,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:07,581 INFO L225 Difference]: With dead ends: 887 [2019-12-07 13:27:07,581 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 13:27:07,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 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 13:27:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 13:27:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 737. [2019-12-07 13:27:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-07 13:27:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1586 transitions. [2019-12-07 13:27:07,588 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1586 transitions. Word has length 52 [2019-12-07 13:27:07,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:07,588 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1586 transitions. [2019-12-07 13:27:07,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1586 transitions. [2019-12-07 13:27:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:27:07,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:07,589 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] [2019-12-07 13:27:07,589 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash -122108504, now seen corresponding path program 1 times [2019-12-07 13:27:07,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:07,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132887092] [2019-12-07 13:27:07,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:07,619 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 13:27:07,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132887092] [2019-12-07 13:27:07,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:07,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:07,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156398431] [2019-12-07 13:27:07,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:27:07,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:27:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:27:07,621 INFO L87 Difference]: Start difference. First operand 737 states and 1586 transitions. Second operand 4 states. [2019-12-07 13:27:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:07,730 INFO L93 Difference]: Finished difference Result 1216 states and 2615 transitions. [2019-12-07 13:27:07,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:27:07,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-07 13:27:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:07,732 INFO L225 Difference]: With dead ends: 1216 [2019-12-07 13:27:07,732 INFO L226 Difference]: Without dead ends: 1216 [2019-12-07 13:27:07,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:07,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2019-12-07 13:27:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 812. [2019-12-07 13:27:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2019-12-07 13:27:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1771 transitions. [2019-12-07 13:27:07,740 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1771 transitions. Word has length 53 [2019-12-07 13:27:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:07,740 INFO L462 AbstractCegarLoop]: Abstraction has 812 states and 1771 transitions. [2019-12-07 13:27:07,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:27:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1771 transitions. [2019-12-07 13:27:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:27:07,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:07,741 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] [2019-12-07 13:27:07,741 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:07,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:07,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1190562228, now seen corresponding path program 1 times [2019-12-07 13:27:07,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:07,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050324554] [2019-12-07 13:27:07,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:07,786 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 13:27:07,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050324554] [2019-12-07 13:27:07,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:07,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:07,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568008042] [2019-12-07 13:27:07,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:07,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:07,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:07,787 INFO L87 Difference]: Start difference. First operand 812 states and 1771 transitions. Second operand 5 states. [2019-12-07 13:27:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:07,924 INFO L93 Difference]: Finished difference Result 947 states and 2028 transitions. [2019-12-07 13:27:07,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:27:07,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 13:27:07,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:07,925 INFO L225 Difference]: With dead ends: 947 [2019-12-07 13:27:07,925 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 13:27:07,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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 13:27:07,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 13:27:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 865. [2019-12-07 13:27:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 865 states. [2019-12-07 13:27:07,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1868 transitions. [2019-12-07 13:27:07,932 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1868 transitions. Word has length 53 [2019-12-07 13:27:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:07,932 INFO L462 AbstractCegarLoop]: Abstraction has 865 states and 1868 transitions. [2019-12-07 13:27:07,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1868 transitions. [2019-12-07 13:27:07,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:27:07,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:07,934 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] [2019-12-07 13:27:07,934 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:07,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:07,934 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 1 times [2019-12-07 13:27:07,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:07,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731744864] [2019-12-07 13:27:07,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:08,052 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 13:27:08,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731744864] [2019-12-07 13:27:08,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:08,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:27:08,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957379961] [2019-12-07 13:27:08,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:27:08,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:27:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:27:08,054 INFO L87 Difference]: Start difference. First operand 865 states and 1868 transitions. Second operand 7 states. [2019-12-07 13:27:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:08,226 INFO L93 Difference]: Finished difference Result 2168 states and 4511 transitions. [2019-12-07 13:27:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:27:08,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 13:27:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:08,227 INFO L225 Difference]: With dead ends: 2168 [2019-12-07 13:27:08,227 INFO L226 Difference]: Without dead ends: 1766 [2019-12-07 13:27:08,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:27:08,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2019-12-07 13:27:08,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 860. [2019-12-07 13:27:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-12-07 13:27:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1855 transitions. [2019-12-07 13:27:08,237 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1855 transitions. Word has length 53 [2019-12-07 13:27:08,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:08,238 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1855 transitions. [2019-12-07 13:27:08,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:27:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1855 transitions. [2019-12-07 13:27:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:27:08,239 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:08,239 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] [2019-12-07 13:27:08,239 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 2 times [2019-12-07 13:27:08,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:08,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274377518] [2019-12-07 13:27:08,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:27:08,301 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 13:27:08,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274377518] [2019-12-07 13:27:08,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:27:08,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:27:08,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483682882] [2019-12-07 13:27:08,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:27:08,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:27:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:27:08,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:27:08,303 INFO L87 Difference]: Start difference. First operand 860 states and 1855 transitions. Second operand 5 states. [2019-12-07 13:27:08,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:27:08,365 INFO L93 Difference]: Finished difference Result 860 states and 1840 transitions. [2019-12-07 13:27:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:27:08,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-07 13:27:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:27:08,366 INFO L225 Difference]: With dead ends: 860 [2019-12-07 13:27:08,366 INFO L226 Difference]: Without dead ends: 860 [2019-12-07 13:27:08,366 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 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 13:27:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-12-07 13:27:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 721. [2019-12-07 13:27:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-12-07 13:27:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1538 transitions. [2019-12-07 13:27:08,373 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1538 transitions. Word has length 53 [2019-12-07 13:27:08,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:27:08,373 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 1538 transitions. [2019-12-07 13:27:08,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:27:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1538 transitions. [2019-12-07 13:27:08,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:27:08,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:27:08,374 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] [2019-12-07 13:27:08,375 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:27:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:27:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 1 times [2019-12-07 13:27:08,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:27:08,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475823743] [2019-12-07 13:27:08,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:27:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:27:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:27:08,439 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:27:08,439 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:27:08,442 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_23|) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35|) |v_ULTIMATE.start_main_~#t845~0.offset_23| 0)) |v_#memory_int_13|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t845~0.base_35| 4) |v_#length_15|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t845~0.base_35|) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_23|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_35|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:27:08,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0~0_Out-1642829414) (= |P0Thread1of1ForFork0_#in~arg.base_In-1642829414| P0Thread1of1ForFork0_~arg.base_Out-1642829414) (= ~a$w_buff0_used~0_Out-1642829414 1) (= ~a$w_buff1~0_Out-1642829414 ~a$w_buff0~0_In-1642829414) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1642829414 256))) (not (= 0 (mod ~a$w_buff0_used~0_Out-1642829414 256))))) 1 0)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1642829414| P0Thread1of1ForFork0_~arg.offset_Out-1642829414) (= ~a$w_buff1_used~0_Out-1642829414 ~a$w_buff0_used~0_In-1642829414) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1642829414|, ~a$w_buff0~0=~a$w_buff0~0_In-1642829414, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1642829414|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1642829414} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1642829414|, ~a$w_buff1~0=~a$w_buff1~0_Out-1642829414, ~a$w_buff0~0=~a$w_buff0~0_Out-1642829414, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1642829414|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1642829414, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1642829414, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1642829414, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1642829414} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:27:08,443 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-12-07 13:27:08,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-860221677 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-860221677| |P1Thread1of1ForFork1_#t~ite24_Out-860221677|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-860221677 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-860221677 256))) (and (= (mod ~a$w_buff1_used~0_In-860221677 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-860221677 256) 0))) (= ~a$w_buff1_used~0_In-860221677 |P1Thread1of1ForFork1_#t~ite23_Out-860221677|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In-860221677| |P1Thread1of1ForFork1_#t~ite23_Out-860221677|) (= ~a$w_buff1_used~0_In-860221677 |P1Thread1of1ForFork1_#t~ite24_Out-860221677|) (not .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-860221677, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-860221677|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-860221677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-860221677, ~weak$$choice2~0=~weak$$choice2~0_In-860221677} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-860221677|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-860221677|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-860221677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-860221677, ~weak$$choice2~0=~weak$$choice2~0_In-860221677} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:27:08,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:27:08,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In594522277 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In594522277 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In594522277 |P0Thread1of1ForFork0_#t~ite5_Out594522277|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out594522277| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In594522277, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In594522277} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out594522277|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In594522277, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In594522277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:27:08,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-948646407 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-948646407 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-948646407 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-948646407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-948646407|)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-948646407 |P0Thread1of1ForFork0_#t~ite6_Out-948646407|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-948646407, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-948646407, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-948646407, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-948646407} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-948646407|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-948646407, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-948646407, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-948646407, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-948646407} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:27:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In10251686 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In10251686 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In10251686 ~a$r_buff0_thd1~0_Out10251686))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~a$r_buff0_thd1~0_Out10251686)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In10251686, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In10251686} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out10251686|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In10251686, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out10251686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:27:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In-1598773937 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1598773937 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1598773937 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1598773937 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1598773937| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1598773937| ~a$r_buff1_thd1~0_In-1598773937)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1598773937, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1598773937, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1598773937, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1598773937} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1598773937, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1598773937|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1598773937, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1598773937, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1598773937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:27:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:27:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:27:08,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| |P1Thread1of1ForFork1_#t~ite33_Out444994081|)) (.cse1 (= (mod ~a$w_buff1_used~0_In444994081 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In444994081 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| ~a$w_buff1~0_In444994081) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| ~a~0_In444994081)))) InVars {~a~0=~a~0_In444994081, ~a$w_buff1~0=~a$w_buff1~0_In444994081, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In444994081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In444994081} OutVars{~a~0=~a~0_In444994081, ~a$w_buff1~0=~a$w_buff1~0_In444994081, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In444994081, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out444994081|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out444994081|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In444994081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:27:08,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In210411260 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In210411260 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In210411260 |P1Thread1of1ForFork1_#t~ite34_Out210411260|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out210411260|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210411260, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210411260} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out210411260|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210411260, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210411260} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:27:08,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In804833100 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In804833100 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In804833100 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In804833100 256) 0))) (or (and (= ~a$w_buff1_used~0_In804833100 |P1Thread1of1ForFork1_#t~ite35_Out804833100|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out804833100| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In804833100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In804833100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In804833100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804833100} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In804833100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In804833100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In804833100, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out804833100|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804833100} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:27:08,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1844030985 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1844030985 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1844030985 |P1Thread1of1ForFork1_#t~ite36_Out1844030985|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1844030985| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844030985, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844030985} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844030985, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844030985, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1844030985|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:27:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-480487749 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-480487749 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-480487749 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-480487749 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-480487749| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-480487749| ~a$r_buff1_thd2~0_In-480487749)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-480487749, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-480487749, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-480487749, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-480487749} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-480487749, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-480487749, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-480487749, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-480487749, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-480487749|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:27:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:27:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:27:08,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1545652568 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1545652568 256)))) (or (and (= ~a$w_buff1~0_In-1545652568 |ULTIMATE.start_main_#t~ite40_Out-1545652568|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In-1545652568 |ULTIMATE.start_main_#t~ite40_Out-1545652568|)))) InVars {~a~0=~a~0_In-1545652568, ~a$w_buff1~0=~a$w_buff1~0_In-1545652568, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1545652568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1545652568} OutVars{~a~0=~a~0_In-1545652568, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1545652568|, ~a$w_buff1~0=~a$w_buff1~0_In-1545652568, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1545652568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1545652568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:27:08,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:27:08,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1822384791 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1822384791 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1822384791|) (not .cse1)) (and (= ~a$w_buff0_used~0_In1822384791 |ULTIMATE.start_main_#t~ite42_Out1822384791|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1822384791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1822384791} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1822384791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1822384791, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1822384791|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:27:08,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1362480048 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1362480048 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1362480048 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1362480048 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1362480048| ~a$w_buff1_used~0_In-1362480048)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1362480048|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1362480048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362480048, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362480048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1362480048} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1362480048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362480048, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362480048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1362480048, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1362480048|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:27:08,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1938714862 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1938714862 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1938714862|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-1938714862 |ULTIMATE.start_main_#t~ite44_Out-1938714862|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1938714862, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1938714862} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1938714862, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1938714862, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1938714862|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:27:08,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1665736626 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1665736626 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1665736626 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1665736626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1665736626|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In1665736626 |ULTIMATE.start_main_#t~ite45_Out1665736626|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1665736626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665736626, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1665736626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665736626} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1665736626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665736626, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1665736626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665736626, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1665736626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:27:08,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:27:08,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:27:08 BasicIcfg [2019-12-07 13:27:08,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:27:08,497 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:27:08,497 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:27:08,497 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:27:08,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:26:59" (3/4) ... [2019-12-07 13:27:08,499 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:27:08,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_23|) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35|) |v_ULTIMATE.start_main_~#t845~0.offset_23| 0)) |v_#memory_int_13|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t845~0.base_35| 4) |v_#length_15|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t845~0.base_35|) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_23|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_35|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 13:27:08,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (= 1 ~a$w_buff0~0_Out-1642829414) (= |P0Thread1of1ForFork0_#in~arg.base_In-1642829414| P0Thread1of1ForFork0_~arg.base_Out-1642829414) (= ~a$w_buff0_used~0_Out-1642829414 1) (= ~a$w_buff1~0_Out-1642829414 ~a$w_buff0~0_In-1642829414) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414| (ite (not (and (not (= 0 (mod ~a$w_buff1_used~0_Out-1642829414 256))) (not (= 0 (mod ~a$w_buff0_used~0_Out-1642829414 256))))) 1 0)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1642829414| P0Thread1of1ForFork0_~arg.offset_Out-1642829414) (= ~a$w_buff1_used~0_Out-1642829414 ~a$w_buff0_used~0_In-1642829414) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1642829414|, ~a$w_buff0~0=~a$w_buff0~0_In-1642829414, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1642829414|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1642829414} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1642829414|, ~a$w_buff1~0=~a$w_buff1~0_Out-1642829414, ~a$w_buff0~0=~a$w_buff0~0_Out-1642829414, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1642829414, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1642829414|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1642829414, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1642829414, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1642829414, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1642829414|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1642829414} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 13:27:08,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-12-07 13:27:08,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-860221677 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-860221677| |P1Thread1of1ForFork1_#t~ite24_Out-860221677|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-860221677 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-860221677 256))) (and (= (mod ~a$w_buff1_used~0_In-860221677 256) 0) .cse1) (= (mod ~a$w_buff0_used~0_In-860221677 256) 0))) (= ~a$w_buff1_used~0_In-860221677 |P1Thread1of1ForFork1_#t~ite23_Out-860221677|)) (and (= |P1Thread1of1ForFork1_#t~ite23_In-860221677| |P1Thread1of1ForFork1_#t~ite23_Out-860221677|) (= ~a$w_buff1_used~0_In-860221677 |P1Thread1of1ForFork1_#t~ite24_Out-860221677|) (not .cse0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-860221677, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-860221677|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-860221677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-860221677, ~weak$$choice2~0=~weak$$choice2~0_In-860221677} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-860221677|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-860221677, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-860221677|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-860221677, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-860221677, ~weak$$choice2~0=~weak$$choice2~0_In-860221677} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-12-07 13:27:08,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:27:08,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In594522277 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In594522277 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In594522277 |P0Thread1of1ForFork0_#t~ite5_Out594522277|)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out594522277| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In594522277, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In594522277} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out594522277|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In594522277, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In594522277} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:27:08,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-948646407 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-948646407 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-948646407 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-948646407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-948646407|)) (and (or .cse2 .cse3) (= ~a$w_buff1_used~0_In-948646407 |P0Thread1of1ForFork0_#t~ite6_Out-948646407|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-948646407, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-948646407, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-948646407, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-948646407} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-948646407|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-948646407, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-948646407, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-948646407, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-948646407} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:27:08,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In10251686 256))) (.cse2 (= (mod ~a$r_buff0_thd1~0_In10251686 256) 0)) (.cse1 (= ~a$r_buff0_thd1~0_In10251686 ~a$r_buff0_thd1~0_Out10251686))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~a$r_buff0_thd1~0_Out10251686)) (and .cse2 .cse1))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In10251686, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In10251686} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out10251686|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In10251686, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out10251686} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:27:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd1~0_In-1598773937 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1598773937 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1598773937 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1598773937 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1598773937| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1598773937| ~a$r_buff1_thd1~0_In-1598773937)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1598773937, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1598773937, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1598773937, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1598773937} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1598773937, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1598773937|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1598773937, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1598773937, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1598773937} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:27:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:27:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 13:27:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| |P1Thread1of1ForFork1_#t~ite33_Out444994081|)) (.cse1 (= (mod ~a$w_buff1_used~0_In444994081 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In444994081 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| ~a$w_buff1~0_In444994081) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out444994081| ~a~0_In444994081)))) InVars {~a~0=~a~0_In444994081, ~a$w_buff1~0=~a$w_buff1~0_In444994081, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In444994081, ~a$w_buff1_used~0=~a$w_buff1_used~0_In444994081} OutVars{~a~0=~a~0_In444994081, ~a$w_buff1~0=~a$w_buff1~0_In444994081, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In444994081, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out444994081|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out444994081|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In444994081} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:27:08,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In210411260 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In210411260 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In210411260 |P1Thread1of1ForFork1_#t~ite34_Out210411260|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out210411260|) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210411260, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210411260} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out210411260|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In210411260, ~a$w_buff0_used~0=~a$w_buff0_used~0_In210411260} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:27:08,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In804833100 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In804833100 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In804833100 256))) (.cse3 (= (mod ~a$r_buff0_thd2~0_In804833100 256) 0))) (or (and (= ~a$w_buff1_used~0_In804833100 |P1Thread1of1ForFork1_#t~ite35_Out804833100|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out804833100| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In804833100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In804833100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In804833100, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804833100} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In804833100, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In804833100, ~a$w_buff0_used~0=~a$w_buff0_used~0_In804833100, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out804833100|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In804833100} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:27:08,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1844030985 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1844030985 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1844030985 |P1Thread1of1ForFork1_#t~ite36_Out1844030985|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1844030985| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844030985, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844030985} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1844030985, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1844030985, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1844030985|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:27:08,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-480487749 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-480487749 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-480487749 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-480487749 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-480487749| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-480487749| ~a$r_buff1_thd2~0_In-480487749)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-480487749, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-480487749, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-480487749, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-480487749} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-480487749, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-480487749, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-480487749, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-480487749, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-480487749|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:27:08,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:27:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:27:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1545652568 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1545652568 256)))) (or (and (= ~a$w_buff1~0_In-1545652568 |ULTIMATE.start_main_#t~ite40_Out-1545652568|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a~0_In-1545652568 |ULTIMATE.start_main_#t~ite40_Out-1545652568|)))) InVars {~a~0=~a~0_In-1545652568, ~a$w_buff1~0=~a$w_buff1~0_In-1545652568, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1545652568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1545652568} OutVars{~a~0=~a~0_In-1545652568, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1545652568|, ~a$w_buff1~0=~a$w_buff1~0_In-1545652568, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1545652568, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1545652568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:27:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:27:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1822384791 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1822384791 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1822384791|) (not .cse1)) (and (= ~a$w_buff0_used~0_In1822384791 |ULTIMATE.start_main_#t~ite42_Out1822384791|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1822384791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1822384791} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1822384791, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1822384791, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1822384791|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:27:08,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1362480048 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1362480048 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-1362480048 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1362480048 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1362480048| ~a$w_buff1_used~0_In-1362480048)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1362480048|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1362480048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362480048, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362480048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1362480048} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1362480048, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1362480048, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1362480048, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1362480048, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1362480048|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:27:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-1938714862 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1938714862 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1938714862|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-1938714862 |ULTIMATE.start_main_#t~ite44_Out-1938714862|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1938714862, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1938714862} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1938714862, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1938714862, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1938714862|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:27:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1665736626 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In1665736626 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In1665736626 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In1665736626 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1665736626|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~a$r_buff1_thd0~0_In1665736626 |ULTIMATE.start_main_#t~ite45_Out1665736626|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1665736626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665736626, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1665736626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665736626} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1665736626, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1665736626, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1665736626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1665736626, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1665736626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:27:08,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:27:08,558 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cfbc224c-147a-4c17-8c90-71504be0d00a/bin/uautomizer/witness.graphml [2019-12-07 13:27:08,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:27:08,559 INFO L168 Benchmark]: Toolchain (without parser) took 10316.32 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 658.5 MB). Free memory was 938.1 MB in the beginning and 1.4 GB in the end (delta: -468.9 MB). Peak memory consumption was 189.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,559 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:27:08,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,560 INFO L168 Benchmark]: Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:27:08,560 INFO L168 Benchmark]: RCFGBuilder took 406.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,561 INFO L168 Benchmark]: TraceAbstraction took 9399.20 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 510.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -375.5 MB). Peak memory consumption was 135.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,561 INFO L168 Benchmark]: Witness Printer took 61.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:27:08,562 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 406.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9399.20 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 510.7 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -375.5 MB). Peak memory consumption was 135.1 MB. Max. memory is 11.5 GB. * Witness Printer took 61.27 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t845, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((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, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2215 SDtfs, 2281 SDslu, 4459 SDs, 0 SdLazy, 2348 SolverSat, 114 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14306occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 12220 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 639 NumberOfCodeBlocks, 639 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 142592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...