./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe024_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe024_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/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 d04840819a516da9026423f1cf57c568b18037b6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 14:41:32,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:41:32,336 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:41:32,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:41:32,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:41:32,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:41:32,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:41:32,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:41:32,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:41:32,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:41:32,350 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:41:32,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:41:32,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:41:32,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:41:32,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:41:32,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:41:32,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:41:32,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:41:32,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:41:32,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:41:32,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:41:32,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:41:32,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:41:32,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:41:32,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:41:32,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:41:32,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:41:32,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:41:32,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:41:32,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:41:32,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:41:32,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:41:32,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:41:32,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:41:32,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:41:32,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:41:32,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:41:32,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:41:32,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:41:32,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:41:32,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:41:32,368 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:41:32,377 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:41:32,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:41:32,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:41:32,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:41:32,378 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:41:32,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:41:32,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:41:32,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:41:32,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:41:32,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:41:32,381 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:41:32,382 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_11da0536-7d2d-4635-90a3-7009e5e570f5/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 -> d04840819a516da9026423f1cf57c568b18037b6 [2019-12-07 14:41:32,481 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:41:32,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:41:32,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:41:32,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:41:32,495 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:41:32,496 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe024_pso.opt.i [2019-12-07 14:41:32,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/data/b8f7eb7e8/754c38d42c654b8096b4f9bf0c471bcb/FLAGb96d93445 [2019-12-07 14:41:32,974 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:41:32,975 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/sv-benchmarks/c/pthread-wmm/safe024_pso.opt.i [2019-12-07 14:41:32,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/data/b8f7eb7e8/754c38d42c654b8096b4f9bf0c471bcb/FLAGb96d93445 [2019-12-07 14:41:33,333 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/data/b8f7eb7e8/754c38d42c654b8096b4f9bf0c471bcb [2019-12-07 14:41:33,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:41:33,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:41:33,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:33,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:41:33,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:41:33,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33, skipping insertion in model container [2019-12-07 14:41:33,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:41:33,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:41:33,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:33,643 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:41:33,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:41:33,726 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:41:33,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33 WrapperNode [2019-12-07 14:41:33,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:41:33,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:33,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:41:33,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:41:33,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:41:33,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:41:33,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:41:33,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:41:33,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... [2019-12-07 14:41:33,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:41:33,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:41:33,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:41:33,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:41:33,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/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 14:41:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:41:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:41:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:41:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:41:33,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:41:33,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:41:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:41:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:41:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:41:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:41:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:41:33,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:41:33,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:41:33,829 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 14:41:34,166 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:41:34,166 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:41:34,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:34 BoogieIcfgContainer [2019-12-07 14:41:34,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:41:34,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:41:34,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:41:34,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:41:34,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:41:33" (1/3) ... [2019-12-07 14:41:34,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a09aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:34, skipping insertion in model container [2019-12-07 14:41:34,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:41:33" (2/3) ... [2019-12-07 14:41:34,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a09aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:41:34, skipping insertion in model container [2019-12-07 14:41:34,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:34" (3/3) ... [2019-12-07 14:41:34,172 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_pso.opt.i [2019-12-07 14:41:34,178 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:41:34,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:41:34,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:41:34,184 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:41:34,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:41:34,253 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:41:34,253 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:41:34,253 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:41:34,253 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:41:34,253 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:41:34,253 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:41:34,254 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:41:34,254 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:41:34,264 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 14:41:34,265 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:41:34,316 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:41:34,316 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:41:34,326 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 14:41:34,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 14:41:34,369 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 14:41:34,370 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:41:34,374 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 14:41:34,390 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 14:41:34,390 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:41:37,470 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 14:41:37,568 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-07 14:41:37,568 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 14:41:37,570 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-07 14:41:47,636 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-07 14:41:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-07 14:41:47,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 14:41:47,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:47,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 14:41:47,642 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 14:41:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-07 14:41:47,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:47,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921882350] [2019-12-07 14:41:47,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:47,793 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 14:41:47,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921882350] [2019-12-07 14:41:47,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:47,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:41:47,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825545908] [2019-12-07 14:41:47,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:41:47,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:47,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:41:47,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:41:47,808 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-07 14:41:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:48,377 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-07 14:41:48,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:41:48,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 14:41:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:48,779 INFO L225 Difference]: With dead ends: 87834 [2019-12-07 14:41:48,779 INFO L226 Difference]: Without dead ends: 82738 [2019-12-07 14:41:48,780 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 14:41:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-07 14:41:53,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-07 14:41:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-07 14:41:53,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-07 14:41:53,629 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-07 14:41:53,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:53,629 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-07 14:41:53,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:41:53,630 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-07 14:41:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:41:53,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:53,636 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:53,636 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 14:41:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-07 14:41:53,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:41:53,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612260354] [2019-12-07 14:41:53,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:41:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:53,709 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 14:41:53,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612260354] [2019-12-07 14:41:53,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:53,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:41:53,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929285595] [2019-12-07 14:41:53,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:41:53,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:41:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:41:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:41:53,711 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-07 14:41:54,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:54,446 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-07 14:41:54,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:41:54,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:41:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:54,866 INFO L225 Difference]: With dead ends: 127286 [2019-12-07 14:41:54,866 INFO L226 Difference]: Without dead ends: 127202 [2019-12-07 14:41:54,867 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 14:42:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-07 14:42:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-07 14:42:02,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-07 14:42:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-07 14:42:02,648 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-07 14:42:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:02,649 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-07 14:42:02,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-07 14:42:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:42:02,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:02,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:02,652 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 14:42:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-07 14:42:02,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:02,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059222685] [2019-12-07 14:42:02,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:02,689 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 14:42:02,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059222685] [2019-12-07 14:42:02,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:02,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:02,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508256791] [2019-12-07 14:42:02,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:42:02,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:02,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:42:02,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:42:02,691 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-07 14:42:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:02,777 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-07 14:42:02,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:42:02,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 14:42:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:02,823 INFO L225 Difference]: With dead ends: 28492 [2019-12-07 14:42:02,824 INFO L226 Difference]: Without dead ends: 28492 [2019-12-07 14:42:02,824 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 14:42:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-07 14:42:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-07 14:42:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-07 14:42:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-07 14:42:03,322 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-07 14:42:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:03,322 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-07 14:42:03,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:42:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-07 14:42:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:42:03,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:03,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:03,324 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 14:42:03,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:03,324 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-07 14:42:03,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:03,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842402657] [2019-12-07 14:42:03,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:03,380 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 14:42:03,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842402657] [2019-12-07 14:42:03,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:03,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:42:03,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806020521] [2019-12-07 14:42:03,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:42:03,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:42:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:03,381 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-07 14:42:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:03,679 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-07 14:42:03,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:42:03,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:42:03,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:03,741 INFO L225 Difference]: With dead ends: 41156 [2019-12-07 14:42:03,742 INFO L226 Difference]: Without dead ends: 41141 [2019-12-07 14:42:03,742 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 14:42:03,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-07 14:42:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-07 14:42:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-07 14:42:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-07 14:42:04,350 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-07 14:42:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:04,351 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-07 14:42:04,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:42:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-07 14:42:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:42:04,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:04,358 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 14:42:04,358 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 14:42:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-07 14:42:04,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:04,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318376035] [2019-12-07 14:42:04,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:04,434 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 14:42:04,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318376035] [2019-12-07 14:42:04,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:04,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:42:04,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082398086] [2019-12-07 14:42:04,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:42:04,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:04,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:42:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:42:04,435 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-07 14:42:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:04,967 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-07 14:42:04,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:42:04,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:42:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:05,038 INFO L225 Difference]: With dead ends: 48363 [2019-12-07 14:42:05,038 INFO L226 Difference]: Without dead ends: 48336 [2019-12-07 14:42:05,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:42:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-07 14:42:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-07 14:42:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-07 14:42:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-07 14:42:05,921 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-07 14:42:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:05,921 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-07 14:42:05,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:42:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-07 14:42:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:42:05,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:05,933 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 14:42:05,933 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 14:42:05,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-07 14:42:05,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:05,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413869259] [2019-12-07 14:42:05,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:06,005 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 14:42:06,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413869259] [2019-12-07 14:42:06,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:06,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:42:06,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026210444] [2019-12-07 14:42:06,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:42:06,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:42:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:06,007 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 5 states. [2019-12-07 14:42:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:06,351 INFO L93 Difference]: Finished difference Result 44326 states and 144194 transitions. [2019-12-07 14:42:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:42:06,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:42:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:06,416 INFO L225 Difference]: With dead ends: 44326 [2019-12-07 14:42:06,416 INFO L226 Difference]: Without dead ends: 44303 [2019-12-07 14:42:06,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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 14:42:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44303 states. [2019-12-07 14:42:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44303 to 37268. [2019-12-07 14:42:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37268 states. [2019-12-07 14:42:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37268 states to 37268 states and 122134 transitions. [2019-12-07 14:42:07,099 INFO L78 Accepts]: Start accepts. Automaton has 37268 states and 122134 transitions. Word has length 25 [2019-12-07 14:42:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:07,099 INFO L462 AbstractCegarLoop]: Abstraction has 37268 states and 122134 transitions. [2019-12-07 14:42:07,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:42:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 37268 states and 122134 transitions. [2019-12-07 14:42:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:42:07,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:07,112 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 14:42:07,112 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 14:42:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -353872392, now seen corresponding path program 1 times [2019-12-07 14:42:07,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:07,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201144798] [2019-12-07 14:42:07,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:07,145 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 14:42:07,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201144798] [2019-12-07 14:42:07,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:07,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:42:07,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119378880] [2019-12-07 14:42:07,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:07,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:07,146 INFO L87 Difference]: Start difference. First operand 37268 states and 122134 transitions. Second operand 4 states. [2019-12-07 14:42:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:07,194 INFO L93 Difference]: Finished difference Result 13778 states and 41802 transitions. [2019-12-07 14:42:07,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:42:07,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 14:42:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:07,210 INFO L225 Difference]: With dead ends: 13778 [2019-12-07 14:42:07,211 INFO L226 Difference]: Without dead ends: 13778 [2019-12-07 14:42:07,211 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 14:42:07,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2019-12-07 14:42:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 13498. [2019-12-07 14:42:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13498 states. [2019-12-07 14:42:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13498 states to 13498 states and 40957 transitions. [2019-12-07 14:42:07,401 INFO L78 Accepts]: Start accepts. Automaton has 13498 states and 40957 transitions. Word has length 27 [2019-12-07 14:42:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:07,401 INFO L462 AbstractCegarLoop]: Abstraction has 13498 states and 40957 transitions. [2019-12-07 14:42:07,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 13498 states and 40957 transitions. [2019-12-07 14:42:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:42:07,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:07,419 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 14:42:07,419 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 14:42:07,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:07,419 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-07 14:42:07,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:07,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903964213] [2019-12-07 14:42:07,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:07,515 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 14:42:07,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903964213] [2019-12-07 14:42:07,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:07,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:42:07,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814111905] [2019-12-07 14:42:07,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:42:07,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:42:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:42:07,516 INFO L87 Difference]: Start difference. First operand 13498 states and 40957 transitions. Second operand 7 states. [2019-12-07 14:42:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:08,226 INFO L93 Difference]: Finished difference Result 16601 states and 49016 transitions. [2019-12-07 14:42:08,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 14:42:08,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-07 14:42:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:08,247 INFO L225 Difference]: With dead ends: 16601 [2019-12-07 14:42:08,247 INFO L226 Difference]: Without dead ends: 16597 [2019-12-07 14:42:08,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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 14:42:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16597 states. [2019-12-07 14:42:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16597 to 12946. [2019-12-07 14:42:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12946 states. [2019-12-07 14:42:08,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12946 states to 12946 states and 39222 transitions. [2019-12-07 14:42:08,448 INFO L78 Accepts]: Start accepts. Automaton has 12946 states and 39222 transitions. Word has length 39 [2019-12-07 14:42:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:08,448 INFO L462 AbstractCegarLoop]: Abstraction has 12946 states and 39222 transitions. [2019-12-07 14:42:08,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:42:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 12946 states and 39222 transitions. [2019-12-07 14:42:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:42:08,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:08,464 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 14:42:08,464 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 14:42:08,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1774277701, now seen corresponding path program 1 times [2019-12-07 14:42:08,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:08,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200085390] [2019-12-07 14:42:08,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:08,522 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 14:42:08,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200085390] [2019-12-07 14:42:08,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:08,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:42:08,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760897660] [2019-12-07 14:42:08,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:42:08,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:08,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:42:08,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:08,523 INFO L87 Difference]: Start difference. First operand 12946 states and 39222 transitions. Second operand 5 states. [2019-12-07 14:42:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:08,929 INFO L93 Difference]: Finished difference Result 19034 states and 57002 transitions. [2019-12-07 14:42:08,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:42:08,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:42:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:08,956 INFO L225 Difference]: With dead ends: 19034 [2019-12-07 14:42:08,956 INFO L226 Difference]: Without dead ends: 19034 [2019-12-07 14:42:08,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:42:09,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-07 14:42:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 15717. [2019-12-07 14:42:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15717 states. [2019-12-07 14:42:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15717 states to 15717 states and 47503 transitions. [2019-12-07 14:42:09,197 INFO L78 Accepts]: Start accepts. Automaton has 15717 states and 47503 transitions. Word has length 39 [2019-12-07 14:42:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:09,197 INFO L462 AbstractCegarLoop]: Abstraction has 15717 states and 47503 transitions. [2019-12-07 14:42:09,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:42:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 15717 states and 47503 transitions. [2019-12-07 14:42:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 14:42:09,217 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:09,217 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 14:42:09,217 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 14:42:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1954391675, now seen corresponding path program 2 times [2019-12-07 14:42:09,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:09,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407109763] [2019-12-07 14:42:09,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:09,265 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 14:42:09,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407109763] [2019-12-07 14:42:09,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:09,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:42:09,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032957910] [2019-12-07 14:42:09,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:42:09,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:09,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:42:09,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:09,266 INFO L87 Difference]: Start difference. First operand 15717 states and 47503 transitions. Second operand 5 states. [2019-12-07 14:42:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:09,368 INFO L93 Difference]: Finished difference Result 14082 states and 43435 transitions. [2019-12-07 14:42:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:42:09,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 14:42:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:09,383 INFO L225 Difference]: With dead ends: 14082 [2019-12-07 14:42:09,383 INFO L226 Difference]: Without dead ends: 14082 [2019-12-07 14:42:09,383 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 14:42:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14082 states. [2019-12-07 14:42:09,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14082 to 12941. [2019-12-07 14:42:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12941 states. [2019-12-07 14:42:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12941 states to 12941 states and 40108 transitions. [2019-12-07 14:42:09,576 INFO L78 Accepts]: Start accepts. Automaton has 12941 states and 40108 transitions. Word has length 39 [2019-12-07 14:42:09,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:09,576 INFO L462 AbstractCegarLoop]: Abstraction has 12941 states and 40108 transitions. [2019-12-07 14:42:09,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:42:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 12941 states and 40108 transitions. [2019-12-07 14:42:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 14:42:09,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:09,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:42:09,591 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 14:42:09,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:09,591 INFO L82 PathProgramCache]: Analyzing trace with hash 613531453, now seen corresponding path program 1 times [2019-12-07 14:42:09,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:09,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528017802] [2019-12-07 14:42:09,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:09,636 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 14:42:09,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528017802] [2019-12-07 14:42:09,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:09,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:09,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722701496] [2019-12-07 14:42:09,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:42:09,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:42:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:42:09,637 INFO L87 Difference]: Start difference. First operand 12941 states and 40108 transitions. Second operand 3 states. [2019-12-07 14:42:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:09,673 INFO L93 Difference]: Finished difference Result 12939 states and 40103 transitions. [2019-12-07 14:42:09,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:42:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-07 14:42:09,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:09,688 INFO L225 Difference]: With dead ends: 12939 [2019-12-07 14:42:09,688 INFO L226 Difference]: Without dead ends: 12939 [2019-12-07 14:42:09,688 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 14:42:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12939 states. [2019-12-07 14:42:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12939 to 12183. [2019-12-07 14:42:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12183 states. [2019-12-07 14:42:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12183 states to 12183 states and 37978 transitions. [2019-12-07 14:42:09,861 INFO L78 Accepts]: Start accepts. Automaton has 12183 states and 37978 transitions. Word has length 53 [2019-12-07 14:42:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:09,862 INFO L462 AbstractCegarLoop]: Abstraction has 12183 states and 37978 transitions. [2019-12-07 14:42:09,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:42:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 12183 states and 37978 transitions. [2019-12-07 14:42:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:09,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:09,873 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 14:42:09,873 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 14:42:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 565519894, now seen corresponding path program 1 times [2019-12-07 14:42:09,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:09,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314591046] [2019-12-07 14:42:09,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:09,942 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 14:42:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314591046] [2019-12-07 14:42:09,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:09,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:42:09,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196320848] [2019-12-07 14:42:09,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:42:09,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:42:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:09,943 INFO L87 Difference]: Start difference. First operand 12183 states and 37978 transitions. Second operand 5 states. [2019-12-07 14:42:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:10,239 INFO L93 Difference]: Finished difference Result 17234 states and 53098 transitions. [2019-12-07 14:42:10,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:42:10,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-07 14:42:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:10,258 INFO L225 Difference]: With dead ends: 17234 [2019-12-07 14:42:10,258 INFO L226 Difference]: Without dead ends: 17234 [2019-12-07 14:42:10,258 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 14:42:10,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17234 states. [2019-12-07 14:42:10,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17234 to 14837. [2019-12-07 14:42:10,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14837 states. [2019-12-07 14:42:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14837 states to 14837 states and 46243 transitions. [2019-12-07 14:42:10,493 INFO L78 Accepts]: Start accepts. Automaton has 14837 states and 46243 transitions. Word has length 54 [2019-12-07 14:42:10,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:10,493 INFO L462 AbstractCegarLoop]: Abstraction has 14837 states and 46243 transitions. [2019-12-07 14:42:10,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:42:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14837 states and 46243 transitions. [2019-12-07 14:42:10,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:10,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:10,507 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 14:42:10,507 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 14:42:10,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:10,508 INFO L82 PathProgramCache]: Analyzing trace with hash 95954180, now seen corresponding path program 2 times [2019-12-07 14:42:10,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:10,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013460232] [2019-12-07 14:42:10,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:10,565 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 14:42:10,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013460232] [2019-12-07 14:42:10,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:10,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:42:10,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606480684] [2019-12-07 14:42:10,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:42:10,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:10,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:42:10,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:42:10,566 INFO L87 Difference]: Start difference. First operand 14837 states and 46243 transitions. Second operand 4 states. [2019-12-07 14:42:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:10,638 INFO L93 Difference]: Finished difference Result 26869 states and 83824 transitions. [2019-12-07 14:42:10,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:42:10,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 14:42:10,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:10,653 INFO L225 Difference]: With dead ends: 26869 [2019-12-07 14:42:10,653 INFO L226 Difference]: Without dead ends: 12613 [2019-12-07 14:42:10,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:42:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12613 states. [2019-12-07 14:42:10,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12613 to 12613. [2019-12-07 14:42:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12613 states. [2019-12-07 14:42:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12613 states to 12613 states and 39191 transitions. [2019-12-07 14:42:10,834 INFO L78 Accepts]: Start accepts. Automaton has 12613 states and 39191 transitions. Word has length 54 [2019-12-07 14:42:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:10,834 INFO L462 AbstractCegarLoop]: Abstraction has 12613 states and 39191 transitions. [2019-12-07 14:42:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:42:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12613 states and 39191 transitions. [2019-12-07 14:42:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:10,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:10,847 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 14:42:10,847 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 14:42:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:10,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1323271516, now seen corresponding path program 3 times [2019-12-07 14:42:10,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:10,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829608983] [2019-12-07 14:42:10,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:10,926 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 14:42:10,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829608983] [2019-12-07 14:42:10,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:10,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 14:42:10,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30024275] [2019-12-07 14:42:10,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:42:10,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:42:10,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:42:10,927 INFO L87 Difference]: Start difference. First operand 12613 states and 39191 transitions. Second operand 7 states. [2019-12-07 14:42:11,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:11,544 INFO L93 Difference]: Finished difference Result 18101 states and 54949 transitions. [2019-12-07 14:42:11,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 14:42:11,545 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 14:42:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:11,564 INFO L225 Difference]: With dead ends: 18101 [2019-12-07 14:42:11,564 INFO L226 Difference]: Without dead ends: 18101 [2019-12-07 14:42:11,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:42:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18101 states. [2019-12-07 14:42:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18101 to 13255. [2019-12-07 14:42:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13255 states. [2019-12-07 14:42:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13255 states to 13255 states and 41064 transitions. [2019-12-07 14:42:11,789 INFO L78 Accepts]: Start accepts. Automaton has 13255 states and 41064 transitions. Word has length 54 [2019-12-07 14:42:11,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:11,790 INFO L462 AbstractCegarLoop]: Abstraction has 13255 states and 41064 transitions. [2019-12-07 14:42:11,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:42:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 13255 states and 41064 transitions. [2019-12-07 14:42:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:11,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:11,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:42:11,804 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 14:42:11,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash -229144546, now seen corresponding path program 4 times [2019-12-07 14:42:11,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:11,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025729086] [2019-12-07 14:42:11,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:11,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:11,863 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 14:42:11,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025729086] [2019-12-07 14:42:11,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:11,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:42:11,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115802075] [2019-12-07 14:42:11,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:42:11,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:11,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:42:11,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:42:11,864 INFO L87 Difference]: Start difference. First operand 13255 states and 41064 transitions. Second operand 7 states. [2019-12-07 14:42:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:12,101 INFO L93 Difference]: Finished difference Result 31843 states and 97787 transitions. [2019-12-07 14:42:12,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:42:12,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 14:42:12,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:12,127 INFO L225 Difference]: With dead ends: 31843 [2019-12-07 14:42:12,127 INFO L226 Difference]: Without dead ends: 23881 [2019-12-07 14:42:12,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:42:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23881 states. [2019-12-07 14:42:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23881 to 15324. [2019-12-07 14:42:12,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15324 states. [2019-12-07 14:42:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15324 states to 15324 states and 47480 transitions. [2019-12-07 14:42:12,420 INFO L78 Accepts]: Start accepts. Automaton has 15324 states and 47480 transitions. Word has length 54 [2019-12-07 14:42:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:12,420 INFO L462 AbstractCegarLoop]: Abstraction has 15324 states and 47480 transitions. [2019-12-07 14:42:12,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:42:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15324 states and 47480 transitions. [2019-12-07 14:42:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:12,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:12,434 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 14:42:12,434 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 14:42:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:12,435 INFO L82 PathProgramCache]: Analyzing trace with hash -333290850, now seen corresponding path program 5 times [2019-12-07 14:42:12,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:12,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664378504] [2019-12-07 14:42:12,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:12,497 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 14:42:12,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664378504] [2019-12-07 14:42:12,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:12,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 14:42:12,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774597708] [2019-12-07 14:42:12,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:42:12,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:12,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:42:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:42:12,499 INFO L87 Difference]: Start difference. First operand 15324 states and 47480 transitions. Second operand 7 states. [2019-12-07 14:42:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:12,753 INFO L93 Difference]: Finished difference Result 34229 states and 104176 transitions. [2019-12-07 14:42:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:42:12,754 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-07 14:42:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:12,783 INFO L225 Difference]: With dead ends: 34229 [2019-12-07 14:42:12,783 INFO L226 Difference]: Without dead ends: 24802 [2019-12-07 14:42:12,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:42:12,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24802 states. [2019-12-07 14:42:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24802 to 17163. [2019-12-07 14:42:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17163 states. [2019-12-07 14:42:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17163 states to 17163 states and 52962 transitions. [2019-12-07 14:42:13,108 INFO L78 Accepts]: Start accepts. Automaton has 17163 states and 52962 transitions. Word has length 54 [2019-12-07 14:42:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:13,108 INFO L462 AbstractCegarLoop]: Abstraction has 17163 states and 52962 transitions. [2019-12-07 14:42:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:42:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17163 states and 52962 transitions. [2019-12-07 14:42:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:42:13,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:13,123 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 14:42:13,123 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 14:42:13,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1705682102, now seen corresponding path program 6 times [2019-12-07 14:42:13,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:13,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823707697] [2019-12-07 14:42:13,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:13,162 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 14:42:13,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823707697] [2019-12-07 14:42:13,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:13,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:42:13,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013476032] [2019-12-07 14:42:13,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:42:13,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:42:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:42:13,163 INFO L87 Difference]: Start difference. First operand 17163 states and 52962 transitions. Second operand 3 states. [2019-12-07 14:42:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:13,210 INFO L93 Difference]: Finished difference Result 12207 states and 37267 transitions. [2019-12-07 14:42:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:42:13,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-07 14:42:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:13,228 INFO L225 Difference]: With dead ends: 12207 [2019-12-07 14:42:13,228 INFO L226 Difference]: Without dead ends: 12207 [2019-12-07 14:42:13,228 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 14:42:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12207 states. [2019-12-07 14:42:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12207 to 11826. [2019-12-07 14:42:13,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11826 states. [2019-12-07 14:42:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11826 states to 11826 states and 36080 transitions. [2019-12-07 14:42:13,397 INFO L78 Accepts]: Start accepts. Automaton has 11826 states and 36080 transitions. Word has length 54 [2019-12-07 14:42:13,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:13,398 INFO L462 AbstractCegarLoop]: Abstraction has 11826 states and 36080 transitions. [2019-12-07 14:42:13,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:42:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 11826 states and 36080 transitions. [2019-12-07 14:42:13,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:42:13,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:13,407 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 14:42:13,408 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 14:42:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-07 14:42:13,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:13,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682345228] [2019-12-07 14:42:13,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:13,556 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 14:42:13,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682345228] [2019-12-07 14:42:13,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:13,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:42:13,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974845199] [2019-12-07 14:42:13,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:42:13,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:42:13,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:42:13,557 INFO L87 Difference]: Start difference. First operand 11826 states and 36080 transitions. Second operand 11 states. [2019-12-07 14:42:14,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:14,186 INFO L93 Difference]: Finished difference Result 23364 states and 71389 transitions. [2019-12-07 14:42:14,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 14:42:14,186 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:42:14,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:14,210 INFO L225 Difference]: With dead ends: 23364 [2019-12-07 14:42:14,210 INFO L226 Difference]: Without dead ends: 22798 [2019-12-07 14:42:14,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:42:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22798 states. [2019-12-07 14:42:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22798 to 15156. [2019-12-07 14:42:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15156 states. [2019-12-07 14:42:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15156 states to 15156 states and 46308 transitions. [2019-12-07 14:42:14,488 INFO L78 Accepts]: Start accepts. Automaton has 15156 states and 46308 transitions. Word has length 55 [2019-12-07 14:42:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:14,488 INFO L462 AbstractCegarLoop]: Abstraction has 15156 states and 46308 transitions. [2019-12-07 14:42:14,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:42:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 15156 states and 46308 transitions. [2019-12-07 14:42:14,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:42:14,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:14,502 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 14:42:14,502 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 14:42:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:14,503 INFO L82 PathProgramCache]: Analyzing trace with hash 621327827, now seen corresponding path program 2 times [2019-12-07 14:42:14,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:14,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205719477] [2019-12-07 14:42:14,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:14,635 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 14:42:14,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205719477] [2019-12-07 14:42:14,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:14,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:42:14,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356859933] [2019-12-07 14:42:14,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:42:14,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:14,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:42:14,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:42:14,636 INFO L87 Difference]: Start difference. First operand 15156 states and 46308 transitions. Second operand 11 states. [2019-12-07 14:42:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:15,269 INFO L93 Difference]: Finished difference Result 23318 states and 70746 transitions. [2019-12-07 14:42:15,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:42:15,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-07 14:42:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:15,291 INFO L225 Difference]: With dead ends: 23318 [2019-12-07 14:42:15,291 INFO L226 Difference]: Without dead ends: 17698 [2019-12-07 14:42:15,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2019-12-07 14:42:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17698 states. [2019-12-07 14:42:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17698 to 11862. [2019-12-07 14:42:15,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11862 states. [2019-12-07 14:42:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11862 states to 11862 states and 35772 transitions. [2019-12-07 14:42:15,494 INFO L78 Accepts]: Start accepts. Automaton has 11862 states and 35772 transitions. Word has length 55 [2019-12-07 14:42:15,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:15,495 INFO L462 AbstractCegarLoop]: Abstraction has 11862 states and 35772 transitions. [2019-12-07 14:42:15,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:42:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11862 states and 35772 transitions. [2019-12-07 14:42:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:42:15,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:15,505 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 14:42:15,505 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 14:42:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-07 14:42:15,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:15,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073424690] [2019-12-07 14:42:15,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:42:15,635 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 14:42:15,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073424690] [2019-12-07 14:42:15,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:42:15,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:42:15,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321342846] [2019-12-07 14:42:15,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:42:15,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:42:15,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:42:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:42:15,636 INFO L87 Difference]: Start difference. First operand 11862 states and 35772 transitions. Second operand 12 states. [2019-12-07 14:42:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:42:16,222 INFO L93 Difference]: Finished difference Result 18072 states and 54171 transitions. [2019-12-07 14:42:16,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 14:42:16,222 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 14:42:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:42:16,241 INFO L225 Difference]: With dead ends: 18072 [2019-12-07 14:42:16,241 INFO L226 Difference]: Without dead ends: 17508 [2019-12-07 14:42:16,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2019-12-07 14:42:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17508 states. [2019-12-07 14:42:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17508 to 11544. [2019-12-07 14:42:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11544 states. [2019-12-07 14:42:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11544 states to 11544 states and 34908 transitions. [2019-12-07 14:42:16,445 INFO L78 Accepts]: Start accepts. Automaton has 11544 states and 34908 transitions. Word has length 55 [2019-12-07 14:42:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:42:16,445 INFO L462 AbstractCegarLoop]: Abstraction has 11544 states and 34908 transitions. [2019-12-07 14:42:16,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:42:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 11544 states and 34908 transitions. [2019-12-07 14:42:16,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:42:16,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:42:16,455 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 14:42:16,455 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:42:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:42:16,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 4 times [2019-12-07 14:42:16,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:42:16,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852067033] [2019-12-07 14:42:16,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:42:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:42:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:42:16,521 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:42:16,521 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:42:16,523 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 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24|)) (= 0 v_~x$w_buff1_used~0_531) (= 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) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_18|) (= 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) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2354~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24| 1)) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24|) |v_ULTIMATE.start_main_~#t2354~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| 4)) (= 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_~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, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_19|, ~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_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_24|, #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, ~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|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_19|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_26|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #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, ULTIMATE.start_main_~#t2355~0.offset, ~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_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~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, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #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 14:42:16,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#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|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-07 14:42:16,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-07 14:42:16,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0_used~0_In1210292619 ~x$w_buff1_used~0_Out1210292619) (= |P1Thread1of1ForFork0_#in~arg.offset_In1210292619| P1Thread1of1ForFork0_~arg.offset_Out1210292619) (= ~x$w_buff1~0_Out1210292619 ~x$w_buff0~0_In1210292619) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619)) (= 1 ~x$w_buff0_used~0_Out1210292619) (= P1Thread1of1ForFork0_~arg.base_Out1210292619 |P1Thread1of1ForFork0_#in~arg.base_In1210292619|) (= ~x$w_buff0~0_Out1210292619 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out1210292619 256))) (not (= (mod ~x$w_buff0_used~0_Out1210292619 256) 0)))) 1 0)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1210292619, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1210292619|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1210292619|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1210292619} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1210292619, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1210292619, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1210292619, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1210292619|, ~x$w_buff1~0=~x$w_buff1~0_Out1210292619, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1210292619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1210292619, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1210292619} 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 14:42:16,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-126640001 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-126640001 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-126640001 |P2Thread1of1ForFork1_#t~ite32_Out-126640001|)) (and (not .cse1) (= ~x$w_buff1~0_In-126640001 |P2Thread1of1ForFork1_#t~ite32_Out-126640001|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-126640001, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-126640001, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126640001, ~x~0=~x~0_In-126640001} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-126640001|, ~x$w_buff1~0=~x$w_buff1~0_In-126640001, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-126640001, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126640001, ~x~0=~x~0_In-126640001} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:42:16,526 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 14:42:16,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2096769610 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2096769610 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out2096769610| 0)) (and (= ~x$w_buff0_used~0_In2096769610 |P2Thread1of1ForFork1_#t~ite34_Out2096769610|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096769610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096769610} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2096769610|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096769610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096769610} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:42:16,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-226801791 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-226801791 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-226801791| ~x$w_buff0_used~0_In-226801791) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-226801791| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-226801791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:42:16,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1214179106 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1214179106 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1214179106 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1214179106| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1214179106| ~x$w_buff1_used~0_In-1214179106)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1214179106, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1214179106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214179106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214179106} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1214179106, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1214179106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214179106, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1214179106|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214179106} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:42:16,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out528227422 ~x$r_buff0_thd2~0_In528227422)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In528227422 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In528227422 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~x$r_buff0_thd2~0_Out528227422 0) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out528227422|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:42:16,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1997755319 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1997755319 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1997755319 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1997755319 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1997755319|)) (and (= ~x$r_buff1_thd2~0_In1997755319 |P1Thread1of1ForFork0_#t~ite31_Out1997755319|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1997755319, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1997755319, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997755319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997755319} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1997755319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1997755319, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1997755319, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997755319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997755319} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:42:16,528 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 14:42:16,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1762638813 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1762638813 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1762638813 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1762638813 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In1762638813 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite11_Out1762638813| |P0Thread1of1ForFork2_#t~ite12_Out1762638813|) (= ~x$w_buff1~0_In1762638813 |P0Thread1of1ForFork2_#t~ite11_Out1762638813|) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In1762638813 |P0Thread1of1ForFork2_#t~ite12_Out1762638813|) (= |P0Thread1of1ForFork2_#t~ite11_In1762638813| |P0Thread1of1ForFork2_#t~ite11_Out1762638813|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762638813, ~x$w_buff1~0=~x$w_buff1~0_In1762638813, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762638813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762638813, ~weak$$choice2~0=~weak$$choice2~0_In1762638813, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1762638813|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762638813} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762638813, ~x$w_buff1~0=~x$w_buff1~0_In1762638813, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762638813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762638813, ~weak$$choice2~0=~weak$$choice2~0_In1762638813, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1762638813|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1762638813|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:42:16,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out1874553667| |P0Thread1of1ForFork2_#t~ite14_Out1874553667|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1874553667 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1874553667 256)) (and (= (mod ~x$w_buff1_used~0_In1874553667 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In1874553667 256)) .cse1))) (= ~x$w_buff0_used~0_In1874553667 |P0Thread1of1ForFork2_#t~ite14_Out1874553667|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1874553667| ~x$w_buff0_used~0_In1874553667) (= |P0Thread1of1ForFork2_#t~ite14_In1874553667| |P0Thread1of1ForFork2_#t~ite14_Out1874553667|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874553667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874553667, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874553667, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1874553667|, ~weak$$choice2~0=~weak$$choice2~0_In1874553667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874553667} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874553667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874553667, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1874553667|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874553667, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1874553667|, ~weak$$choice2~0=~weak$$choice2~0_In1874553667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874553667} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:42:16,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In101925086 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out101925086| |P0Thread1of1ForFork2_#t~ite17_Out101925086|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In101925086 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In101925086 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In101925086 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In101925086 256) 0))) (= ~x$w_buff1_used~0_In101925086 |P0Thread1of1ForFork2_#t~ite17_Out101925086|)) (and (= ~x$w_buff1_used~0_In101925086 |P0Thread1of1ForFork2_#t~ite18_Out101925086|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In101925086| |P0Thread1of1ForFork2_#t~ite17_Out101925086|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In101925086, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In101925086|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In101925086, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In101925086, ~weak$$choice2~0=~weak$$choice2~0_In101925086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101925086} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In101925086, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out101925086|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out101925086|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In101925086, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In101925086, ~weak$$choice2~0=~weak$$choice2~0_In101925086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101925086} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:42:16,530 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 14:42:16,531 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 14:42:16,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1401843794 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1401843794 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1401843794 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1401843794 256)))) (or (and (= ~x$w_buff1_used~0_In-1401843794 |P2Thread1of1ForFork1_#t~ite35_Out-1401843794|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1401843794|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1401843794, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1401843794, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1401843794|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1401843794, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1401843794, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:42:16,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-963266525 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-963266525 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-963266525|)) (and (= ~x$r_buff0_thd3~0_In-963266525 |P2Thread1of1ForFork1_#t~ite36_Out-963266525|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-963266525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963266525} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-963266525|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-963266525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963266525} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:42:16,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In815910660 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In815910660 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In815910660 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In815910660 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out815910660| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out815910660| ~x$r_buff1_thd3~0_In815910660) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In815910660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In815910660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:42:16,532 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 14:42:16,532 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 14:42:16,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1852831118 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1852831118 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1852831118| ~x~0_In-1852831118) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1852831118 |ULTIMATE.start_main_#t~ite41_Out-1852831118|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1852831118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1852831118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1852831118, ~x~0=~x~0_In-1852831118} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1852831118|, ~x$w_buff1~0=~x$w_buff1~0_In-1852831118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1852831118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1852831118, ~x~0=~x~0_In-1852831118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:42:16,532 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 14:42:16,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-666659355 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-666659355 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-666659355| ~x$w_buff0_used~0_In-666659355) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-666659355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-666659355, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-666659355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:42:16,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1496706665 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1496706665 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1496706665 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1496706665 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1496706665| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1496706665| ~x$w_buff1_used~0_In-1496706665) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1496706665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496706665, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1496706665, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496706665} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1496706665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496706665, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1496706665, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1496706665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496706665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:42:16,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1751708561 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1751708561 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1751708561| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1751708561| ~x$r_buff0_thd0~0_In1751708561)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751708561, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751708561} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751708561, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1751708561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751708561} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:42:16,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1328211610 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1328211610 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1328211610 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1328211610 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1328211610| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1328211610 |ULTIMATE.start_main_#t~ite46_Out1328211610|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1328211610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328211610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1328211610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328211610} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1328211610, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1328211610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328211610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1328211610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328211610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:42:16,534 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 14:42:16,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:42:16 BasicIcfg [2019-12-07 14:42:16,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:42:16,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:42:16,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:42:16,581 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:42:16,581 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:41:34" (3/4) ... [2019-12-07 14:42:16,583 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:42:16,584 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 (select .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24|)) (= 0 v_~x$w_buff1_used~0_531) (= 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) (= 0 |v_ULTIMATE.start_main_~#t2354~0.offset_18|) (= 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) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2354~0.base_24|) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2354~0.base_24| 1)) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2354~0.base_24|) |v_ULTIMATE.start_main_~#t2354~0.offset_18| 0)) |v_#memory_int_23|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2354~0.base_24| 4)) (= 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_~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, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_19|, ~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_~#t2354~0.offset=|v_ULTIMATE.start_main_~#t2354~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, ULTIMATE.start_main_~#t2354~0.base=|v_ULTIMATE.start_main_~#t2354~0.base_24|, #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, ~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|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_19|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_26|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #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, ULTIMATE.start_main_~#t2355~0.offset, ~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_~#t2354~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2354~0.base, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~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, ULTIMATE.start_main_~#t2356~0.offset, ULTIMATE.start_main_~#t2355~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2356~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #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 14:42:16,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2355~0.base_13|) |v_ULTIMATE.start_main_~#t2355~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t2355~0.base_13| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2355~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2355~0.offset_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2355~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2355~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#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|, ULTIMATE.start_main_~#t2355~0.base=|v_ULTIMATE.start_main_~#t2355~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2355~0.offset=|v_ULTIMATE.start_main_~#t2355~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2355~0.base, #length, ULTIMATE.start_main_~#t2355~0.offset] because there is no mapped edge [2019-12-07 14:42:16,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2356~0.offset_11|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2356~0.base_13|) |v_ULTIMATE.start_main_~#t2356~0.offset_11| 2)) |v_#memory_int_17|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2356~0.base_13| 1) |v_#valid_38|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2356~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2356~0.base_13|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2356~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2356~0.base=|v_ULTIMATE.start_main_~#t2356~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2356~0.offset=|v_ULTIMATE.start_main_~#t2356~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2356~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2356~0.offset] because there is no mapped edge [2019-12-07 14:42:16,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff0_used~0_In1210292619 ~x$w_buff1_used~0_Out1210292619) (= |P1Thread1of1ForFork0_#in~arg.offset_In1210292619| P1Thread1of1ForFork0_~arg.offset_Out1210292619) (= ~x$w_buff1~0_Out1210292619 ~x$w_buff0~0_In1210292619) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619)) (= 1 ~x$w_buff0_used~0_Out1210292619) (= P1Thread1of1ForFork0_~arg.base_Out1210292619 |P1Thread1of1ForFork0_#in~arg.base_In1210292619|) (= ~x$w_buff0~0_Out1210292619 1) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619| (ite (not (and (not (= 0 (mod ~x$w_buff1_used~0_Out1210292619 256))) (not (= (mod ~x$w_buff0_used~0_Out1210292619 256) 0)))) 1 0)) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619)) InVars {~x$w_buff0~0=~x$w_buff0~0_In1210292619, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1210292619|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1210292619|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1210292619} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out1210292619, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out1210292619, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out1210292619, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out1210292619, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1210292619|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In1210292619|, ~x$w_buff1~0=~x$w_buff1~0_Out1210292619, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In1210292619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1210292619, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1210292619} 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 14:42:16,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-126640001 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-126640001 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-126640001 |P2Thread1of1ForFork1_#t~ite32_Out-126640001|)) (and (not .cse1) (= ~x$w_buff1~0_In-126640001 |P2Thread1of1ForFork1_#t~ite32_Out-126640001|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-126640001, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-126640001, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126640001, ~x~0=~x~0_In-126640001} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-126640001|, ~x$w_buff1~0=~x$w_buff1~0_In-126640001, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-126640001, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-126640001, ~x~0=~x~0_In-126640001} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:42:16,586 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 14:42:16,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2096769610 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In2096769610 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out2096769610| 0)) (and (= ~x$w_buff0_used~0_In2096769610 |P2Thread1of1ForFork1_#t~ite34_Out2096769610|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096769610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096769610} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out2096769610|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2096769610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2096769610} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:42:16,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-226801791 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-226801791 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-226801791| ~x$w_buff0_used~0_In-226801791) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-226801791| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-226801791, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-226801791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-226801791} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 14:42:16,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1214179106 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1214179106 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1214179106 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1214179106 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1214179106| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-1214179106| ~x$w_buff1_used~0_In-1214179106)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1214179106, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1214179106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214179106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214179106} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1214179106, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1214179106, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1214179106, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1214179106|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1214179106} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 14:42:16,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse0 (= ~x$r_buff0_thd2~0_Out528227422 ~x$r_buff0_thd2~0_In528227422)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In528227422 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In528227422 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~x$r_buff0_thd2~0_Out528227422 0) (not .cse2) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out528227422|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out528227422, ~x$w_buff0_used~0=~x$w_buff0_used~0_In528227422} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 14:42:16,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1997755319 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1997755319 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1997755319 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1997755319 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1997755319|)) (and (= ~x$r_buff1_thd2~0_In1997755319 |P1Thread1of1ForFork0_#t~ite31_Out1997755319|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1997755319, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1997755319, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997755319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997755319} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1997755319|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1997755319, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1997755319, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1997755319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1997755319} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 14:42:16,588 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 14:42:16,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1762638813 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1762638813 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In1762638813 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In1762638813 256)) (and .cse0 (= (mod ~x$w_buff1_used~0_In1762638813 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite11_Out1762638813| |P0Thread1of1ForFork2_#t~ite12_Out1762638813|) (= ~x$w_buff1~0_In1762638813 |P0Thread1of1ForFork2_#t~ite11_Out1762638813|) .cse1) (and (not .cse1) (= ~x$w_buff1~0_In1762638813 |P0Thread1of1ForFork2_#t~ite12_Out1762638813|) (= |P0Thread1of1ForFork2_#t~ite11_In1762638813| |P0Thread1of1ForFork2_#t~ite11_Out1762638813|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762638813, ~x$w_buff1~0=~x$w_buff1~0_In1762638813, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762638813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762638813, ~weak$$choice2~0=~weak$$choice2~0_In1762638813, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In1762638813|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762638813} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1762638813, ~x$w_buff1~0=~x$w_buff1~0_In1762638813, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1762638813, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1762638813, ~weak$$choice2~0=~weak$$choice2~0_In1762638813, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out1762638813|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out1762638813|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 14:42:16,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1874553667 256)))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out1874553667| |P0Thread1of1ForFork2_#t~ite14_Out1874553667|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1874553667 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1874553667 256)) (and (= (mod ~x$w_buff1_used~0_In1874553667 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In1874553667 256)) .cse1))) (= ~x$w_buff0_used~0_In1874553667 |P0Thread1of1ForFork2_#t~ite14_Out1874553667|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite15_Out1874553667| ~x$w_buff0_used~0_In1874553667) (= |P0Thread1of1ForFork2_#t~ite14_In1874553667| |P0Thread1of1ForFork2_#t~ite14_Out1874553667|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874553667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874553667, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874553667, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1874553667|, ~weak$$choice2~0=~weak$$choice2~0_In1874553667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874553667} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1874553667, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1874553667, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1874553667|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1874553667, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1874553667|, ~weak$$choice2~0=~weak$$choice2~0_In1874553667, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1874553667} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 14:42:16,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In101925086 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out101925086| |P0Thread1of1ForFork2_#t~ite17_Out101925086|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In101925086 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In101925086 256)) .cse1) (and (= (mod ~x$w_buff1_used~0_In101925086 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In101925086 256) 0))) (= ~x$w_buff1_used~0_In101925086 |P0Thread1of1ForFork2_#t~ite17_Out101925086|)) (and (= ~x$w_buff1_used~0_In101925086 |P0Thread1of1ForFork2_#t~ite18_Out101925086|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In101925086| |P0Thread1of1ForFork2_#t~ite17_Out101925086|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In101925086, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In101925086|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In101925086, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In101925086, ~weak$$choice2~0=~weak$$choice2~0_In101925086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101925086} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In101925086, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out101925086|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out101925086|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In101925086, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In101925086, ~weak$$choice2~0=~weak$$choice2~0_In101925086, ~x$w_buff0_used~0=~x$w_buff0_used~0_In101925086} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 14:42:16,590 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 14:42:16,590 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 14:42:16,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In-1401843794 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1401843794 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1401843794 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1401843794 256)))) (or (and (= ~x$w_buff1_used~0_In-1401843794 |P2Thread1of1ForFork1_#t~ite35_Out-1401843794|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-1401843794|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1401843794, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1401843794, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1401843794|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1401843794, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1401843794, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1401843794, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1401843794} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:42:16,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-963266525 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-963266525 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-963266525|)) (and (= ~x$r_buff0_thd3~0_In-963266525 |P2Thread1of1ForFork1_#t~ite36_Out-963266525|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-963266525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963266525} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-963266525|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-963266525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-963266525} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:42:16,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In815910660 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In815910660 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In815910660 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In815910660 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite37_Out815910660| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite37_Out815910660| ~x$r_buff1_thd3~0_In815910660) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In815910660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out815910660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In815910660, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In815910660, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In815910660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In815910660} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:42:16,591 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 14:42:16,591 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 14:42:16,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-1852831118 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1852831118 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1852831118| ~x~0_In-1852831118) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1852831118 |ULTIMATE.start_main_#t~ite41_Out-1852831118|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1852831118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1852831118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1852831118, ~x~0=~x~0_In-1852831118} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1852831118|, ~x$w_buff1~0=~x$w_buff1~0_In-1852831118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1852831118, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1852831118, ~x~0=~x~0_In-1852831118} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 14:42:16,592 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 14:42:16,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-666659355 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-666659355 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-666659355| ~x$w_buff0_used~0_In-666659355) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-666659355|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-666659355, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-666659355, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-666659355|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-666659355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:42:16,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1496706665 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-1496706665 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1496706665 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1496706665 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1496706665| 0)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1496706665| ~x$w_buff1_used~0_In-1496706665) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1496706665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496706665, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1496706665, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496706665} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1496706665, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1496706665, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1496706665, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1496706665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1496706665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:42:16,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1751708561 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1751708561 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1751708561| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1751708561| ~x$r_buff0_thd0~0_In1751708561)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751708561, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751708561} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1751708561, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1751708561|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1751708561} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:42:16,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1328211610 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1328211610 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1328211610 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1328211610 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out1328211610| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1328211610 |ULTIMATE.start_main_#t~ite46_Out1328211610|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1328211610, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328211610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1328211610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328211610} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1328211610, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1328211610|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1328211610, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1328211610, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1328211610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 14:42:16,593 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 14:42:16,642 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_11da0536-7d2d-4635-90a3-7009e5e570f5/bin/uautomizer/witness.graphml [2019-12-07 14:42:16,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:42:16,643 INFO L168 Benchmark]: Toolchain (without parser) took 43304.53 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 943.5 MB in the beginning and 1.7 GB in the end (delta: -775.6 MB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,644 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:42:16,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -106.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,644 INFO L168 Benchmark]: Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:42:16,645 INFO L168 Benchmark]: RCFGBuilder took 380.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,645 INFO L168 Benchmark]: TraceAbstraction took 42412.80 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 989.5 MB in the beginning and 1.7 GB in the end (delta: -744.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,645 INFO L168 Benchmark]: Witness Printer took 61.45 ms. Allocated memory is still 4.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:42:16,646 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 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 80.7 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -106.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.88 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.5 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42412.80 ms. Allocated memory was 1.1 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 989.5 MB in the beginning and 1.7 GB in the end (delta: -744.8 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 61.45 ms. Allocated memory is still 4.9 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 15.3 MB). Peak memory consumption was 15.3 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(&t2354, ((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(&t2355, ((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(&t2356, ((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: 42.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4080 SDtfs, 4961 SDslu, 14055 SDs, 0 SdLazy, 6150 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 237 GetRequests, 27 SyntacticMatches, 21 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 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: 18.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 95268 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 758 ConstructedInterpolants, 0 QuantifiedInterpolants, 146702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...