./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/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 a4595ead9111b62c49e43af6996ad49c615c30c4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:01:04,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:01:04,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:01:04,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:01:04,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:01:04,114 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:01:04,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:01:04,116 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:01:04,118 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:01:04,118 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:01:04,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:01:04,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:01:04,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:01:04,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:01:04,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:01:04,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:01:04,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:01:04,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:01:04,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:01:04,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:01:04,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:01:04,127 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:01:04,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:01:04,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:01:04,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:01:04,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:01:04,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:01:04,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:01:04,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:01:04,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:01:04,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:01:04,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:01:04,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:01:04,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:01:04,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:01:04,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:01:04,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:01:04,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:01:04,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:01:04,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:01:04,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:01:04,136 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:01:04,145 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:01:04,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:01:04,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:01:04,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:01:04,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:01:04,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:01:04,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:01:04,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:01:04,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:01:04,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:01:04,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:01:04,150 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:01:04,150 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_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/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 -> a4595ead9111b62c49e43af6996ad49c615c30c4 [2019-12-07 18:01:04,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:01:04,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:01:04,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:01:04,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:01:04,259 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:01:04,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_pso.opt.i [2019-12-07 18:01:04,296 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/data/93532afd7/e5dfbaa48cf644bd8b8c087307dc7b90/FLAG2d42516bf [2019-12-07 18:01:04,819 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:01:04,820 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/sv-benchmarks/c/pthread-wmm/mix032_pso.opt.i [2019-12-07 18:01:04,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/data/93532afd7/e5dfbaa48cf644bd8b8c087307dc7b90/FLAG2d42516bf [2019-12-07 18:01:05,332 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/data/93532afd7/e5dfbaa48cf644bd8b8c087307dc7b90 [2019-12-07 18:01:05,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:01:05,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:01:05,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:01:05,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:01:05,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:01:05,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9096c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05, skipping insertion in model container [2019-12-07 18:01:05,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:01:05,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:01:05,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:01:05,634 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:01:05,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:01:05,722 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:01:05,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05 WrapperNode [2019-12-07 18:01:05,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:01:05,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:01:05,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:01:05,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:01:05,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:01:05,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:01:05,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:01:05,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:01:05,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... [2019-12-07 18:01:05,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:01:05,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:01:05,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:01:05,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:01:05,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/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 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:01:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:01:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:01:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:01:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:01:05,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:01:05,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:01:05,827 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 18:01:06,154 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:01:06,154 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:01:06,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:01:06 BoogieIcfgContainer [2019-12-07 18:01:06,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:01:06,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:01:06,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:01:06,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:01:06,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:01:05" (1/3) ... [2019-12-07 18:01:06,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e36f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:01:06, skipping insertion in model container [2019-12-07 18:01:06,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:01:05" (2/3) ... [2019-12-07 18:01:06,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c9e36f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:01:06, skipping insertion in model container [2019-12-07 18:01:06,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:01:06" (3/3) ... [2019-12-07 18:01:06,159 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_pso.opt.i [2019-12-07 18:01:06,165 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:01:06,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:01:06,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:01:06,170 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:01:06,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,197 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,197 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,214 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:01:06,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:01:06,246 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:01:06,246 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:01:06,246 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:01:06,246 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:01:06,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:01:06,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:01:06,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:01:06,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:01:06,257 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions [2019-12-07 18:01:06,258 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 18:01:06,317 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 18:01:06,317 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:01:06,328 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 18:01:06,339 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 156 places, 181 transitions [2019-12-07 18:01:06,370 INFO L134 PetriNetUnfolder]: 35/178 cut-off events. [2019-12-07 18:01:06,370 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:01:06,374 INFO L76 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 35/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 557 event pairs. 9/150 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-07 18:01:06,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-07 18:01:06,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:01:08,625 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 18:01:09,032 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:01:09,129 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50265 [2019-12-07 18:01:09,129 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 18:01:09,131 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-12-07 18:01:09,743 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14534 states. [2019-12-07 18:01:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states. [2019-12-07 18:01:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:01:09,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:09,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:09,749 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash 104230949, now seen corresponding path program 1 times [2019-12-07 18:01:09,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:09,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93691284] [2019-12-07 18:01:09,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:09,908 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 18:01:09,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93691284] [2019-12-07 18:01:09,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:09,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:01:09,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634671841] [2019-12-07 18:01:09,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:09,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:09,923 INFO L87 Difference]: Start difference. First operand 14534 states. Second operand 3 states. [2019-12-07 18:01:10,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:10,133 INFO L93 Difference]: Finished difference Result 14182 states and 55174 transitions. [2019-12-07 18:01:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:10,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:01:10,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:10,243 INFO L225 Difference]: With dead ends: 14182 [2019-12-07 18:01:10,243 INFO L226 Difference]: Without dead ends: 13350 [2019-12-07 18:01:10,244 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 18:01:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13350 states. [2019-12-07 18:01:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13350 to 13350. [2019-12-07 18:01:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13350 states. [2019-12-07 18:01:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13350 states to 13350 states and 51860 transitions. [2019-12-07 18:01:10,718 INFO L78 Accepts]: Start accepts. Automaton has 13350 states and 51860 transitions. Word has length 7 [2019-12-07 18:01:10,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:10,719 INFO L462 AbstractCegarLoop]: Abstraction has 13350 states and 51860 transitions. [2019-12-07 18:01:10,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 13350 states and 51860 transitions. [2019-12-07 18:01:10,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:01:10,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:10,723 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:10,723 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:10,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:10,724 INFO L82 PathProgramCache]: Analyzing trace with hash 27609139, now seen corresponding path program 1 times [2019-12-07 18:01:10,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561077776] [2019-12-07 18:01:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:10,787 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 18:01:10,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561077776] [2019-12-07 18:01:10,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:10,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:10,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103501771] [2019-12-07 18:01:10,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:10,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:10,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:10,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:10,789 INFO L87 Difference]: Start difference. First operand 13350 states and 51860 transitions. Second operand 4 states. [2019-12-07 18:01:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:11,041 INFO L93 Difference]: Finished difference Result 20194 states and 75632 transitions. [2019-12-07 18:01:11,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:01:11,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:01:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:11,098 INFO L225 Difference]: With dead ends: 20194 [2019-12-07 18:01:11,098 INFO L226 Difference]: Without dead ends: 20164 [2019-12-07 18:01:11,099 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 18:01:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20164 states. [2019-12-07 18:01:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20164 to 18344. [2019-12-07 18:01:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18344 states. [2019-12-07 18:01:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18344 states to 18344 states and 69695 transitions. [2019-12-07 18:01:11,553 INFO L78 Accepts]: Start accepts. Automaton has 18344 states and 69695 transitions. Word has length 13 [2019-12-07 18:01:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:11,554 INFO L462 AbstractCegarLoop]: Abstraction has 18344 states and 69695 transitions. [2019-12-07 18:01:11,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 18344 states and 69695 transitions. [2019-12-07 18:01:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:01:11,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:11,560 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:11,560 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1189360442, now seen corresponding path program 1 times [2019-12-07 18:01:11,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:11,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353078987] [2019-12-07 18:01:11,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:11,594 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 18:01:11,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353078987] [2019-12-07 18:01:11,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:11,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:11,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805790012] [2019-12-07 18:01:11,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:11,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:11,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:11,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:11,595 INFO L87 Difference]: Start difference. First operand 18344 states and 69695 transitions. Second operand 3 states. [2019-12-07 18:01:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:11,701 INFO L93 Difference]: Finished difference Result 23466 states and 87296 transitions. [2019-12-07 18:01:11,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:11,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:01:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:11,811 INFO L225 Difference]: With dead ends: 23466 [2019-12-07 18:01:11,811 INFO L226 Difference]: Without dead ends: 23466 [2019-12-07 18:01:11,811 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 18:01:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23466 states. [2019-12-07 18:01:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23466 to 20060. [2019-12-07 18:01:12,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20060 states. [2019-12-07 18:01:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20060 states to 20060 states and 75793 transitions. [2019-12-07 18:01:12,191 INFO L78 Accepts]: Start accepts. Automaton has 20060 states and 75793 transitions. Word has length 16 [2019-12-07 18:01:12,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:12,192 INFO L462 AbstractCegarLoop]: Abstraction has 20060 states and 75793 transitions. [2019-12-07 18:01:12,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20060 states and 75793 transitions. [2019-12-07 18:01:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:01:12,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:12,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:12,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1189225003, now seen corresponding path program 1 times [2019-12-07 18:01:12,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:12,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181321973] [2019-12-07 18:01:12,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:12,234 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 18:01:12,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181321973] [2019-12-07 18:01:12,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:12,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:12,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402303244] [2019-12-07 18:01:12,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:12,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:12,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:12,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:12,235 INFO L87 Difference]: Start difference. First operand 20060 states and 75793 transitions. Second operand 4 states. [2019-12-07 18:01:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:12,404 INFO L93 Difference]: Finished difference Result 24056 states and 89213 transitions. [2019-12-07 18:01:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:01:12,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:01:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:12,455 INFO L225 Difference]: With dead ends: 24056 [2019-12-07 18:01:12,455 INFO L226 Difference]: Without dead ends: 24036 [2019-12-07 18:01:12,455 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 18:01:12,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24036 states. [2019-12-07 18:01:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24036 to 21018. [2019-12-07 18:01:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21018 states. [2019-12-07 18:01:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21018 states to 21018 states and 79114 transitions. [2019-12-07 18:01:12,927 INFO L78 Accepts]: Start accepts. Automaton has 21018 states and 79114 transitions. Word has length 16 [2019-12-07 18:01:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:12,928 INFO L462 AbstractCegarLoop]: Abstraction has 21018 states and 79114 transitions. [2019-12-07 18:01:12,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 21018 states and 79114 transitions. [2019-12-07 18:01:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:01:12,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:12,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:12,933 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:12,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:12,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1055623133, now seen corresponding path program 1 times [2019-12-07 18:01:12,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:12,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870539859] [2019-12-07 18:01:12,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:12,979 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 18:01:12,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870539859] [2019-12-07 18:01:12,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:12,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:12,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568425640] [2019-12-07 18:01:12,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:12,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:12,981 INFO L87 Difference]: Start difference. First operand 21018 states and 79114 transitions. Second operand 4 states. [2019-12-07 18:01:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:13,164 INFO L93 Difference]: Finished difference Result 26444 states and 98339 transitions. [2019-12-07 18:01:13,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:01:13,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:01:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:13,216 INFO L225 Difference]: With dead ends: 26444 [2019-12-07 18:01:13,216 INFO L226 Difference]: Without dead ends: 26414 [2019-12-07 18:01:13,216 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 18:01:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26414 states. [2019-12-07 18:01:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26414 to 21928. [2019-12-07 18:01:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21928 states. [2019-12-07 18:01:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21928 states to 21928 states and 82711 transitions. [2019-12-07 18:01:13,698 INFO L78 Accepts]: Start accepts. Automaton has 21928 states and 82711 transitions. Word has length 16 [2019-12-07 18:01:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:13,698 INFO L462 AbstractCegarLoop]: Abstraction has 21928 states and 82711 transitions. [2019-12-07 18:01:13,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 21928 states and 82711 transitions. [2019-12-07 18:01:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:01:13,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:13,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:13,704 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:13,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2076093569, now seen corresponding path program 1 times [2019-12-07 18:01:13,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:13,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216267238] [2019-12-07 18:01:13,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:13,750 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 18:01:13,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216267238] [2019-12-07 18:01:13,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:13,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:13,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061576942] [2019-12-07 18:01:13,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:13,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:13,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:13,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:13,751 INFO L87 Difference]: Start difference. First operand 21928 states and 82711 transitions. Second operand 3 states. [2019-12-07 18:01:13,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:13,833 INFO L93 Difference]: Finished difference Result 20766 states and 77222 transitions. [2019-12-07 18:01:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:13,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:01:13,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:13,873 INFO L225 Difference]: With dead ends: 20766 [2019-12-07 18:01:13,873 INFO L226 Difference]: Without dead ends: 20766 [2019-12-07 18:01:13,873 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 18:01:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20766 states. [2019-12-07 18:01:14,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20766 to 20282. [2019-12-07 18:01:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20282 states. [2019-12-07 18:01:14,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20282 states to 20282 states and 75572 transitions. [2019-12-07 18:01:14,242 INFO L78 Accepts]: Start accepts. Automaton has 20282 states and 75572 transitions. Word has length 18 [2019-12-07 18:01:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:14,242 INFO L462 AbstractCegarLoop]: Abstraction has 20282 states and 75572 transitions. [2019-12-07 18:01:14,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 20282 states and 75572 transitions. [2019-12-07 18:01:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:01:14,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:14,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:14,246 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:14,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1546230613, now seen corresponding path program 1 times [2019-12-07 18:01:14,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:14,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498694847] [2019-12-07 18:01:14,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:14,296 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 18:01:14,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498694847] [2019-12-07 18:01:14,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:14,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:01:14,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97048033] [2019-12-07 18:01:14,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:14,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:14,297 INFO L87 Difference]: Start difference. First operand 20282 states and 75572 transitions. Second operand 3 states. [2019-12-07 18:01:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:14,417 INFO L93 Difference]: Finished difference Result 20378 states and 75774 transitions. [2019-12-07 18:01:14,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:14,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:01:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:14,451 INFO L225 Difference]: With dead ends: 20378 [2019-12-07 18:01:14,451 INFO L226 Difference]: Without dead ends: 20378 [2019-12-07 18:01:14,451 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 18:01:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20378 states. [2019-12-07 18:01:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20378 to 20279. [2019-12-07 18:01:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20279 states. [2019-12-07 18:01:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20279 states to 20279 states and 75560 transitions. [2019-12-07 18:01:14,799 INFO L78 Accepts]: Start accepts. Automaton has 20279 states and 75560 transitions. Word has length 18 [2019-12-07 18:01:14,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:14,799 INFO L462 AbstractCegarLoop]: Abstraction has 20279 states and 75560 transitions. [2019-12-07 18:01:14,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20279 states and 75560 transitions. [2019-12-07 18:01:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:01:14,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:14,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:14,804 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:14,804 INFO L82 PathProgramCache]: Analyzing trace with hash 876364753, now seen corresponding path program 1 times [2019-12-07 18:01:14,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:14,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97986393] [2019-12-07 18:01:14,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:14,853 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 18:01:14,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97986393] [2019-12-07 18:01:14,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:14,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:14,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593382501] [2019-12-07 18:01:14,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:14,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:14,854 INFO L87 Difference]: Start difference. First operand 20279 states and 75560 transitions. Second operand 4 states. [2019-12-07 18:01:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:14,930 INFO L93 Difference]: Finished difference Result 19992 states and 74483 transitions. [2019-12-07 18:01:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:14,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 18:01:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:14,962 INFO L225 Difference]: With dead ends: 19992 [2019-12-07 18:01:14,963 INFO L226 Difference]: Without dead ends: 19992 [2019-12-07 18:01:14,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 18:01:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19992 states. [2019-12-07 18:01:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19992 to 19992. [2019-12-07 18:01:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19992 states. [2019-12-07 18:01:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19992 states to 19992 states and 74483 transitions. [2019-12-07 18:01:15,390 INFO L78 Accepts]: Start accepts. Automaton has 19992 states and 74483 transitions. Word has length 19 [2019-12-07 18:01:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:15,390 INFO L462 AbstractCegarLoop]: Abstraction has 19992 states and 74483 transitions. [2019-12-07 18:01:15,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19992 states and 74483 transitions. [2019-12-07 18:01:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:01:15,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:15,396 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] [2019-12-07 18:01:15,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:15,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:15,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1090694034, now seen corresponding path program 1 times [2019-12-07 18:01:15,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:15,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366251939] [2019-12-07 18:01:15,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:15,552 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 18:01:15,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366251939] [2019-12-07 18:01:15,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:15,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:01:15,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11662365] [2019-12-07 18:01:15,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:01:15,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:15,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:01:15,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:01:15,553 INFO L87 Difference]: Start difference. First operand 19992 states and 74483 transitions. Second operand 7 states. [2019-12-07 18:01:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:15,663 INFO L93 Difference]: Finished difference Result 20228 states and 75127 transitions. [2019-12-07 18:01:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:01:15,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-12-07 18:01:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:15,697 INFO L225 Difference]: With dead ends: 20228 [2019-12-07 18:01:15,697 INFO L226 Difference]: Without dead ends: 20228 [2019-12-07 18:01:15,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:01:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20228 states. [2019-12-07 18:01:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20228 to 20067. [2019-12-07 18:01:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20067 states. [2019-12-07 18:01:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20067 states to 20067 states and 74693 transitions. [2019-12-07 18:01:16,045 INFO L78 Accepts]: Start accepts. Automaton has 20067 states and 74693 transitions. Word has length 20 [2019-12-07 18:01:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:16,045 INFO L462 AbstractCegarLoop]: Abstraction has 20067 states and 74693 transitions. [2019-12-07 18:01:16,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:01:16,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20067 states and 74693 transitions. [2019-12-07 18:01:16,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:01:16,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:16,051 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] [2019-12-07 18:01:16,051 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:16,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:16,052 INFO L82 PathProgramCache]: Analyzing trace with hash -911927474, now seen corresponding path program 2 times [2019-12-07 18:01:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955026984] [2019-12-07 18:01:16,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:16,070 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 18:01:16,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955026984] [2019-12-07 18:01:16,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:16,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:01:16,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161168110] [2019-12-07 18:01:16,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:16,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:16,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:16,071 INFO L87 Difference]: Start difference. First operand 20067 states and 74693 transitions. Second operand 3 states. [2019-12-07 18:01:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:16,107 INFO L93 Difference]: Finished difference Result 11553 states and 37505 transitions. [2019-12-07 18:01:16,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:16,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:01:16,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:16,122 INFO L225 Difference]: With dead ends: 11553 [2019-12-07 18:01:16,122 INFO L226 Difference]: Without dead ends: 11553 [2019-12-07 18:01:16,122 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 18:01:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11553 states. [2019-12-07 18:01:16,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11553 to 11553. [2019-12-07 18:01:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11553 states. [2019-12-07 18:01:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11553 states to 11553 states and 37505 transitions. [2019-12-07 18:01:16,288 INFO L78 Accepts]: Start accepts. Automaton has 11553 states and 37505 transitions. Word has length 20 [2019-12-07 18:01:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:16,288 INFO L462 AbstractCegarLoop]: Abstraction has 11553 states and 37505 transitions. [2019-12-07 18:01:16,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11553 states and 37505 transitions. [2019-12-07 18:01:16,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:01:16,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:16,292 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] [2019-12-07 18:01:16,292 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:16,292 INFO L82 PathProgramCache]: Analyzing trace with hash -407924534, now seen corresponding path program 1 times [2019-12-07 18:01:16,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:16,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619075008] [2019-12-07 18:01:16,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:16,378 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 18:01:16,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619075008] [2019-12-07 18:01:16,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:16,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:01:16,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458518757] [2019-12-07 18:01:16,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:01:16,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:16,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:01:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:16,380 INFO L87 Difference]: Start difference. First operand 11553 states and 37505 transitions. Second operand 8 states. [2019-12-07 18:01:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:16,569 INFO L93 Difference]: Finished difference Result 11759 states and 38043 transitions. [2019-12-07 18:01:16,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:01:16,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 18:01:16,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:16,588 INFO L225 Difference]: With dead ends: 11759 [2019-12-07 18:01:16,589 INFO L226 Difference]: Without dead ends: 11759 [2019-12-07 18:01:16,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:01:16,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11759 states. [2019-12-07 18:01:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11759 to 11502. [2019-12-07 18:01:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11502 states. [2019-12-07 18:01:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11502 states to 11502 states and 37369 transitions. [2019-12-07 18:01:16,795 INFO L78 Accepts]: Start accepts. Automaton has 11502 states and 37369 transitions. Word has length 21 [2019-12-07 18:01:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:16,796 INFO L462 AbstractCegarLoop]: Abstraction has 11502 states and 37369 transitions. [2019-12-07 18:01:16,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:01:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11502 states and 37369 transitions. [2019-12-07 18:01:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:01:16,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:16,800 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] [2019-12-07 18:01:16,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:16,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:16,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1095736327, now seen corresponding path program 1 times [2019-12-07 18:01:16,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:16,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898875830] [2019-12-07 18:01:16,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:01:16,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898875830] [2019-12-07 18:01:16,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:16,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:01:16,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389352561] [2019-12-07 18:01:16,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:01:16,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:01:16,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:01:16,903 INFO L87 Difference]: Start difference. First operand 11502 states and 37369 transitions. Second operand 8 states. [2019-12-07 18:01:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:17,492 INFO L93 Difference]: Finished difference Result 25962 states and 85499 transitions. [2019-12-07 18:01:17,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:01:17,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-07 18:01:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:17,524 INFO L225 Difference]: With dead ends: 25962 [2019-12-07 18:01:17,524 INFO L226 Difference]: Without dead ends: 24454 [2019-12-07 18:01:17,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:01:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24454 states. [2019-12-07 18:01:17,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24454 to 19085. [2019-12-07 18:01:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19085 states. [2019-12-07 18:01:17,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19085 states to 19085 states and 62197 transitions. [2019-12-07 18:01:17,835 INFO L78 Accepts]: Start accepts. Automaton has 19085 states and 62197 transitions. Word has length 22 [2019-12-07 18:01:17,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:17,835 INFO L462 AbstractCegarLoop]: Abstraction has 19085 states and 62197 transitions. [2019-12-07 18:01:17,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:01:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 19085 states and 62197 transitions. [2019-12-07 18:01:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:01:17,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:17,842 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] [2019-12-07 18:01:17,842 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -751959011, now seen corresponding path program 2 times [2019-12-07 18:01:17,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:17,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424956994] [2019-12-07 18:01:17,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:17,875 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 18:01:17,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424956994] [2019-12-07 18:01:17,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:17,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:17,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690301371] [2019-12-07 18:01:17,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:17,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:17,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:17,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:17,877 INFO L87 Difference]: Start difference. First operand 19085 states and 62197 transitions. Second operand 4 states. [2019-12-07 18:01:17,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:17,957 INFO L93 Difference]: Finished difference Result 24515 states and 79936 transitions. [2019-12-07 18:01:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:01:17,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 18:01:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:17,970 INFO L225 Difference]: With dead ends: 24515 [2019-12-07 18:01:17,971 INFO L226 Difference]: Without dead ends: 8952 [2019-12-07 18:01:17,971 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 18:01:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8952 states. [2019-12-07 18:01:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8952 to 8952. [2019-12-07 18:01:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8952 states. [2019-12-07 18:01:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8952 states to 8952 states and 28931 transitions. [2019-12-07 18:01:18,107 INFO L78 Accepts]: Start accepts. Automaton has 8952 states and 28931 transitions. Word has length 22 [2019-12-07 18:01:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,107 INFO L462 AbstractCegarLoop]: Abstraction has 8952 states and 28931 transitions. [2019-12-07 18:01:18,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8952 states and 28931 transitions. [2019-12-07 18:01:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:01:18,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,111 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] [2019-12-07 18:01:18,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash -38213151, now seen corresponding path program 3 times [2019-12-07 18:01:18,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479113610] [2019-12-07 18:01:18,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,140 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 18:01:18,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479113610] [2019-12-07 18:01:18,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:18,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975483679] [2019-12-07 18:01:18,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:01:18,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:01:18,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:01:18,142 INFO L87 Difference]: Start difference. First operand 8952 states and 28931 transitions. Second operand 4 states. [2019-12-07 18:01:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,161 INFO L93 Difference]: Finished difference Result 2139 states and 5647 transitions. [2019-12-07 18:01:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:01:18,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 18:01:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,164 INFO L225 Difference]: With dead ends: 2139 [2019-12-07 18:01:18,164 INFO L226 Difference]: Without dead ends: 2139 [2019-12-07 18:01:18,164 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 18:01:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2019-12-07 18:01:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2019-12-07 18:01:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2139 states. [2019-12-07 18:01:18,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 5647 transitions. [2019-12-07 18:01:18,190 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 5647 transitions. Word has length 22 [2019-12-07 18:01:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,190 INFO L462 AbstractCegarLoop]: Abstraction has 2139 states and 5647 transitions. [2019-12-07 18:01:18,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:01:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 5647 transitions. [2019-12-07 18:01:18,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:01:18,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,192 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] [2019-12-07 18:01:18,192 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,193 INFO L82 PathProgramCache]: Analyzing trace with hash 85752327, now seen corresponding path program 1 times [2019-12-07 18:01:18,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166984679] [2019-12-07 18:01:18,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,231 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 18:01:18,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166984679] [2019-12-07 18:01:18,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:18,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59087224] [2019-12-07 18:01:18,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:01:18,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:01:18,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:01:18,233 INFO L87 Difference]: Start difference. First operand 2139 states and 5647 transitions. Second operand 5 states. [2019-12-07 18:01:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,340 INFO L93 Difference]: Finished difference Result 2884 states and 7387 transitions. [2019-12-07 18:01:18,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:01:18,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:01:18,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,343 INFO L225 Difference]: With dead ends: 2884 [2019-12-07 18:01:18,343 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 18:01:18,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:01:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 18:01:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2193. [2019-12-07 18:01:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2193 states. [2019-12-07 18:01:18,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 5754 transitions. [2019-12-07 18:01:18,365 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 5754 transitions. Word has length 29 [2019-12-07 18:01:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,365 INFO L462 AbstractCegarLoop]: Abstraction has 2193 states and 5754 transitions. [2019-12-07 18:01:18,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:01:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 5754 transitions. [2019-12-07 18:01:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:01:18,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,367 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] [2019-12-07 18:01:18,367 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1377421728, now seen corresponding path program 1 times [2019-12-07 18:01:18,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709454777] [2019-12-07 18:01:18,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,388 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 18:01:18,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709454777] [2019-12-07 18:01:18,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:18,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881356660] [2019-12-07 18:01:18,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:18,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:18,389 INFO L87 Difference]: Start difference. First operand 2193 states and 5754 transitions. Second operand 3 states. [2019-12-07 18:01:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,417 INFO L93 Difference]: Finished difference Result 2593 states and 6438 transitions. [2019-12-07 18:01:18,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:18,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 18:01:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,420 INFO L225 Difference]: With dead ends: 2593 [2019-12-07 18:01:18,420 INFO L226 Difference]: Without dead ends: 2593 [2019-12-07 18:01:18,420 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 18:01:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2019-12-07 18:01:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2157. [2019-12-07 18:01:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2157 states. [2019-12-07 18:01:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2157 states to 2157 states and 5350 transitions. [2019-12-07 18:01:18,450 INFO L78 Accepts]: Start accepts. Automaton has 2157 states and 5350 transitions. Word has length 29 [2019-12-07 18:01:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,451 INFO L462 AbstractCegarLoop]: Abstraction has 2157 states and 5350 transitions. [2019-12-07 18:01:18,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2157 states and 5350 transitions. [2019-12-07 18:01:18,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:01:18,453 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,453 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] [2019-12-07 18:01:18,453 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,454 INFO L82 PathProgramCache]: Analyzing trace with hash -834134890, now seen corresponding path program 1 times [2019-12-07 18:01:18,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178313641] [2019-12-07 18:01:18,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,486 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 18:01:18,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178313641] [2019-12-07 18:01:18,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:01:18,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543926156] [2019-12-07 18:01:18,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:01:18,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:01:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:01:18,488 INFO L87 Difference]: Start difference. First operand 2157 states and 5350 transitions. Second operand 5 states. [2019-12-07 18:01:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,600 INFO L93 Difference]: Finished difference Result 2648 states and 6508 transitions. [2019-12-07 18:01:18,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:01:18,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 18:01:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,602 INFO L225 Difference]: With dead ends: 2648 [2019-12-07 18:01:18,602 INFO L226 Difference]: Without dead ends: 2565 [2019-12-07 18:01:18,602 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 18:01:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2019-12-07 18:01:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2031. [2019-12-07 18:01:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2031 states. [2019-12-07 18:01:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 5056 transitions. [2019-12-07 18:01:18,622 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 5056 transitions. Word has length 30 [2019-12-07 18:01:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,622 INFO L462 AbstractCegarLoop]: Abstraction has 2031 states and 5056 transitions. [2019-12-07 18:01:18,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:01:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 5056 transitions. [2019-12-07 18:01:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 18:01:18,624 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:18,624 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1660300154, now seen corresponding path program 1 times [2019-12-07 18:01:18,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171412666] [2019-12-07 18:01:18,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,660 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 18:01:18,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171412666] [2019-12-07 18:01:18,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:01:18,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976710848] [2019-12-07 18:01:18,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:01:18,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:01:18,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:01:18,662 INFO L87 Difference]: Start difference. First operand 2031 states and 5056 transitions. Second operand 5 states. [2019-12-07 18:01:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,684 INFO L93 Difference]: Finished difference Result 1223 states and 3152 transitions. [2019-12-07 18:01:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:01:18,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 18:01:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,685 INFO L225 Difference]: With dead ends: 1223 [2019-12-07 18:01:18,685 INFO L226 Difference]: Without dead ends: 1223 [2019-12-07 18:01:18,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:01:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2019-12-07 18:01:18,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1223. [2019-12-07 18:01:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-07 18:01:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3152 transitions. [2019-12-07 18:01:18,697 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3152 transitions. Word has length 31 [2019-12-07 18:01:18,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,697 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3152 transitions. [2019-12-07 18:01:18,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:01:18,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3152 transitions. [2019-12-07 18:01:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:01:18,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,699 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] [2019-12-07 18:01:18,699 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash 204691235, now seen corresponding path program 1 times [2019-12-07 18:01:18,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686243840] [2019-12-07 18:01:18,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:18,749 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 18:01:18,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686243840] [2019-12-07 18:01:18,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:18,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:01:18,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793162845] [2019-12-07 18:01:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:01:18,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:01:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:01:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:01:18,750 INFO L87 Difference]: Start difference. First operand 1223 states and 3152 transitions. Second operand 7 states. [2019-12-07 18:01:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:18,910 INFO L93 Difference]: Finished difference Result 3339 states and 8535 transitions. [2019-12-07 18:01:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:01:18,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-07 18:01:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:18,912 INFO L225 Difference]: With dead ends: 3339 [2019-12-07 18:01:18,912 INFO L226 Difference]: Without dead ends: 2223 [2019-12-07 18:01:18,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:01:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-12-07 18:01:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 1375. [2019-12-07 18:01:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-12-07 18:01:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 3521 transitions. [2019-12-07 18:01:18,926 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 3521 transitions. Word has length 45 [2019-12-07 18:01:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:18,926 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 3521 transitions. [2019-12-07 18:01:18,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:01:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 3521 transitions. [2019-12-07 18:01:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 18:01:18,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:18,928 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] [2019-12-07 18:01:18,928 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:18,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1547697441, now seen corresponding path program 2 times [2019-12-07 18:01:18,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:01:18,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864849413] [2019-12-07 18:01:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:01:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:01:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:01:18,990 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:01:18,990 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:01:18,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= v_~z$w_buff0_used~0_485 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_36|) |v_ULTIMATE.start_main_~#t858~0.offset_25| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t858~0.base_36|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t858~0.base_36| 4)) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t858~0.base_36|) 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t858~0.base_36| 1)) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_ULTIMATE.start_main_~#t858~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t858~0.offset=|v_ULTIMATE.start_main_~#t858~0.offset_25|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ULTIMATE.start_main_~#t858~0.base=|v_ULTIMATE.start_main_~#t858~0.base_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_31|, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t858~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t858~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t860~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t860~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t859~0.base, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t859~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:01:18,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t859~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t859~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t859~0.offset_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t859~0.base_10| 4)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10|) |v_ULTIMATE.start_main_~#t859~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t859~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t859~0.base] because there is no mapped edge [2019-12-07 18:01:18,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t860~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t860~0.base_13|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t860~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t860~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13|) |v_ULTIMATE.start_main_~#t860~0.offset_11| 2))) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_13|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t860~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t860~0.offset, #length] because there is no mapped edge [2019-12-07 18:01:18,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out1459014182 ~z$w_buff0~0_In1459014182) (= |P2Thread1of1ForFork0_#in~arg.base_In1459014182| P2Thread1of1ForFork0_~arg.base_Out1459014182) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182 0)) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out1459014182 256))) (not (= (mod ~z$w_buff0_used~0_Out1459014182 256) 0)))) 1 0)) (= ~z$w_buff0_used~0_Out1459014182 1) (= ~z$w_buff0~0_Out1459014182 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182) (= ~z$w_buff1_used~0_Out1459014182 ~z$w_buff0_used~0_In1459014182) (= P2Thread1of1ForFork0_~arg.offset_Out1459014182 |P2Thread1of1ForFork0_#in~arg.offset_In1459014182|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1459014182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459014182, ~z$w_buff0~0=~z$w_buff0~0_In1459014182, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1459014182|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out1459014182, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1459014182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1459014182, ~z$w_buff0~0=~z$w_buff0~0_Out1459014182, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out1459014182, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1459014182, ~z$w_buff1~0=~z$w_buff1~0_Out1459014182, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1459014182|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:01:18,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:01:18,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-957089756 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-957089756 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-957089756|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-957089756 |P2Thread1of1ForFork0_#t~ite28_Out-957089756|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-957089756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-957089756} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-957089756|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957089756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-957089756} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:01:18,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-924364809 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-924364809 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-924364809 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-924364809 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-924364809| ~z$w_buff1_used~0_In-924364809) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite29_Out-924364809| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-924364809, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-924364809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-924364809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924364809} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-924364809, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-924364809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-924364809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924364809, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-924364809|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:01:18,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1562006181 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1562006181 256))) (.cse0 (= ~z$r_buff0_thd3~0_Out-1562006181 ~z$r_buff0_thd3~0_In-1562006181))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~z$r_buff0_thd3~0_Out-1562006181 0)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562006181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1562006181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562006181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1562006181, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1562006181|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 18:01:18,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1421149634 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1421149634 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1421149634 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1421149634 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1421149634 |P2Thread1of1ForFork0_#t~ite31_Out-1421149634|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite31_Out-1421149634| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421149634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1421149634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421149634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1421149634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421149634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1421149634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421149634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1421149634, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-1421149634|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:01:18,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:01:19,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:01:19,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:01:19,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:01:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In2120905610 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2120905610 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2120905610| ~z~0_In2120905610)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out2120905610| ~z$w_buff1~0_In2120905610) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2120905610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2120905610, ~z$w_buff1~0=~z$w_buff1~0_In2120905610, ~z~0=~z~0_In2120905610} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2120905610, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2120905610|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2120905610, ~z$w_buff1~0=~z$w_buff1~0_In2120905610, ~z~0=~z~0_In2120905610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 18:01:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 18:01:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1925094295 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1925094295 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1925094295|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out1925094295| ~z$w_buff0_used~0_In1925094295) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1925094295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:01:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1765100893 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1765100893 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1765100893 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1765100893 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1765100893|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1765100893| ~z$w_buff1_used~0_In-1765100893)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1765100893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1765100893} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1765100893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1765100893, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1765100893|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:01:19,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-137715464 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-137715464 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-137715464|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-137715464 |ULTIMATE.start_main_#t~ite39_Out-137715464|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137715464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137715464} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137715464, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-137715464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137715464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:01:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1844024690 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1844024690 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1844024690 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1844024690 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1844024690| ~z$r_buff1_thd0~0_In1844024690)) (and (= |ULTIMATE.start_main_#t~ite40_Out1844024690| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844024690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844024690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844024690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844024690} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844024690, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1844024690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844024690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844024690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844024690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:01:19,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:01:19,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:01:19 BasicIcfg [2019-12-07 18:01:19,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:01:19,068 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:01:19,068 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:01:19,068 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:01:19,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:01:06" (3/4) ... [2019-12-07 18:01:19,070 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:01:19,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$mem_tmp~0_20 0) (= v_~z$w_buff0_used~0_485 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_36| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t858~0.base_36|) |v_ULTIMATE.start_main_~#t858~0.offset_25| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~z$r_buff0_thd3~0_99 0) (= 0 v_~z$r_buff1_thd3~0_76) (= 0 v_~__unbuffered_p0_EAX~0_49) (= |v_#NULL.offset_3| 0) (= v_~z~0_140 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd2~0_143 0) (= v_~z$r_buff0_thd2~0_213 0) (= v_~__unbuffered_cnt~0_109 0) (= v_~z$read_delayed_var~0.base_8 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t858~0.base_36|) (= v_~b~0_40 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd1~0_25) (= v_~__unbuffered_p1_EBX~0_70 0) (= v_~__unbuffered_p2_EBX~0_52 0) (= v_~y~0_15 0) (= v_~z$r_buff0_thd1~0_25 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t858~0.base_36| 4)) (= v_~z$w_buff1~0_118 0) (= v_~x~0_31 0) (= v_~main$tmp_guard1~0_38 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t858~0.base_36|) 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t858~0.base_36| 1)) (= v_~a~0_24 0) (= 0 v_~z$flush_delayed~0_46) (= 0 |v_ULTIMATE.start_main_~#t858~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~weak$$choice2~0_95) (= 0 v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_82 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$w_buff0~0_173 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= v_~z$w_buff1_used~0_228 0) (= 0 v_~z$r_buff1_thd0~0_88))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_~#t858~0.offset=|v_ULTIMATE.start_main_~#t858~0.offset_25|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_21|, ULTIMATE.start_main_~#t858~0.base=|v_ULTIMATE.start_main_~#t858~0.base_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_143, #NULL.offset=|v_#NULL.offset_3|, ~a~0=v_~a~0_24, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_49, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_52, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_35|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_19|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_228, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_245|, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_71|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_25|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_25, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_31|, ~x~0=v_~x~0_31, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_118, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_19|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~y~0=v_~y~0_15, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_213, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_70, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_485, ~z$w_buff0~0=v_~z$w_buff0~0_173, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_76, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_3|, ~b~0=v_~b~0_40, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t858~0.offset, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_~#t858~0.base, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t860~0.offset, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t860~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t859~0.base, ~x~0, ULTIMATE.start_main_#t~nondet33, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t859~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, #NULL.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:01:19,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t859~0.base_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t859~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t859~0.offset_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t859~0.base_10| 4)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t859~0.base_10|) |v_ULTIMATE.start_main_~#t859~0.offset_9| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t859~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t859~0.offset=|v_ULTIMATE.start_main_~#t859~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_~#t859~0.base=|v_ULTIMATE.start_main_~#t859~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t859~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t859~0.base] because there is no mapped edge [2019-12-07 18:01:19,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L834-1-->L836: Formula: (and (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t860~0.base_13| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t860~0.base_13|)) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t860~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t860~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t860~0.base_13|) |v_ULTIMATE.start_main_~#t860~0.offset_11| 2))) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t860~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_10|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t860~0.base=|v_ULTIMATE.start_main_~#t860~0.base_13|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t860~0.offset=|v_ULTIMATE.start_main_~#t860~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t860~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t860~0.offset, #length] because there is no mapped edge [2019-12-07 18:01:19,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P2ENTRY-->L4-3: Formula: (and (= ~z$w_buff1~0_Out1459014182 ~z$w_buff0~0_In1459014182) (= |P2Thread1of1ForFork0_#in~arg.base_In1459014182| P2Thread1of1ForFork0_~arg.base_Out1459014182) (not (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182 0)) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182| (ite (not (and (not (= 0 (mod ~z$w_buff1_used~0_Out1459014182 256))) (not (= (mod ~z$w_buff0_used~0_Out1459014182 256) 0)))) 1 0)) (= ~z$w_buff0_used~0_Out1459014182 1) (= ~z$w_buff0~0_Out1459014182 1) (= |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182| P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182) (= ~z$w_buff1_used~0_Out1459014182 ~z$w_buff0_used~0_In1459014182) (= P2Thread1of1ForFork0_~arg.offset_Out1459014182 |P2Thread1of1ForFork0_#in~arg.offset_In1459014182|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1459014182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1459014182, ~z$w_buff0~0=~z$w_buff0~0_In1459014182, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1459014182|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out1459014182, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1459014182|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In1459014182|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1459014182, ~z$w_buff0~0=~z$w_buff0~0_Out1459014182, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out1459014182, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1459014182, ~z$w_buff1~0=~z$w_buff1~0_Out1459014182, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In1459014182|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out1459014182} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:01:19,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_13| v_P0Thread1of1ForFork1_~arg.base_11) (= v_~x~0_16 v_~__unbuffered_p0_EAX~0_17) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~b~0_23 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_P0Thread1of1ForFork1_~arg.offset_11 |v_P0Thread1of1ForFork1_#in~arg.offset_13|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_13|, ~b~0=v_~b~0_23, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_11, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_13|, ~x~0=v_~x~0_16, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:01:19,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-957089756 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-957089756 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite28_Out-957089756|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-957089756 |P2Thread1of1ForFork0_#t~ite28_Out-957089756|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-957089756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-957089756} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-957089756|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-957089756, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-957089756} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:01:19,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-924364809 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-924364809 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-924364809 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-924364809 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out-924364809| ~z$w_buff1_used~0_In-924364809) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite29_Out-924364809| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-924364809, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-924364809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-924364809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924364809} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-924364809, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-924364809, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-924364809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-924364809, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-924364809|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:01:19,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L812-->L813: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1562006181 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1562006181 256))) (.cse0 (= ~z$r_buff0_thd3~0_Out-1562006181 ~z$r_buff0_thd3~0_In-1562006181))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~z$r_buff0_thd3~0_Out-1562006181 0)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562006181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1562006181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1562006181, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1562006181, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1562006181|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite30] because there is no mapped edge [2019-12-07 18:01:19,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L813-->L813-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-1421149634 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1421149634 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1421149634 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1421149634 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1421149634 |P2Thread1of1ForFork0_#t~ite31_Out-1421149634|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite31_Out-1421149634| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421149634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1421149634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421149634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1421149634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1421149634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1421149634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1421149634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1421149634, P2Thread1of1ForFork0_#t~ite31=|P2Thread1of1ForFork0_#t~ite31_Out-1421149634|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:01:19,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L813-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_102 (+ v_~__unbuffered_cnt~0_103 1)) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_63 |v_P2Thread1of1ForFork0_#t~ite31_50|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_103, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_50|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_63, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_49|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:01:19,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~z$r_buff0_thd2~0_102 v_~z$r_buff0_thd2~0_101)) InVars {~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_102} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_16|, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_101} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, ~z$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:01:19,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L775-->L783: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_23 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:01:19,079 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_32) 1 0)) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:01:19,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L842-2-->L842-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In2120905610 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2120905610 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite35_Out2120905610| ~z~0_In2120905610)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out2120905610| ~z$w_buff1~0_In2120905610) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2120905610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2120905610, ~z$w_buff1~0=~z$w_buff1~0_In2120905610, ~z~0=~z~0_In2120905610} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2120905610, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out2120905610|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2120905610, ~z$w_buff1~0=~z$w_buff1~0_In2120905610, ~z~0=~z~0_In2120905610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-07 18:01:19,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [604] [604] L842-4-->L843: Formula: (= v_~z~0_12 |v_ULTIMATE.start_main_#t~ite35_7|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_6|, ~z~0=v_~z~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~z~0] because there is no mapped edge [2019-12-07 18:01:19,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1925094295 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1925094295 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1925094295|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite37_Out1925094295| ~z$w_buff0_used~0_In1925094295) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1925094295, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1925094295, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1925094295|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 18:01:19,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1765100893 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1765100893 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1765100893 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1765100893 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite38_Out-1765100893|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite38_Out-1765100893| ~z$w_buff1_used~0_In-1765100893)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1765100893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1765100893} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1765100893, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1765100893, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1765100893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1765100893, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1765100893|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 18:01:19,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-137715464 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-137715464 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-137715464|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-137715464 |ULTIMATE.start_main_#t~ite39_Out-137715464|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137715464, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137715464} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-137715464, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-137715464|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-137715464} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 18:01:19,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L846-->L846-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1844024690 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1844024690 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1844024690 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In1844024690 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1844024690| ~z$r_buff1_thd0~0_In1844024690)) (and (= |ULTIMATE.start_main_#t~ite40_Out1844024690| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844024690, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844024690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844024690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844024690} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1844024690, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1844024690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1844024690, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1844024690, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1844024690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 18:01:19,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= |v_ULTIMATE.start_main_#t~ite40_42| v_~z$r_buff1_thd0~0_71) (= v_~main$tmp_guard1~0_21 (ite (= 0 (ite (not (and (= v_~__unbuffered_p2_EBX~0_35 0) (= v_~__unbuffered_p1_EBX~0_48 0) (= 1 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_35) (= 1 v_~__unbuffered_p2_EAX~0_35))) 1 0)) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_21 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_42|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_41|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_71, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:01:19,144 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6d4c5fcd-b2bf-41a0-9dc5-b028ccea12ee/bin/uautomizer/witness.graphml [2019-12-07 18:01:19,144 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:01:19,146 INFO L168 Benchmark]: Toolchain (without parser) took 13809.87 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 939.8 MB in the beginning and 1.9 GB in the end (delta: -987.1 MB). Peak memory consumption was 234.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,146 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:01:19,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 939.8 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,147 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 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 18:01:19,147 INFO L168 Benchmark]: RCFGBuilder took 369.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,148 INFO L168 Benchmark]: TraceAbstraction took 12912.07 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -860.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,148 INFO L168 Benchmark]: Witness Printer took 76.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:01:19,150 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.1 MB). Free memory was 939.8 MB in the beginning and 1.2 GB in the end (delta: -211.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.39 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 369.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12912.07 ms. Allocated memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -860.5 MB). Peak memory consumption was 175.5 MB. Max. memory is 11.5 GB. * Witness Printer took 76.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.0 GB in the beginning and 1.9 GB in the end (delta: 31.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.8s, 156 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 85 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4667 VarBasedMoverChecksPositive, 145 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 50265 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t858, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t859, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t860, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L794] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L795] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L796] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L797] 3 z$r_buff0_thd3 = (_Bool)1 [L800] 3 a = 1 [L803] 3 __unbuffered_p2_EAX = a [L806] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 y = 1 [L760] 2 __unbuffered_p1_EAX = y [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 z$flush_delayed = weak$$choice2 [L766] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L767] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 147 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2416 SDtfs, 2468 SDslu, 3994 SDs, 0 SdLazy, 1737 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21928occurred 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: 4.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 21543 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 395 ConstructedInterpolants, 0 QuantifiedInterpolants, 52156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...