./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/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 3a0fda00dffe56741f4c5e0b5309790cce37d51a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:16:27,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:16:27,235 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:16:27,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:16:27,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:16:27,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:16:27,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:16:27,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:16:27,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:16:27,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:16:27,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:16:27,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:16:27,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:16:27,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:16:27,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:16:27,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:16:27,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:16:27,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:16:27,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:16:27,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:16:27,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:16:27,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:16:27,257 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:16:27,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:16:27,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:16:27,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:16:27,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:16:27,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:16:27,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:16:27,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:16:27,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:16:27,262 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:16:27,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:16:27,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:16:27,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:16:27,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:16:27,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:16:27,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:16:27,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:16:27,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:16:27,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:16:27,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:16:27,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:16:27,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:16:27,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:16:27,280 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:16:27,280 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:16:27,280 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:16:27,280 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:16:27,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:16:27,282 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:16:27,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:16:27,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:16:27,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:16:27,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:16:27,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:16:27,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:16:27,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:16:27,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:16:27,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:16:27,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:16:27,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:16:27,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:16:27,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:16:27,284 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:16:27,284 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_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/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 -> 3a0fda00dffe56741f4c5e0b5309790cce37d51a [2019-12-07 16:16:27,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:16:27,393 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:16:27,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:16:27,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:16:27,397 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:16:27,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_power.opt.i [2019-12-07 16:16:27,442 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/data/f9d92542d/f8e1992de81d40d19ec752cd53342dff/FLAGc7a4f98ec [2019-12-07 16:16:27,797 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:16:27,798 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/sv-benchmarks/c/pthread-wmm/safe024_power.opt.i [2019-12-07 16:16:27,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/data/f9d92542d/f8e1992de81d40d19ec752cd53342dff/FLAGc7a4f98ec [2019-12-07 16:16:27,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/data/f9d92542d/f8e1992de81d40d19ec752cd53342dff [2019-12-07 16:16:27,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:16:27,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:16:27,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:27,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:16:27,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:16:27,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:27" (1/1) ... [2019-12-07 16:16:27,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:27, skipping insertion in model container [2019-12-07 16:16:27,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:27" (1/1) ... [2019-12-07 16:16:27,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:16:27,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:16:28,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:28,098 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:16:28,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:28,192 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:16:28,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28 WrapperNode [2019-12-07 16:16:28,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:28,193 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:28,193 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:16:28,193 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:16:28,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,214 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:28,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:16:28,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:16:28,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:16:28,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... [2019-12-07 16:16:28,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:16:28,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:16:28,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:16:28,268 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:16:28,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/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 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:16:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:16:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:16:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:16:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:16:28,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:16:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:16:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:16:28,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:16:28,322 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 16:16:28,671 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:16:28,671 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:16:28,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:28 BoogieIcfgContainer [2019-12-07 16:16:28,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:16:28,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:16:28,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:16:28,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:16:28,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:16:27" (1/3) ... [2019-12-07 16:16:28,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8e8e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:16:28, skipping insertion in model container [2019-12-07 16:16:28,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:28" (2/3) ... [2019-12-07 16:16:28,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8e8e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:16:28, skipping insertion in model container [2019-12-07 16:16:28,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:28" (3/3) ... [2019-12-07 16:16:28,677 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_power.opt.i [2019-12-07 16:16:28,683 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:16:28,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:16:28,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:16:28,688 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:16:28,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,714 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:16:28,747 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:16:28,760 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:16:28,760 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:16:28,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:16:28,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:16:28,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:16:28,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:16:28,760 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:16:28,760 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:16:28,772 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 16:16:28,774 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 16:16:28,834 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 16:16:28,834 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:16:28,846 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 16:16:28,860 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 16:16:28,896 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 16:16:28,897 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:16:28,904 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 726 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 16:16:28,919 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 16:16:28,920 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:16:31,991 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 16:16:32,087 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 16:16:32,087 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 16:16:32,090 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 16:16:41,664 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 16:16:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 16:16:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 16:16:41,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:41,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 16:16:41,670 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 16:16:41,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:41,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180244971] [2019-12-07 16:16:41,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:41,824 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 16:16:41,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180244971] [2019-12-07 16:16:41,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:41,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:16:41,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405505254] [2019-12-07 16:16:41,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:16:41,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:16:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:16:41,840 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 16:16:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:42,424 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 16:16:42,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:16:42,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 16:16:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:42,958 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 16:16:42,959 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 16:16:42,959 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 16:16:46,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 16:16:47,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 16:16:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 16:16:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 16:16:47,676 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 16:16:47,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:47,677 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 16:16:47,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:16:47,677 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 16:16:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:16:47,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:47,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:47,684 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:47,685 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 16:16:47,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:47,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941769701] [2019-12-07 16:16:47,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:47,754 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 16:16:47,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941769701] [2019-12-07 16:16:47,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:47,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:16:47,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230874858] [2019-12-07 16:16:47,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:16:47,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:47,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:16:47,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:16:47,756 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 16:16:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:49,878 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 16:16:49,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:16:49,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:16:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:50,214 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 16:16:50,214 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 16:16:50,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:16:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 16:16:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 16:16:55,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 16:16:55,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 16:16:55,899 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 16:16:55,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:55,900 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 16:16:55,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:16:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 16:16:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:16:55,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:55,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:55,903 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:55,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 16:16:55,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:55,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8217323] [2019-12-07 16:16:55,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:55,939 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 16:16:55,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8217323] [2019-12-07 16:16:55,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:55,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:16:55,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620710016] [2019-12-07 16:16:55,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:16:55,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:55,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:16:55,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:16:55,941 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 16:16:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:56,030 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 16:16:56,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:16:56,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 16:16:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:56,075 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 16:16:56,075 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 16:16:56,076 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 16:16:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 16:16:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 16:16:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 16:16:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 16:16:56,857 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 16:16:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:56,857 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 16:16:56,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:16:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 16:16:56,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 16:16:56,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:56,858 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:56,859 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:56,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:56,859 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 16:16:56,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:56,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189437264] [2019-12-07 16:16:56,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:56,922 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 16:16:56,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189437264] [2019-12-07 16:16:56,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:56,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:16:56,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421075032] [2019-12-07 16:16:56,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:16:56,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:16:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:16:56,923 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 16:16:57,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:57,228 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 16:16:57,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:16:57,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 16:16:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:57,288 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 16:16:57,289 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 16:16:57,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:16:57,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 16:16:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 16:16:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 16:16:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 16:16:57,885 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 16:16:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:57,886 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 16:16:57,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:16:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 16:16:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:16:57,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:57,893 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 16:16:57,893 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:57,893 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 16:16:57,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:57,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606510504] [2019-12-07 16:16:57,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:57,962 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 16:16:57,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606510504] [2019-12-07 16:16:57,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:57,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:16:57,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705305619] [2019-12-07 16:16:57,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:16:57,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:16:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:16:57,963 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 16:16:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:58,549 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 16:16:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:16:58,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 16:16:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:58,620 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 16:16:58,620 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 16:16:58,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:16:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 16:16:59,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 16:16:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 16:16:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 16:16:59,277 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 16:16:59,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:16:59,277 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 16:16:59,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:16:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 16:16:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:16:59,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:16:59,290 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:16:59,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:16:59,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:16:59,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 16:16:59,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:16:59,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352907859] [2019-12-07 16:16:59,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:16:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:16:59,360 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 16:16:59,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352907859] [2019-12-07 16:16:59,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:16:59,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:16:59,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203357528] [2019-12-07 16:16:59,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:16:59,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:16:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:16:59,362 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 5 states. [2019-12-07 16:16:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:16:59,927 INFO L93 Difference]: Finished difference Result 44326 states and 144194 transitions. [2019-12-07 16:16:59,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:16:59,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 16:16:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:16:59,985 INFO L225 Difference]: With dead ends: 44326 [2019-12-07 16:16:59,985 INFO L226 Difference]: Without dead ends: 44303 [2019-12-07 16:16:59,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2019-12-07 16:17:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 37268. [2019-12-07 16:17:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37268 states. [2019-12-07 16:17:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37268 states to 37268 states and 122134 transitions. [2019-12-07 16:17:00,630 INFO L78 Accepts]: Start accepts. Automaton has 37268 states and 122134 transitions. Word has length 25 [2019-12-07 16:17:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:00,631 INFO L462 AbstractCegarLoop]: Abstraction has 37268 states and 122134 transitions. [2019-12-07 16:17:00,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37268 states and 122134 transitions. [2019-12-07 16:17:00,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:17:00,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:00,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:00,643 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:00,643 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 16:17:00,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:00,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831275926] [2019-12-07 16:17:00,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:00,680 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 16:17:00,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831275926] [2019-12-07 16:17:00,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:00,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:17:00,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319194997] [2019-12-07 16:17:00,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:17:00,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:00,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:17:00,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:17:00,681 INFO L87 Difference]: Start difference. First operand 37268 states and 122134 transitions. Second operand 4 states. [2019-12-07 16:17:00,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:00,735 INFO L93 Difference]: Finished difference Result 13778 states and 41802 transitions. [2019-12-07 16:17:00,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:17:00,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 16:17:00,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:00,751 INFO L225 Difference]: With dead ends: 13778 [2019-12-07 16:17:00,751 INFO L226 Difference]: Without dead ends: 13778 [2019-12-07 16:17:00,751 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 16:17:00,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2019-12-07 16:17:00,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13498. [2019-12-07 16:17:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13498 states. [2019-12-07 16:17:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13498 states to 13498 states and 40957 transitions. [2019-12-07 16:17:00,935 INFO L78 Accepts]: Start accepts. Automaton has 13498 states and 40957 transitions. Word has length 27 [2019-12-07 16:17:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:00,936 INFO L462 AbstractCegarLoop]: Abstraction has 13498 states and 40957 transitions. [2019-12-07 16:17:00,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:17:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13498 states and 40957 transitions. [2019-12-07 16:17:00,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:17:00,952 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:00,952 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] [2019-12-07 16:17:00,952 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 16:17:00,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:00,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904378776] [2019-12-07 16:17:00,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:01,050 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 16:17:01,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904378776] [2019-12-07 16:17:01,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:01,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:17:01,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369721682] [2019-12-07 16:17:01,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:17:01,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:01,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:17:01,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:01,052 INFO L87 Difference]: Start difference. First operand 13498 states and 40957 transitions. Second operand 7 states. [2019-12-07 16:17:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:01,754 INFO L93 Difference]: Finished difference Result 16601 states and 49016 transitions. [2019-12-07 16:17:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 16:17:01,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 16:17:01,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:01,772 INFO L225 Difference]: With dead ends: 16601 [2019-12-07 16:17:01,772 INFO L226 Difference]: Without dead ends: 16597 [2019-12-07 16:17:01,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:17:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16597 states. [2019-12-07 16:17:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16597 to 12946. [2019-12-07 16:17:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12946 states. [2019-12-07 16:17:01,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 39222 transitions. [2019-12-07 16:17:01,970 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 39222 transitions. Word has length 39 [2019-12-07 16:17:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:01,970 INFO L462 AbstractCegarLoop]: Abstraction has 12946 states and 39222 transitions. [2019-12-07 16:17:01,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:17:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 39222 transitions. [2019-12-07 16:17:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:17:01,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:01,985 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] [2019-12-07 16:17:01,985 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:01,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:01,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1774277701, now seen corresponding path program 1 times [2019-12-07 16:17:01,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:01,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017213955] [2019-12-07 16:17:01,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:02,035 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 16:17:02,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017213955] [2019-12-07 16:17:02,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:02,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:17:02,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587498159] [2019-12-07 16:17:02,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:02,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:02,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:02,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:02,037 INFO L87 Difference]: Start difference. First operand 12946 states and 39222 transitions. Second operand 5 states. [2019-12-07 16:17:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:02,352 INFO L93 Difference]: Finished difference Result 18396 states and 55230 transitions. [2019-12-07 16:17:02,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:02,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 16:17:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:02,372 INFO L225 Difference]: With dead ends: 18396 [2019-12-07 16:17:02,372 INFO L226 Difference]: Without dead ends: 18396 [2019-12-07 16:17:02,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18396 states. [2019-12-07 16:17:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18396 to 17106. [2019-12-07 16:17:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17106 states. [2019-12-07 16:17:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17106 states to 17106 states and 51647 transitions. [2019-12-07 16:17:02,607 INFO L78 Accepts]: Start accepts. Automaton has 17106 states and 51647 transitions. Word has length 39 [2019-12-07 16:17:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:02,607 INFO L462 AbstractCegarLoop]: Abstraction has 17106 states and 51647 transitions. [2019-12-07 16:17:02,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17106 states and 51647 transitions. [2019-12-07 16:17:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:17:02,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:02,628 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] [2019-12-07 16:17:02,628 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1535710989, now seen corresponding path program 2 times [2019-12-07 16:17:02,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:02,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364091750] [2019-12-07 16:17:02,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:02,682 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 16:17:02,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364091750] [2019-12-07 16:17:02,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:02,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:17:02,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214224829] [2019-12-07 16:17:02,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:02,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:02,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:02,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:02,684 INFO L87 Difference]: Start difference. First operand 17106 states and 51647 transitions. Second operand 6 states. [2019-12-07 16:17:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:03,157 INFO L93 Difference]: Finished difference Result 29522 states and 89265 transitions. [2019-12-07 16:17:03,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:17:03,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 16:17:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:03,191 INFO L225 Difference]: With dead ends: 29522 [2019-12-07 16:17:03,191 INFO L226 Difference]: Without dead ends: 29522 [2019-12-07 16:17:03,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:17:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29522 states. [2019-12-07 16:17:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29522 to 19234. [2019-12-07 16:17:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19234 states. [2019-12-07 16:17:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19234 states to 19234 states and 58280 transitions. [2019-12-07 16:17:03,522 INFO L78 Accepts]: Start accepts. Automaton has 19234 states and 58280 transitions. Word has length 39 [2019-12-07 16:17:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:03,522 INFO L462 AbstractCegarLoop]: Abstraction has 19234 states and 58280 transitions. [2019-12-07 16:17:03,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19234 states and 58280 transitions. [2019-12-07 16:17:03,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:17:03,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:03,539 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] [2019-12-07 16:17:03,539 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2031506743, now seen corresponding path program 3 times [2019-12-07 16:17:03,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:03,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532218167] [2019-12-07 16:17:03,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:03,568 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 16:17:03,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532218167] [2019-12-07 16:17:03,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:03,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:03,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198420432] [2019-12-07 16:17:03,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:03,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:03,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:03,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:03,569 INFO L87 Difference]: Start difference. First operand 19234 states and 58280 transitions. Second operand 3 states. [2019-12-07 16:17:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:03,611 INFO L93 Difference]: Finished difference Result 16333 states and 48751 transitions. [2019-12-07 16:17:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:03,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 16:17:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:03,628 INFO L225 Difference]: With dead ends: 16333 [2019-12-07 16:17:03,628 INFO L226 Difference]: Without dead ends: 16333 [2019-12-07 16:17:03,628 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 16:17:03,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16333 states. [2019-12-07 16:17:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16333 to 16201. [2019-12-07 16:17:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16201 states. [2019-12-07 16:17:03,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16201 states to 16201 states and 48401 transitions. [2019-12-07 16:17:03,838 INFO L78 Accepts]: Start accepts. Automaton has 16201 states and 48401 transitions. Word has length 39 [2019-12-07 16:17:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:03,838 INFO L462 AbstractCegarLoop]: Abstraction has 16201 states and 48401 transitions. [2019-12-07 16:17:03,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 16201 states and 48401 transitions. [2019-12-07 16:17:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:17:03,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:03,851 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] [2019-12-07 16:17:03,851 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:03,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:03,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1257839546, now seen corresponding path program 1 times [2019-12-07 16:17:03,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:03,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620534257] [2019-12-07 16:17:03,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:03,906 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 16:17:03,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620534257] [2019-12-07 16:17:03,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:03,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:17:03,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775125201] [2019-12-07 16:17:03,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:17:03,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:17:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:17:03,908 INFO L87 Difference]: Start difference. First operand 16201 states and 48401 transitions. Second operand 6 states. [2019-12-07 16:17:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:04,479 INFO L93 Difference]: Finished difference Result 21249 states and 62729 transitions. [2019-12-07 16:17:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:17:04,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 16:17:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:04,502 INFO L225 Difference]: With dead ends: 21249 [2019-12-07 16:17:04,502 INFO L226 Difference]: Without dead ends: 21249 [2019-12-07 16:17:04,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:17:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21249 states. [2019-12-07 16:17:04,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21249 to 16853. [2019-12-07 16:17:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16853 states. [2019-12-07 16:17:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16853 states to 16853 states and 50397 transitions. [2019-12-07 16:17:04,760 INFO L78 Accepts]: Start accepts. Automaton has 16853 states and 50397 transitions. Word has length 40 [2019-12-07 16:17:04,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:04,760 INFO L462 AbstractCegarLoop]: Abstraction has 16853 states and 50397 transitions. [2019-12-07 16:17:04,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:17:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 16853 states and 50397 transitions. [2019-12-07 16:17:04,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:17:04,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:04,774 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] [2019-12-07 16:17:04,774 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:04,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:04,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2004804486, now seen corresponding path program 2 times [2019-12-07 16:17:04,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:04,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017491363] [2019-12-07 16:17:04,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:04,808 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 16:17:04,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017491363] [2019-12-07 16:17:04,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:04,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:04,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742703347] [2019-12-07 16:17:04,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:04,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:04,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:04,809 INFO L87 Difference]: Start difference. First operand 16853 states and 50397 transitions. Second operand 5 states. [2019-12-07 16:17:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:04,860 INFO L93 Difference]: Finished difference Result 15294 states and 46531 transitions. [2019-12-07 16:17:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:17:04,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 16:17:04,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:04,877 INFO L225 Difference]: With dead ends: 15294 [2019-12-07 16:17:04,877 INFO L226 Difference]: Without dead ends: 15294 [2019-12-07 16:17:04,877 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 16:17:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15294 states. [2019-12-07 16:17:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15294 to 14186. [2019-12-07 16:17:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-07 16:17:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 43327 transitions. [2019-12-07 16:17:05,081 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 43327 transitions. Word has length 40 [2019-12-07 16:17:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:05,081 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 43327 transitions. [2019-12-07 16:17:05,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 43327 transitions. [2019-12-07 16:17:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 16:17:05,094 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:05,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:05,094 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash -907156732, now seen corresponding path program 1 times [2019-12-07 16:17:05,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:05,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566084369] [2019-12-07 16:17:05,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:05,221 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 16:17:05,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566084369] [2019-12-07 16:17:05,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:05,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:17:05,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735407243] [2019-12-07 16:17:05,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:17:05,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:05,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:17:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:17:05,222 INFO L87 Difference]: Start difference. First operand 14186 states and 43327 transitions. Second operand 8 states. [2019-12-07 16:17:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:05,721 INFO L93 Difference]: Finished difference Result 36779 states and 114590 transitions. [2019-12-07 16:17:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:17:05,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-07 16:17:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:05,760 INFO L225 Difference]: With dead ends: 36779 [2019-12-07 16:17:05,761 INFO L226 Difference]: Without dead ends: 33633 [2019-12-07 16:17:05,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:17:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33633 states. [2019-12-07 16:17:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33633 to 13806. [2019-12-07 16:17:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2019-12-07 16:17:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 42112 transitions. [2019-12-07 16:17:06,099 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 42112 transitions. Word has length 54 [2019-12-07 16:17:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:06,099 INFO L462 AbstractCegarLoop]: Abstraction has 13806 states and 42112 transitions. [2019-12-07 16:17:06,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:17:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 42112 transitions. [2019-12-07 16:17:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 16:17:06,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:06,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:06,115 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1721258620, now seen corresponding path program 2 times [2019-12-07 16:17:06,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:06,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255434546] [2019-12-07 16:17:06,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:06,173 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 16:17:06,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255434546] [2019-12-07 16:17:06,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:06,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:17:06,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4999613] [2019-12-07 16:17:06,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:17:06,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:06,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:17:06,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:17:06,174 INFO L87 Difference]: Start difference. First operand 13806 states and 42112 transitions. Second operand 3 states. [2019-12-07 16:17:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:06,223 INFO L93 Difference]: Finished difference Result 13804 states and 42107 transitions. [2019-12-07 16:17:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:17:06,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 16:17:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:06,242 INFO L225 Difference]: With dead ends: 13804 [2019-12-07 16:17:06,242 INFO L226 Difference]: Without dead ends: 13804 [2019-12-07 16:17:06,242 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 16:17:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2019-12-07 16:17:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 12236. [2019-12-07 16:17:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12236 states. [2019-12-07 16:17:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12236 states to 12236 states and 37653 transitions. [2019-12-07 16:17:06,436 INFO L78 Accepts]: Start accepts. Automaton has 12236 states and 37653 transitions. Word has length 54 [2019-12-07 16:17:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:06,437 INFO L462 AbstractCegarLoop]: Abstraction has 12236 states and 37653 transitions. [2019-12-07 16:17:06,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:17:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 12236 states and 37653 transitions. [2019-12-07 16:17:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:17:06,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:06,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:06,446 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1492343505, now seen corresponding path program 1 times [2019-12-07 16:17:06,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:06,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882209946] [2019-12-07 16:17:06,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:06,506 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 16:17:06,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882209946] [2019-12-07 16:17:06,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:06,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:17:06,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225259974] [2019-12-07 16:17:06,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:17:06,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:17:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:17:06,507 INFO L87 Difference]: Start difference. First operand 12236 states and 37653 transitions. Second operand 5 states. [2019-12-07 16:17:06,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:06,589 INFO L93 Difference]: Finished difference Result 22376 states and 68803 transitions. [2019-12-07 16:17:06,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:17:06,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 16:17:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:06,600 INFO L225 Difference]: With dead ends: 22376 [2019-12-07 16:17:06,600 INFO L226 Difference]: Without dead ends: 10608 [2019-12-07 16:17:06,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:17:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10608 states. [2019-12-07 16:17:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10608 to 10608. [2019-12-07 16:17:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10608 states. [2019-12-07 16:17:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 32416 transitions. [2019-12-07 16:17:06,748 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 32416 transitions. Word has length 55 [2019-12-07 16:17:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:06,748 INFO L462 AbstractCegarLoop]: Abstraction has 10608 states and 32416 transitions. [2019-12-07 16:17:06,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:17:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 32416 transitions. [2019-12-07 16:17:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:17:06,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:06,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:06,756 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 2 times [2019-12-07 16:17:06,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:06,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036415743] [2019-12-07 16:17:06,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:06,880 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 16:17:06,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036415743] [2019-12-07 16:17:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:06,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:17:06,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107789272] [2019-12-07 16:17:06,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:17:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:17:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:17:06,882 INFO L87 Difference]: Start difference. First operand 10608 states and 32416 transitions. Second operand 11 states. [2019-12-07 16:17:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:07,553 INFO L93 Difference]: Finished difference Result 26101 states and 80298 transitions. [2019-12-07 16:17:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 16:17:07,553 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 16:17:07,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:07,582 INFO L225 Difference]: With dead ends: 26101 [2019-12-07 16:17:07,582 INFO L226 Difference]: Without dead ends: 24767 [2019-12-07 16:17:07,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 16:17:07,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24767 states. [2019-12-07 16:17:07,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24767 to 16087. [2019-12-07 16:17:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16087 states. [2019-12-07 16:17:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16087 states to 16087 states and 49674 transitions. [2019-12-07 16:17:07,886 INFO L78 Accepts]: Start accepts. Automaton has 16087 states and 49674 transitions. Word has length 55 [2019-12-07 16:17:07,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:07,886 INFO L462 AbstractCegarLoop]: Abstraction has 16087 states and 49674 transitions. [2019-12-07 16:17:07,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:17:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16087 states and 49674 transitions. [2019-12-07 16:17:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:17:07,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:07,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:07,899 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 3 times [2019-12-07 16:17:07,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:07,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789948517] [2019-12-07 16:17:07,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:17:08,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789948517] [2019-12-07 16:17:08,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:08,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:17:08,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813974084] [2019-12-07 16:17:08,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:17:08,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:17:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:17:08,017 INFO L87 Difference]: Start difference. First operand 16087 states and 49674 transitions. Second operand 11 states. [2019-12-07 16:17:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:08,591 INFO L93 Difference]: Finished difference Result 25412 states and 77641 transitions. [2019-12-07 16:17:08,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 16:17:08,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 16:17:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:08,612 INFO L225 Difference]: With dead ends: 25412 [2019-12-07 16:17:08,612 INFO L226 Difference]: Without dead ends: 18616 [2019-12-07 16:17:08,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-07 16:17:08,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18616 states. [2019-12-07 16:17:08,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18616 to 12236. [2019-12-07 16:17:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12236 states. [2019-12-07 16:17:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12236 states to 12236 states and 36888 transitions. [2019-12-07 16:17:08,823 INFO L78 Accepts]: Start accepts. Automaton has 12236 states and 36888 transitions. Word has length 55 [2019-12-07 16:17:08,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:08,823 INFO L462 AbstractCegarLoop]: Abstraction has 12236 states and 36888 transitions. [2019-12-07 16:17:08,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:17:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12236 states and 36888 transitions. [2019-12-07 16:17:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:17:08,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:08,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:08,833 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:08,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 4 times [2019-12-07 16:17:08,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:08,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589950031] [2019-12-07 16:17:08,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:17:08,973 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 16:17:08,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589950031] [2019-12-07 16:17:08,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:17:08,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 16:17:08,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223680980] [2019-12-07 16:17:08,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:17:08,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:17:08,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:17:08,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:17:08,974 INFO L87 Difference]: Start difference. First operand 12236 states and 36888 transitions. Second operand 13 states. [2019-12-07 16:17:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:17:09,724 INFO L93 Difference]: Finished difference Result 20441 states and 60740 transitions. [2019-12-07 16:17:09,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 16:17:09,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2019-12-07 16:17:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:17:09,744 INFO L225 Difference]: With dead ends: 20441 [2019-12-07 16:17:09,744 INFO L226 Difference]: Without dead ends: 19164 [2019-12-07 16:17:09,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 16:17:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19164 states. [2019-12-07 16:17:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19164 to 11800. [2019-12-07 16:17:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11800 states. [2019-12-07 16:17:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11800 states to 11800 states and 35709 transitions. [2019-12-07 16:17:09,950 INFO L78 Accepts]: Start accepts. Automaton has 11800 states and 35709 transitions. Word has length 55 [2019-12-07 16:17:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:17:09,950 INFO L462 AbstractCegarLoop]: Abstraction has 11800 states and 35709 transitions. [2019-12-07 16:17:09,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:17:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 11800 states and 35709 transitions. [2019-12-07 16:17:09,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 16:17:09,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:17:09,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:17:09,960 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:17:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:17:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 5 times [2019-12-07 16:17:09,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:17:09,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010168274] [2019-12-07 16:17:09,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:17:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:17:10,041 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:17:10,042 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:17:10,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:17:10,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 16:17:10,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-07 16:17:10,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548) (= ~x$w_buff1~0_Out-854036548 ~x$w_buff0~0_In-854036548) (= ~x$w_buff0_used~0_In-854036548 ~x$w_buff1_used~0_Out-854036548) (= (ite (not (and (not (= (mod ~x$w_buff0_used~0_Out-854036548 256) 0)) (not (= (mod ~x$w_buff1_used~0_Out-854036548 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|) (= 1 ~x$w_buff0_used~0_Out-854036548) (= |P1Thread1of1ForFork0_#in~arg.base_In-854036548| P1Thread1of1ForFork0_~arg.base_Out-854036548) (= P1Thread1of1ForFork0_~arg.offset_Out-854036548 |P1Thread1of1ForFork0_#in~arg.offset_In-854036548|) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548)) (= 1 ~x$w_buff0~0_Out-854036548)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-854036548, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-854036548, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, ~x$w_buff1~0=~x$w_buff1~0_Out-854036548, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-854036548} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 16:17:10,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-134735910 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-134735910 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (not .cse1)) (and (= ~x~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-134735910|, ~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 16:17:10,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1651096095 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1651096095| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1651096095 |P2Thread1of1ForFork1_#t~ite34_Out1651096095|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1651096095|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 16:17:10,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1521275523 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1521275523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:17:10,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-2069088854 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2069088854 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2069088854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:17:10,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:17:10,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In432764255 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In432764255 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| ~x$r_buff1_thd2~0_In432764255)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:17:10,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:17:10,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-520889407 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520889407 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-520889407 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-520889407 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-520889407 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite11_Out-520889407| |P0Thread1of1ForFork2_#t~ite12_Out-520889407|) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite11_In-520889407| |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) (not .cse1) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite12_Out-520889407|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-520889407|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:17:10,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-167876085 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-167876085 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-167876085 256) 0)) (= (mod ~x$w_buff0_used~0_In-167876085 256) 0) (and (= (mod ~x$w_buff1_used~0_In-167876085 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite14_Out-167876085| |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) .cse1 (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite14_Out-167876085|)) (and (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) (= |P0Thread1of1ForFork2_#t~ite14_In-167876085| |P0Thread1of1ForFork2_#t~ite14_Out-167876085|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-167876085|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:17:10,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1115521006 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| ~x$w_buff1_used~0_In1115521006)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1115521006 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1115521006 256))) (= 0 (mod ~x$w_buff0_used~0_In1115521006 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256))))) (= ~x$w_buff1_used~0_In1115521006 |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1115521006|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 16:17:10,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 16:17:10,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-419535407 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-419535407 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-419535407 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-419535407|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 16:17:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1841090625 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1841090625 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| ~x$r_buff0_thd3~0_In-1841090625) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1841090625|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 16:17:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In922949385 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In922949385 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In922949385 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out922949385|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 16:17:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:17:10,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:17:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) (not .cse1)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1931844491 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1931844491 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1931844491 |ULTIMATE.start_main_#t~ite43_Out1931844491|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1931844491|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1931844491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 16:17:10,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1411863803 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1411863803 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1411863803 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1411863803 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 16:17:10,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1135533140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1135533140| ~x$r_buff0_thd0~0_In1135533140) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1135533140|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1135533140|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 16:17:10,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-490519094 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-490519094 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-490519094| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-490519094 |ULTIMATE.start_main_#t~ite46_Out-490519094|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-490519094|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 16:17:10,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:10,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:17:10 BasicIcfg [2019-12-07 16:17:10,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:17:10,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:17:10,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:17:10,117 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:17:10,118 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:16:28" (3/4) ... [2019-12-07 16:17:10,120 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:17:10,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= 0 |v_ULTIMATE.start_main_~#t2348~0.offset_18|) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= 0 v_~x$r_buff1_thd3~0_123) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24|)) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| 4)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2348~0.base_24|) |v_ULTIMATE.start_main_~#t2348~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2348~0.base_24| 1)) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= 0 v_~x$w_buff0_used~0_899) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2348~0.base_24|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ULTIMATE.start_main_~#t2348~0.base=|v_ULTIMATE.start_main_~#t2348~0.base_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_26|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_19|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, ULTIMATE.start_main_~#t2348~0.offset=|v_ULTIMATE.start_main_~#t2348~0.offset_18|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t2348~0.base, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2350~0.offset, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2350~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2348~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 16:17:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2349~0.offset_11| 0) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2349~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2349~0.base_13| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| 4) |v_#length_15|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2349~0.base_13|) |v_ULTIMATE.start_main_~#t2349~0.offset_11| 1)) |v_#memory_int_15|) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2349~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2349~0.base=|v_ULTIMATE.start_main_~#t2349~0.base_13|, ULTIMATE.start_main_~#t2349~0.offset=|v_ULTIMATE.start_main_~#t2349~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2349~0.base, ULTIMATE.start_main_~#t2349~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 16:17:10,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2350~0.base_13|) |v_ULTIMATE.start_main_~#t2350~0.offset_11| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2350~0.base_13|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13|) 0) (= 0 |v_ULTIMATE.start_main_~#t2350~0.offset_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2350~0.base_13| 4)) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2350~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2350~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2350~0.offset=|v_ULTIMATE.start_main_~#t2350~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2350~0.base=|v_ULTIMATE.start_main_~#t2350~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2350~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2350~0.base] because there is no mapped edge [2019-12-07 16:17:10,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548) (= ~x$w_buff1~0_Out-854036548 ~x$w_buff0~0_In-854036548) (= ~x$w_buff0_used~0_In-854036548 ~x$w_buff1_used~0_Out-854036548) (= (ite (not (and (not (= (mod ~x$w_buff0_used~0_Out-854036548 256) 0)) (not (= (mod ~x$w_buff1_used~0_Out-854036548 256) 0)))) 1 0) |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|) (= 1 ~x$w_buff0_used~0_Out-854036548) (= |P1Thread1of1ForFork0_#in~arg.base_In-854036548| P1Thread1of1ForFork0_~arg.base_Out-854036548) (= P1Thread1of1ForFork0_~arg.offset_Out-854036548 |P1Thread1of1ForFork0_#in~arg.offset_In-854036548|) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548)) (= 1 ~x$w_buff0~0_Out-854036548)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-854036548, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-854036548, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-854036548, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-854036548, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-854036548|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-854036548|, ~x$w_buff1~0=~x$w_buff1~0_Out-854036548, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-854036548|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-854036548} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 16:17:10,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-134735910 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-134735910 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (not .cse1)) (and (= ~x~0_In-134735910 |P2Thread1of1ForFork1_#t~ite32_Out-134735910|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-134735910|, ~x$w_buff1~0=~x$w_buff1~0_In-134735910, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-134735910, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-134735910, ~x~0=~x~0_In-134735910} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 16:17:10,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_27|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1651096095 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out1651096095| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1651096095 |P2Thread1of1ForFork1_#t~ite34_Out1651096095|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1651096095|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 16:17:10,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1521275523 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1521275523 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1521275523 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1521275523|) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1521275523, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1521275523|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1521275523} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 16:17:10,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-2069088854 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2069088854 |P1Thread1of1ForFork0_#t~ite29_Out-2069088854|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2069088854, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2069088854, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-2069088854|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 16:17:10,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In527582238 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out527582238 ~x$r_buff0_thd2~0_In527582238)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In527582238 256)))) (or (and (not .cse0) (= ~x$r_buff0_thd2~0_Out527582238 0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out527582238|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out527582238, ~x$w_buff0_used~0=~x$w_buff0_used~0_In527582238} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 16:17:10,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In432764255 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In432764255 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out432764255| ~x$r_buff1_thd2~0_In432764255)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In432764255, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:17:10,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 16:17:10,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-520889407 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520889407 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-520889407 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-520889407 256)) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-520889407 256)) .cse0))) (= |P0Thread1of1ForFork2_#t~ite11_Out-520889407| |P0Thread1of1ForFork2_#t~ite12_Out-520889407|) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite11_In-520889407| |P0Thread1of1ForFork2_#t~ite11_Out-520889407|) (not .cse1) (= ~x$w_buff1~0_In-520889407 |P0Thread1of1ForFork2_#t~ite12_Out-520889407|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520889407, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520889407, ~weak$$choice2~0=~weak$$choice2~0_In-520889407, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-520889407|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-520889407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520889407} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:17:10,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-167876085 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-167876085 256) 0))) (or (and .cse0 (= (mod ~x$r_buff1_thd1~0_In-167876085 256) 0)) (= (mod ~x$w_buff0_used~0_In-167876085 256) 0) (and (= (mod ~x$w_buff1_used~0_In-167876085 256) 0) .cse0))) (= |P0Thread1of1ForFork2_#t~ite14_Out-167876085| |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) .cse1 (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite14_Out-167876085|)) (and (= ~x$w_buff0_used~0_In-167876085 |P0Thread1of1ForFork2_#t~ite15_Out-167876085|) (= |P0Thread1of1ForFork2_#t~ite14_In-167876085| |P0Thread1of1ForFork2_#t~ite14_Out-167876085|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-167876085, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-167876085|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-167876085, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-167876085|, ~weak$$choice2~0=~weak$$choice2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:17:10,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1115521006 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| ~x$w_buff1_used~0_In1115521006)) (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1115521006 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1115521006 256))) (= 0 (mod ~x$w_buff0_used~0_In1115521006 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256))))) (= ~x$w_buff1_used~0_In1115521006 |P0Thread1of1ForFork2_#t~ite17_Out1115521006|) (= |P0Thread1of1ForFork2_#t~ite18_Out1115521006| |P0Thread1of1ForFork2_#t~ite17_Out1115521006|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1115521006, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1115521006|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1115521006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1115521006, ~weak$$choice2~0=~weak$$choice2~0_In1115521006, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1115521006} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 16:17:10,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_33|) (= |v_P0Thread1of1ForFork2_#t~ite22_34| |v_P0Thread1of1ForFork2_#t~ite22_33|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (= |v_P0Thread1of1ForFork2_#t~ite23_38| |v_P0Thread1of1ForFork2_#t~ite23_37|) (not (= 0 (mod v_~weak$$choice2~0_142 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_38|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_34|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_33|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_37|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_33|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 16:17:10,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-419535407 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-419535407 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-419535407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-419535407 |P2Thread1of1ForFork1_#t~ite35_Out-419535407|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-419535407|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-419535407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-419535407, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 16:17:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1841090625 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1841090625 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1841090625| ~x$r_buff0_thd3~0_In-1841090625) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1841090625|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1841090625, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1841090625} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 16:17:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In922949385 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In922949385 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In922949385 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In922949385 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd3~0_In922949385 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out922949385|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out922949385|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In922949385, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In922949385, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In922949385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922949385} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 16:17:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_38|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:17:10,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_39) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:17:10,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out262501188| ~x$w_buff1~0_In262501188) (not .cse1)) (and (= ~x~0_In262501188 |ULTIMATE.start_main_#t~ite41_Out262501188|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out262501188|, ~x$w_buff1~0=~x$w_buff1~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x~0=~x~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 16:17:10,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 16:17:10,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1931844491 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1931844491 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1931844491 |ULTIMATE.start_main_#t~ite43_Out1931844491|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out1931844491|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931844491, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1931844491|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931844491} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 16:17:10,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1411863803 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1411863803 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1411863803 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1411863803 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1411863803 |ULTIMATE.start_main_#t~ite44_Out-1411863803|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1411863803, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1411863803, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1411863803, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1411863803|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1411863803} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 16:17:10,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1135533140 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1135533140 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1135533140| ~x$r_buff0_thd0~0_In1135533140) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1135533140|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135533140, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1135533140|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135533140} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 16:17:10,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-490519094 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-490519094 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-490519094 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-490519094 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-490519094| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-490519094 |ULTIMATE.start_main_#t~ite46_Out-490519094|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-490519094, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-490519094|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-490519094, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-490519094, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-490519094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 16:17:10,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:17:10,198 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bccd17a7-911c-46d6-b8c1-08b4c6b5a830/bin/uautomizer/witness.graphml [2019-12-07 16:17:10,198 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:17:10,199 INFO L168 Benchmark]: Toolchain (without parser) took 42380.90 ms. Allocated memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: 3.2 GB). Free memory was 940.8 MB in the beginning and 1.0 GB in the end (delta: -72.5 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,199 INFO L168 Benchmark]: CDTParser took 0.19 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 16:17:10,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,200 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:17:10,201 INFO L168 Benchmark]: RCFGBuilder took 404.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,201 INFO L168 Benchmark]: TraceAbstraction took 41443.91 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,201 INFO L168 Benchmark]: Witness Printer took 80.91 ms. Allocated memory is still 4.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:17:10,203 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.19 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 374.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -125.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 404.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41443.91 ms. Allocated memory was 1.1 GB in the beginning and 4.2 GB in the end (delta: 3.1 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -56.2 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 80.91 ms. Allocated memory is still 4.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2348, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t2349, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] FCALL, FORK 0 pthread_create(&t2350, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L741] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L742] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L743] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L744] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L745] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L747] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L833] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 41.2s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3731 SDtfs, 5709 SDslu, 11920 SDs, 0 SdLazy, 6122 SolverSat, 216 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 25 SyntacticMatches, 20 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 107825 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 738 NumberOfCodeBlocks, 738 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 152201 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...