./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.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_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/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 b41bd8ff981caf294ccd13fc87e6dada1fe2508b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:21:56,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:21:56,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:21:56,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:21:56,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:21:56,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:21:56,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:21:56,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:21:56,661 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:21:56,662 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:21:56,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:21:56,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:21:56,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:21:56,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:21:56,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:21:56,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:21:56,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:21:56,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:21:56,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:21:56,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:21:56,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:21:56,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:21:56,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:21:56,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:21:56,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:21:56,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:21:56,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:21:56,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:21:56,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:21:56,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:21:56,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:21:56,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:21:56,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:21:56,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:21:56,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:21:56,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:21:56,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:21:56,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:21:56,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:21:56,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:21:56,679 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:21:56,680 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:21:56,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:21:56,689 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:21:56,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:21:56,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:21:56,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:21:56,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:21:56,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:21:56,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:56,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:21:56,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:21:56,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:21:56,693 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_f07975e6-a83d-45be-ade7-42d5d70566fe/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 -> b41bd8ff981caf294ccd13fc87e6dada1fe2508b [2019-12-07 18:21:56,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:21:56,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:21:56,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:21:56,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:21:56,804 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:21:56,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe012_rmo.opt.i [2019-12-07 18:21:56,852 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/data/cd5f13f89/2492d413e7f0431880d6e84e1150d8dc/FLAG66605b263 [2019-12-07 18:21:57,265 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:21:57,265 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/sv-benchmarks/c/pthread-wmm/safe012_rmo.opt.i [2019-12-07 18:21:57,275 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/data/cd5f13f89/2492d413e7f0431880d6e84e1150d8dc/FLAG66605b263 [2019-12-07 18:21:57,627 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/data/cd5f13f89/2492d413e7f0431880d6e84e1150d8dc [2019-12-07 18:21:57,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:21:57,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:21:57,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:57,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:21:57,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:21:57,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:57,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57, skipping insertion in model container [2019-12-07 18:21:57,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:57,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:21:57,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:21:57,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:57,916 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:21:57,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:57,998 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:21:57,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57 WrapperNode [2019-12-07 18:21:57,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:57,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:57,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:21:57,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:21:58,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:58,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:21:58,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:21:58,036 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:21:58,043 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... [2019-12-07 18:21:58,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:21:58,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:21:58,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:21:58,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:21:58,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:21:58,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:21:58,102 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:21:58,102 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:21:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:21:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:21:58,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:21:58,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:21:58,104 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:21:58,448 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:21:58,448 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:21:58,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:58 BoogieIcfgContainer [2019-12-07 18:21:58,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:21:58,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:21:58,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:21:58,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:21:58,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:21:57" (1/3) ... [2019-12-07 18:21:58,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ab24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:58, skipping insertion in model container [2019-12-07 18:21:58,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:57" (2/3) ... [2019-12-07 18:21:58,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7ab24c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:58, skipping insertion in model container [2019-12-07 18:21:58,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:58" (3/3) ... [2019-12-07 18:21:58,454 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_rmo.opt.i [2019-12-07 18:21:58,460 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:21:58,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:21:58,466 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:21:58,466 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,500 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,501 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,502 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,503 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,504 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,505 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,506 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,507 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,509 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,514 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:58,527 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:21:58,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:21:58,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:21:58,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:21:58,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:21:58,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:21:58,540 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:21:58,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:21:58,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:21:58,553 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-07 18:21:58,554 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 18:21:58,606 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 18:21:58,606 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:58,616 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 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 18:21:58,630 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-07 18:21:58,659 INFO L134 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-07 18:21:58,659 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:58,664 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 724 event pairs. 9/158 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 18:21:58,679 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 18:21:58,680 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:22:01,704 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 18:22:01,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-07 18:22:01,846 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 18:22:01,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-07 18:22:09,682 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-07 18:22:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-07 18:22:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:22:09,687 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:09,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:22:09,688 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 18:22:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-07 18:22:09,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:09,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291369637] [2019-12-07 18:22:09,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:09,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291369637] [2019-12-07 18:22:09,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:09,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:22:09,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903466441] [2019-12-07 18:22:09,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:09,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:09,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:09,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:09,848 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-07 18:22:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:10,526 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-07 18:22:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:10,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:22:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:10,839 INFO L225 Difference]: With dead ends: 79136 [2019-12-07 18:22:10,839 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 18:22:10,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 18:22:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-07 18:22:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-07 18:22:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-07 18:22:14,822 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-07 18:22:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:14,822 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-07 18:22:14,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:14,822 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-07 18:22:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:22:14,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:14,830 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:14,830 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 18:22:14,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:14,830 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-07 18:22:14,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:14,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756321664] [2019-12-07 18:22:14,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:14,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756321664] [2019-12-07 18:22:14,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:14,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:14,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857132210] [2019-12-07 18:22:14,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:14,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:14,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:14,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:14,897 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-07 18:22:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:15,581 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-07 18:22:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:15,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:22:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:15,974 INFO L225 Difference]: With dead ends: 114840 [2019-12-07 18:22:15,974 INFO L226 Difference]: Without dead ends: 114749 [2019-12-07 18:22:15,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-07 18:22:21,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-07 18:22:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-07 18:22:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-07 18:22:22,299 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-07 18:22:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:22,300 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-07 18:22:22,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:22,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-07 18:22:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:22:22,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:22,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:22,304 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 18:22:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:22,304 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-07 18:22:22,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:22,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203293656] [2019-12-07 18:22:22,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:22,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203293656] [2019-12-07 18:22:22,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:22,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:22,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777865704] [2019-12-07 18:22:22,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:22,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:22,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:22,354 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-07 18:22:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:23,326 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-07 18:22:23,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:23,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:22:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:23,695 INFO L225 Difference]: With dead ends: 148763 [2019-12-07 18:22:23,695 INFO L226 Difference]: Without dead ends: 148659 [2019-12-07 18:22:23,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-07 18:22:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-07 18:22:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-07 18:22:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-07 18:22:31,237 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-07 18:22:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:31,237 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-07 18:22:31,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:31,237 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-07 18:22:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 18:22:31,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:31,240 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:31,240 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 18:22:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:31,241 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-07 18:22:31,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:31,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621404162] [2019-12-07 18:22:31,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:31,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621404162] [2019-12-07 18:22:31,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:31,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:31,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201950389] [2019-12-07 18:22:31,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:31,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:31,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:31,288 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-07 18:22:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:32,186 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-07 18:22:32,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:32,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 18:22:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:32,611 INFO L225 Difference]: With dead ends: 172949 [2019-12-07 18:22:32,611 INFO L226 Difference]: Without dead ends: 172813 [2019-12-07 18:22:32,611 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 18:22:36,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-07 18:22:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-07 18:22:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-07 18:22:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-07 18:22:38,827 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-07 18:22:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:38,827 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-07 18:22:38,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-07 18:22:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:22:38,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:38,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:38,847 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 18:22:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:38,847 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-07 18:22:38,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:38,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312230283] [2019-12-07 18:22:38,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:38,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312230283] [2019-12-07 18:22:38,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:38,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:38,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095071230] [2019-12-07 18:22:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:38,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:38,902 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 4 states. [2019-12-07 18:22:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:39,042 INFO L93 Difference]: Finished difference Result 38567 states and 134173 transitions. [2019-12-07 18:22:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:39,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:22:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:39,094 INFO L225 Difference]: With dead ends: 38567 [2019-12-07 18:22:39,094 INFO L226 Difference]: Without dead ends: 30123 [2019-12-07 18:22:39,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:39,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30123 states. [2019-12-07 18:22:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30123 to 30122. [2019-12-07 18:22:39,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30122 states. [2019-12-07 18:22:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30122 states to 30122 states and 100767 transitions. [2019-12-07 18:22:39,609 INFO L78 Accepts]: Start accepts. Automaton has 30122 states and 100767 transitions. Word has length 18 [2019-12-07 18:22:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:39,609 INFO L462 AbstractCegarLoop]: Abstraction has 30122 states and 100767 transitions. [2019-12-07 18:22:39,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 30122 states and 100767 transitions. [2019-12-07 18:22:39,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:22:39,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:39,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:39,615 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 18:22:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:39,615 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-07 18:22:39,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:39,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290346991] [2019-12-07 18:22:39,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:39,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290346991] [2019-12-07 18:22:39,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:39,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:39,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119143822] [2019-12-07 18:22:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:39,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:39,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:39,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:39,676 INFO L87 Difference]: Start difference. First operand 30122 states and 100767 transitions. Second operand 6 states. [2019-12-07 18:22:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:40,268 INFO L93 Difference]: Finished difference Result 46477 states and 151615 transitions. [2019-12-07 18:22:40,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:22:40,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:22:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:40,335 INFO L225 Difference]: With dead ends: 46477 [2019-12-07 18:22:40,335 INFO L226 Difference]: Without dead ends: 46048 [2019-12-07 18:22:40,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:22:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46048 states. [2019-12-07 18:22:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46048 to 30766. [2019-12-07 18:22:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30766 states. [2019-12-07 18:22:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30766 states to 30766 states and 102240 transitions. [2019-12-07 18:22:40,949 INFO L78 Accepts]: Start accepts. Automaton has 30766 states and 102240 transitions. Word has length 22 [2019-12-07 18:22:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:40,949 INFO L462 AbstractCegarLoop]: Abstraction has 30766 states and 102240 transitions. [2019-12-07 18:22:40,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 30766 states and 102240 transitions. [2019-12-07 18:22:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 18:22:40,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:40,958 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 18:22:40,958 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 18:22:40,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:40,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1172052689, now seen corresponding path program 1 times [2019-12-07 18:22:40,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:40,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369435705] [2019-12-07 18:22:40,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:41,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369435705] [2019-12-07 18:22:41,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:41,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:41,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742914580] [2019-12-07 18:22:41,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:41,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:41,008 INFO L87 Difference]: Start difference. First operand 30766 states and 102240 transitions. Second operand 5 states. [2019-12-07 18:22:41,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:41,315 INFO L93 Difference]: Finished difference Result 41468 states and 135452 transitions. [2019-12-07 18:22:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:41,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 18:22:41,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:41,377 INFO L225 Difference]: With dead ends: 41468 [2019-12-07 18:22:41,377 INFO L226 Difference]: Without dead ends: 41445 [2019-12-07 18:22:41,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41445 states. [2019-12-07 18:22:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41445 to 34983. [2019-12-07 18:22:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34983 states. [2019-12-07 18:22:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34983 states to 34983 states and 115251 transitions. [2019-12-07 18:22:41,999 INFO L78 Accepts]: Start accepts. Automaton has 34983 states and 115251 transitions. Word has length 25 [2019-12-07 18:22:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:41,999 INFO L462 AbstractCegarLoop]: Abstraction has 34983 states and 115251 transitions. [2019-12-07 18:22:42,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 34983 states and 115251 transitions. [2019-12-07 18:22:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:22:42,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:42,012 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:42,012 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 18:22:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -103947124, now seen corresponding path program 1 times [2019-12-07 18:22:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149535319] [2019-12-07 18:22:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:42,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149535319] [2019-12-07 18:22:42,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:42,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:42,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110826112] [2019-12-07 18:22:42,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:42,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:42,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:42,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:42,057 INFO L87 Difference]: Start difference. First operand 34983 states and 115251 transitions. Second operand 6 states. [2019-12-07 18:22:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:42,792 INFO L93 Difference]: Finished difference Result 52608 states and 171245 transitions. [2019-12-07 18:22:42,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:42,793 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 18:22:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:42,881 INFO L225 Difference]: With dead ends: 52608 [2019-12-07 18:22:42,881 INFO L226 Difference]: Without dead ends: 52564 [2019-12-07 18:22:42,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:22:43,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52564 states. [2019-12-07 18:22:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52564 to 36081. [2019-12-07 18:22:43,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36081 states. [2019-12-07 18:22:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36081 states to 36081 states and 118747 transitions. [2019-12-07 18:22:43,600 INFO L78 Accepts]: Start accepts. Automaton has 36081 states and 118747 transitions. Word has length 28 [2019-12-07 18:22:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:43,600 INFO L462 AbstractCegarLoop]: Abstraction has 36081 states and 118747 transitions. [2019-12-07 18:22:43,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 36081 states and 118747 transitions. [2019-12-07 18:22:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:22:43,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:43,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:43,614 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 18:22:43,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash 502147549, now seen corresponding path program 1 times [2019-12-07 18:22:43,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:43,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944785153] [2019-12-07 18:22:43,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:43,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944785153] [2019-12-07 18:22:43,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:43,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:43,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095622564] [2019-12-07 18:22:43,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:43,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:43,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:43,668 INFO L87 Difference]: Start difference. First operand 36081 states and 118747 transitions. Second operand 5 states. [2019-12-07 18:22:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:44,092 INFO L93 Difference]: Finished difference Result 50801 states and 165716 transitions. [2019-12-07 18:22:44,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:44,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:22:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:44,174 INFO L225 Difference]: With dead ends: 50801 [2019-12-07 18:22:44,174 INFO L226 Difference]: Without dead ends: 50801 [2019-12-07 18:22:44,175 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 18:22:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50801 states. [2019-12-07 18:22:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50801 to 43870. [2019-12-07 18:22:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43870 states. [2019-12-07 18:22:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43870 states to 43870 states and 143832 transitions. [2019-12-07 18:22:44,939 INFO L78 Accepts]: Start accepts. Automaton has 43870 states and 143832 transitions. Word has length 28 [2019-12-07 18:22:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:44,940 INFO L462 AbstractCegarLoop]: Abstraction has 43870 states and 143832 transitions. [2019-12-07 18:22:44,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 43870 states and 143832 transitions. [2019-12-07 18:22:44,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:22:44,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:44,962 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:44,962 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 18:22:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash -129449407, now seen corresponding path program 1 times [2019-12-07 18:22:44,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:44,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849602797] [2019-12-07 18:22:44,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:45,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849602797] [2019-12-07 18:22:45,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:45,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:22:45,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391176046] [2019-12-07 18:22:45,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:45,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:45,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:45,010 INFO L87 Difference]: Start difference. First operand 43870 states and 143832 transitions. Second operand 3 states. [2019-12-07 18:22:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:45,133 INFO L93 Difference]: Finished difference Result 43938 states and 143949 transitions. [2019-12-07 18:22:45,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:45,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 18:22:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:45,195 INFO L225 Difference]: With dead ends: 43938 [2019-12-07 18:22:45,195 INFO L226 Difference]: Without dead ends: 43938 [2019-12-07 18:22:45,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43938 states. [2019-12-07 18:22:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43938 to 43869. [2019-12-07 18:22:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43869 states. [2019-12-07 18:22:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43869 states to 43869 states and 143829 transitions. [2019-12-07 18:22:45,889 INFO L78 Accepts]: Start accepts. Automaton has 43869 states and 143829 transitions. Word has length 29 [2019-12-07 18:22:45,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:45,890 INFO L462 AbstractCegarLoop]: Abstraction has 43869 states and 143829 transitions. [2019-12-07 18:22:45,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 43869 states and 143829 transitions. [2019-12-07 18:22:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:22:45,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:45,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:45,911 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 18:22:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1780961354, now seen corresponding path program 1 times [2019-12-07 18:22:45,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:45,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953583348] [2019-12-07 18:22:45,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:45,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953583348] [2019-12-07 18:22:45,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:45,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:45,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033797014] [2019-12-07 18:22:45,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:45,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:45,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:45,959 INFO L87 Difference]: Start difference. First operand 43869 states and 143829 transitions. Second operand 5 states. [2019-12-07 18:22:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:47,089 INFO L93 Difference]: Finished difference Result 60374 states and 196604 transitions. [2019-12-07 18:22:47,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:22:47,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:22:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:47,177 INFO L225 Difference]: With dead ends: 60374 [2019-12-07 18:22:47,177 INFO L226 Difference]: Without dead ends: 60374 [2019-12-07 18:22:47,178 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 18:22:47,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-07 18:22:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 47143. [2019-12-07 18:22:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47143 states. [2019-12-07 18:22:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47143 states to 47143 states and 154657 transitions. [2019-12-07 18:22:48,022 INFO L78 Accepts]: Start accepts. Automaton has 47143 states and 154657 transitions. Word has length 29 [2019-12-07 18:22:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:48,022 INFO L462 AbstractCegarLoop]: Abstraction has 47143 states and 154657 transitions. [2019-12-07 18:22:48,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 47143 states and 154657 transitions. [2019-12-07 18:22:48,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:48,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:48,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:48,042 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 18:22:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1189375261, now seen corresponding path program 1 times [2019-12-07 18:22:48,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:48,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294224783] [2019-12-07 18:22:48,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:48,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294224783] [2019-12-07 18:22:48,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:48,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:48,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993820396] [2019-12-07 18:22:48,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:22:48,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:22:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:22:48,203 INFO L87 Difference]: Start difference. First operand 47143 states and 154657 transitions. Second operand 8 states. [2019-12-07 18:22:48,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:48,667 INFO L93 Difference]: Finished difference Result 47197 states and 154733 transitions. [2019-12-07 18:22:48,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:22:48,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-07 18:22:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:48,737 INFO L225 Difference]: With dead ends: 47197 [2019-12-07 18:22:48,737 INFO L226 Difference]: Without dead ends: 47197 [2019-12-07 18:22:48,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:22:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47197 states. [2019-12-07 18:22:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47197 to 47109. [2019-12-07 18:22:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47109 states. [2019-12-07 18:22:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47109 states to 47109 states and 154544 transitions. [2019-12-07 18:22:49,469 INFO L78 Accepts]: Start accepts. Automaton has 47109 states and 154544 transitions. Word has length 30 [2019-12-07 18:22:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:49,469 INFO L462 AbstractCegarLoop]: Abstraction has 47109 states and 154544 transitions. [2019-12-07 18:22:49,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:22:49,470 INFO L276 IsEmpty]: Start isEmpty. Operand 47109 states and 154544 transitions. [2019-12-07 18:22:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:22:49,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:49,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:49,490 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 18:22:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash 255657773, now seen corresponding path program 1 times [2019-12-07 18:22:49,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:49,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370652623] [2019-12-07 18:22:49,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:49,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370652623] [2019-12-07 18:22:49,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:49,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:22:49,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402015906] [2019-12-07 18:22:49,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:22:49,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:49,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:22:49,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:49,543 INFO L87 Difference]: Start difference. First operand 47109 states and 154544 transitions. Second operand 5 states. [2019-12-07 18:22:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:49,632 INFO L93 Difference]: Finished difference Result 22235 states and 68215 transitions. [2019-12-07 18:22:49,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:22:49,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 18:22:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:49,655 INFO L225 Difference]: With dead ends: 22235 [2019-12-07 18:22:49,655 INFO L226 Difference]: Without dead ends: 18942 [2019-12-07 18:22:49,655 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 18:22:49,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18942 states. [2019-12-07 18:22:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18942 to 18143. [2019-12-07 18:22:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-12-07 18:22:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 55327 transitions. [2019-12-07 18:22:49,903 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 55327 transitions. Word has length 30 [2019-12-07 18:22:49,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:49,903 INFO L462 AbstractCegarLoop]: Abstraction has 18143 states and 55327 transitions. [2019-12-07 18:22:49,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:22:49,904 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 55327 transitions. [2019-12-07 18:22:49,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:22:49,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:49,919 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 18:22:49,919 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 18:22:49,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash -67473353, now seen corresponding path program 1 times [2019-12-07 18:22:49,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:49,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789008074] [2019-12-07 18:22:49,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:49,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:49,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789008074] [2019-12-07 18:22:49,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:49,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:22:49,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921494469] [2019-12-07 18:22:49,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:49,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:49,983 INFO L87 Difference]: Start difference. First operand 18143 states and 55327 transitions. Second operand 6 states. [2019-12-07 18:22:50,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:50,565 INFO L93 Difference]: Finished difference Result 23932 states and 71632 transitions. [2019-12-07 18:22:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:22:50,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 18:22:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:50,590 INFO L225 Difference]: With dead ends: 23932 [2019-12-07 18:22:50,591 INFO L226 Difference]: Without dead ends: 23932 [2019-12-07 18:22:50,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:50,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23932 states. [2019-12-07 18:22:50,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23932 to 18433. [2019-12-07 18:22:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18433 states. [2019-12-07 18:22:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18433 states to 18433 states and 56177 transitions. [2019-12-07 18:22:50,869 INFO L78 Accepts]: Start accepts. Automaton has 18433 states and 56177 transitions. Word has length 39 [2019-12-07 18:22:50,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:50,869 INFO L462 AbstractCegarLoop]: Abstraction has 18433 states and 56177 transitions. [2019-12-07 18:22:50,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18433 states and 56177 transitions. [2019-12-07 18:22:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:22:50,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:50,886 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 18:22:50,886 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 18:22:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1097756185, now seen corresponding path program 2 times [2019-12-07 18:22:50,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:50,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464152966] [2019-12-07 18:22:50,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:50,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464152966] [2019-12-07 18:22:50,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:50,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:50,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694880322] [2019-12-07 18:22:50,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:50,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:50,913 INFO L87 Difference]: Start difference. First operand 18433 states and 56177 transitions. Second operand 3 states. [2019-12-07 18:22:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:50,960 INFO L93 Difference]: Finished difference Result 16287 states and 48918 transitions. [2019-12-07 18:22:50,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:50,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 18:22:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:50,979 INFO L225 Difference]: With dead ends: 16287 [2019-12-07 18:22:50,979 INFO L226 Difference]: Without dead ends: 16287 [2019-12-07 18:22:50,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2019-12-07 18:22:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 15983. [2019-12-07 18:22:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15983 states. [2019-12-07 18:22:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15983 states to 15983 states and 48054 transitions. [2019-12-07 18:22:51,186 INFO L78 Accepts]: Start accepts. Automaton has 15983 states and 48054 transitions. Word has length 39 [2019-12-07 18:22:51,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,186 INFO L462 AbstractCegarLoop]: Abstraction has 15983 states and 48054 transitions. [2019-12-07 18:22:51,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 15983 states and 48054 transitions. [2019-12-07 18:22:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:22:51,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:51,199 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 18:22:51,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-07 18:22:51,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:51,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711905919] [2019-12-07 18:22:51,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711905919] [2019-12-07 18:22:51,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:51,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956176961] [2019-12-07 18:22:51,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:22:51,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:22:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:22:51,260 INFO L87 Difference]: Start difference. First operand 15983 states and 48054 transitions. Second operand 6 states. [2019-12-07 18:22:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,340 INFO L93 Difference]: Finished difference Result 14649 states and 44676 transitions. [2019-12-07 18:22:51,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:51,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 18:22:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,356 INFO L225 Difference]: With dead ends: 14649 [2019-12-07 18:22:51,356 INFO L226 Difference]: Without dead ends: 14440 [2019-12-07 18:22:51,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:22:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14440 states. [2019-12-07 18:22:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14440 to 12995. [2019-12-07 18:22:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12995 states. [2019-12-07 18:22:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12995 states to 12995 states and 40053 transitions. [2019-12-07 18:22:51,537 INFO L78 Accepts]: Start accepts. Automaton has 12995 states and 40053 transitions. Word has length 40 [2019-12-07 18:22:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,538 INFO L462 AbstractCegarLoop]: Abstraction has 12995 states and 40053 transitions. [2019-12-07 18:22:51,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:22:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 12995 states and 40053 transitions. [2019-12-07 18:22:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:22:51,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,550 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 18:22:51,550 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 18:22:51,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1047241984, now seen corresponding path program 1 times [2019-12-07 18:22:51,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:51,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020586568] [2019-12-07 18:22:51,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020586568] [2019-12-07 18:22:51,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:22:51,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373606927] [2019-12-07 18:22:51,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:51,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,577 INFO L87 Difference]: Start difference. First operand 12995 states and 40053 transitions. Second operand 3 states. [2019-12-07 18:22:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:51,649 INFO L93 Difference]: Finished difference Result 18255 states and 55282 transitions. [2019-12-07 18:22:51,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:51,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 18:22:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:51,672 INFO L225 Difference]: With dead ends: 18255 [2019-12-07 18:22:51,672 INFO L226 Difference]: Without dead ends: 18255 [2019-12-07 18:22:51,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18255 states. [2019-12-07 18:22:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18255 to 14942. [2019-12-07 18:22:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14942 states. [2019-12-07 18:22:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14942 states to 14942 states and 45804 transitions. [2019-12-07 18:22:51,938 INFO L78 Accepts]: Start accepts. Automaton has 14942 states and 45804 transitions. Word has length 55 [2019-12-07 18:22:51,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:51,938 INFO L462 AbstractCegarLoop]: Abstraction has 14942 states and 45804 transitions. [2019-12-07 18:22:51,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14942 states and 45804 transitions. [2019-12-07 18:22:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:22:51,951 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:51,951 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 18:22:51,951 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 18:22:51,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1631852596, now seen corresponding path program 1 times [2019-12-07 18:22:51,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:51,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079456117] [2019-12-07 18:22:51,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:51,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079456117] [2019-12-07 18:22:51,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:51,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:51,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100109154] [2019-12-07 18:22:51,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:22:51,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:22:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:51,988 INFO L87 Difference]: Start difference. First operand 14942 states and 45804 transitions. Second operand 3 states. [2019-12-07 18:22:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,030 INFO L93 Difference]: Finished difference Result 14940 states and 45799 transitions. [2019-12-07 18:22:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:22:52,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 18:22:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,048 INFO L225 Difference]: With dead ends: 14940 [2019-12-07 18:22:52,048 INFO L226 Difference]: Without dead ends: 14940 [2019-12-07 18:22:52,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:22:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14940 states. [2019-12-07 18:22:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14940 to 12166. [2019-12-07 18:22:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12166 states. [2019-12-07 18:22:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12166 states to 12166 states and 37847 transitions. [2019-12-07 18:22:52,232 INFO L78 Accepts]: Start accepts. Automaton has 12166 states and 37847 transitions. Word has length 55 [2019-12-07 18:22:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,232 INFO L462 AbstractCegarLoop]: Abstraction has 12166 states and 37847 transitions. [2019-12-07 18:22:52,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:22:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 12166 states and 37847 transitions. [2019-12-07 18:22:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:22:52,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:52,242 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 18:22:52,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,242 INFO L82 PathProgramCache]: Analyzing trace with hash 531668682, now seen corresponding path program 1 times [2019-12-07 18:22:52,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289451002] [2019-12-07 18:22:52,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:52,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289451002] [2019-12-07 18:22:52,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:22:52,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537159673] [2019-12-07 18:22:52,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:22:52,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:52,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:22:52,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:22:52,281 INFO L87 Difference]: Start difference. First operand 12166 states and 37847 transitions. Second operand 4 states. [2019-12-07 18:22:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:52,343 INFO L93 Difference]: Finished difference Result 21881 states and 68041 transitions. [2019-12-07 18:22:52,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:22:52,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 18:22:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:52,355 INFO L225 Difference]: With dead ends: 21881 [2019-12-07 18:22:52,355 INFO L226 Difference]: Without dead ends: 10169 [2019-12-07 18:22:52,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:22:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10169 states. [2019-12-07 18:22:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10169 to 10169. [2019-12-07 18:22:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10169 states. [2019-12-07 18:22:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10169 states to 10169 states and 31420 transitions. [2019-12-07 18:22:52,496 INFO L78 Accepts]: Start accepts. Automaton has 10169 states and 31420 transitions. Word has length 56 [2019-12-07 18:22:52,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:52,497 INFO L462 AbstractCegarLoop]: Abstraction has 10169 states and 31420 transitions. [2019-12-07 18:22:52,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:22:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10169 states and 31420 transitions. [2019-12-07 18:22:52,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:22:52,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:52,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, 1] [2019-12-07 18:22:52,506 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 18:22:52,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:52,506 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 2 times [2019-12-07 18:22:52,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:52,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415036655] [2019-12-07 18:22:52,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:52,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 18:22:52,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415036655] [2019-12-07 18:22:52,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:52,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:22:52,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667019915] [2019-12-07 18:22:52,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:22:52,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:52,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:22:52,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:52,637 INFO L87 Difference]: Start difference. First operand 10169 states and 31420 transitions. Second operand 11 states. [2019-12-07 18:22:53,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:53,808 INFO L93 Difference]: Finished difference Result 28716 states and 88768 transitions. [2019-12-07 18:22:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:22:53,808 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 18:22:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:53,830 INFO L225 Difference]: With dead ends: 28716 [2019-12-07 18:22:53,830 INFO L226 Difference]: Without dead ends: 19607 [2019-12-07 18:22:53,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1331, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 18:22:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2019-12-07 18:22:54,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 12329. [2019-12-07 18:22:54,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12329 states. [2019-12-07 18:22:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12329 states to 12329 states and 37549 transitions. [2019-12-07 18:22:54,048 INFO L78 Accepts]: Start accepts. Automaton has 12329 states and 37549 transitions. Word has length 56 [2019-12-07 18:22:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:54,049 INFO L462 AbstractCegarLoop]: Abstraction has 12329 states and 37549 transitions. [2019-12-07 18:22:54,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:22:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 12329 states and 37549 transitions. [2019-12-07 18:22:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:22:54,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:54,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:54,065 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 18:22:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:54,066 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 3 times [2019-12-07 18:22:54,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:54,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129727387] [2019-12-07 18:22:54,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:22:54,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129727387] [2019-12-07 18:22:54,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:54,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:22:54,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889217067] [2019-12-07 18:22:54,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:22:54,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:22:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:22:54,212 INFO L87 Difference]: Start difference. First operand 12329 states and 37549 transitions. Second operand 12 states. [2019-12-07 18:22:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:54,801 INFO L93 Difference]: Finished difference Result 20043 states and 60412 transitions. [2019-12-07 18:22:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 18:22:54,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 18:22:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:54,822 INFO L225 Difference]: With dead ends: 20043 [2019-12-07 18:22:54,822 INFO L226 Difference]: Without dead ends: 18989 [2019-12-07 18:22:54,822 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 18:22:54,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2019-12-07 18:22:55,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 11893. [2019-12-07 18:22:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11893 states. [2019-12-07 18:22:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11893 states to 11893 states and 36370 transitions. [2019-12-07 18:22:55,028 INFO L78 Accepts]: Start accepts. Automaton has 11893 states and 36370 transitions. Word has length 56 [2019-12-07 18:22:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:55,028 INFO L462 AbstractCegarLoop]: Abstraction has 11893 states and 36370 transitions. [2019-12-07 18:22:55,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:22:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 11893 states and 36370 transitions. [2019-12-07 18:22:55,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:22:55,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:55,039 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:22:55,039 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:55,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:55,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 4 times [2019-12-07 18:22:55,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:55,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918398404] [2019-12-07 18:22:55,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:55,103 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:22:55,103 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:22:55,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25|) |v_ULTIMATE.start_main_~#t2064~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2064~0.base_25|) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t2064~0.offset_19|) (= 0 v_~x~0_230) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25|)) (= v_~weak$$choice2~0_176 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| 4)) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_~#t2064~0.offset=|v_ULTIMATE.start_main_~#t2064~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2064~0.base=|v_ULTIMATE.start_main_~#t2064~0.base_25|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_21|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_14|, 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_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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, ULTIMATE.start_main_~#t2064~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2064~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2065~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2065~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, 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 18:22:55,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2065~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| 4)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10| 1) |v_#valid_31|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2065~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2065~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10|) |v_ULTIMATE.start_main_~#t2065~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_10|, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2065~0.base, ULTIMATE.start_main_~#t2065~0.offset] because there is no mapped edge [2019-12-07 18:22:55,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2066~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11|) |v_ULTIMATE.start_main_~#t2066~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2066~0.base_11|) (= |v_ULTIMATE.start_main_~#t2066~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_11|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:22:55,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} 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 18:22:55,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-520889407 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-520889407 256) 0))) (or (and (= ~x$w_buff1~0_In-520889407 |P2Thread1of1ForFork1_#t~ite32_Out-520889407|) (not .cse0) (not .cse1)) (and (= ~x~0_In-520889407 |P2Thread1of1ForFork1_#t~ite32_Out-520889407|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-520889407, ~x~0=~x~0_In-520889407} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-520889407|, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-520889407, ~x~0=~x~0_In-520889407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:22:55,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-854036548 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-854036548 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-854036548| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-854036548 |P2Thread1of1ForFork1_#t~ite34_Out-854036548|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-854036548|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:22:55,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In246690306 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In246690306 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out246690306|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In246690306 |P1Thread1of1ForFork0_#t~ite28_Out246690306|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246690306, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out246690306|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:22:55,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-56748426 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-56748426 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-56748426 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-56748426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-56748426| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-56748426| ~x$w_buff1_used~0_In-56748426)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-56748426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-56748426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-56748426, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-56748426|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:22:55,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1799692160 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1799692160 |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1799692160 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1799692160 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1799692160 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1799692160 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite9_Out-1799692160| |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1799692160| ~x$w_buff0~0_In-1799692160) (= |P0Thread1of1ForFork2_#t~ite8_In-1799692160| |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1799692160, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1799692160, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1799692160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1799692160, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799692160} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1799692160, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1799692160, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1799692160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1799692160, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1799692160|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799692160} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 18:22:55,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1781104359 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In-1781104359| |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|) (= ~x$w_buff0_used~0_In-1781104359 |P0Thread1of1ForFork2_#t~ite15_Out-1781104359|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1781104359 256)))) (or (= (mod ~x$w_buff0_used~0_In-1781104359 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-1781104359 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1781104359 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-1781104359| |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|) (= ~x$w_buff0_used~0_In-1781104359 |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1781104359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1781104359, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1781104359, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1781104359|, ~weak$$choice2~0=~weak$$choice2~0_In-1781104359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1781104359} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1781104359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1781104359, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1781104359|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1781104359, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1781104359|, ~weak$$choice2~0=~weak$$choice2~0_In-1781104359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1781104359} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 18:22:55,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In439984207 256)))) (or (and (= ~x$w_buff1_used~0_In439984207 |P0Thread1of1ForFork2_#t~ite18_Out439984207|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In439984207| |P0Thread1of1ForFork2_#t~ite17_Out439984207|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out439984207| |P0Thread1of1ForFork2_#t~ite18_Out439984207|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In439984207 256) 0))) (or (= (mod ~x$w_buff0_used~0_In439984207 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In439984207 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In439984207 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite17_Out439984207| ~x$w_buff1_used~0_In439984207)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439984207, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In439984207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439984207, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439984207, ~weak$$choice2~0=~weak$$choice2~0_In439984207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439984207} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439984207, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out439984207|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out439984207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439984207, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439984207, ~weak$$choice2~0=~weak$$choice2~0_In439984207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439984207} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 18:22:55,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 18:22:55,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-520684658 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520684658 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-520684658 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-520684658 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-520684658 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-520684658| ~x$r_buff1_thd1~0_In-520684658) (= |P0Thread1of1ForFork2_#t~ite23_Out-520684658| |P0Thread1of1ForFork2_#t~ite24_Out-520684658|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite24_Out-520684658| ~x$r_buff1_thd1~0_In-520684658) (= |P0Thread1of1ForFork2_#t~ite23_In-520684658| |P0Thread1of1ForFork2_#t~ite23_Out-520684658|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520684658, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520684658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520684658, ~weak$$choice2~0=~weak$$choice2~0_In-520684658, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-520684658|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520684658} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520684658, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520684658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520684658, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-520684658|, ~weak$$choice2~0=~weak$$choice2~0_In-520684658, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-520684658|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520684658} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 18:22:55,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In432764255 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In432764255 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In432764255 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In432764255 |P2Thread1of1ForFork1_#t~ite35_Out432764255|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out432764255| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In432764255, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In432764255, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:22:55,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-367902746 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-367902746 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-367902746| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-367902746| ~x$r_buff0_thd3~0_In-367902746) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-367902746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367902746} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-367902746|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-367902746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367902746} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:22:55,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-2069088854 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-2069088854|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In-2069088854 |P2Thread1of1ForFork1_#t~ite37_Out-2069088854|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2069088854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2069088854|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2069088854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:22:55,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, 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 18:22:55,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1651096095 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In1651096095 ~x$r_buff0_thd2~0_Out1651096095))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1651096095)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1651096095|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:22:55,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-167876085 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-167876085 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-167876085 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-167876085 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-167876085| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-167876085| ~x$r_buff1_thd2~0_In-167876085)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-167876085, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-167876085|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-167876085, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:22:55,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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 18:22:55,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:22:55,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1115521006 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256)))) (or (and (= ~x$w_buff1~0_In1115521006 |ULTIMATE.start_main_#t~ite41_Out1115521006|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1115521006| ~x~0_In1115521006) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1115521006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1115521006, ~x~0=~x~0_In1115521006} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1115521006|, ~x$w_buff1~0=~x$w_buff1~0_In1115521006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1115521006, ~x~0=~x~0_In1115521006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 18:22:55,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-419535407 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-419535407|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-419535407 |ULTIMATE.start_main_#t~ite43_Out-419535407|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419535407, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-419535407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:22:55,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1049123528 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1049123528 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1049123528 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1049123528 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1049123528| ~x$w_buff1_used~0_In1049123528) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1049123528| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049123528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1049123528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1049123528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049123528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049123528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1049123528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1049123528, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1049123528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049123528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:22:55,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-486463264 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-486463264 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-486463264| ~x$r_buff0_thd0~0_In-486463264)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-486463264|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486463264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486463264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486463264, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-486463264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486463264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:22:55,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In262501188 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In262501188 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (= ~x$r_buff1_thd0~0_In262501188 |ULTIMATE.start_main_#t~ite46_Out262501188|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out262501188|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In262501188, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out262501188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 18:22:55,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 18:22:55,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:55 BasicIcfg [2019-12-07 18:22:55,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:55,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:55,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:55,159 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:55,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:58" (3/4) ... [2019-12-07 18:22:55,161 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:22:55,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= v_~y~0_203 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2064~0.base_25|) |v_ULTIMATE.start_main_~#t2064~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2064~0.base_25|) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= v_~main$tmp_guard0~0_48 0) (= 0 |v_ULTIMATE.start_main_~#t2064~0.offset_19|) (= 0 v_~x~0_230) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2064~0.base_25|)) (= v_~weak$$choice2~0_176 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2064~0.base_25| 4)) (= v_~x$r_buff0_thd1~0_365 0) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_~#t2064~0.offset=|v_ULTIMATE.start_main_~#t2064~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_~#t2064~0.base=|v_ULTIMATE.start_main_~#t2064~0.base_25|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_19|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ~y~0=v_~y~0_203, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_26|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_21|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_14|, 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_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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, ULTIMATE.start_main_~#t2064~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2064~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t2065~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2065~0.base, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, 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 18:22:55,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t2065~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| 4)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10| 1) |v_#valid_31|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2065~0.base_10|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2065~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t2065~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2065~0.base_10|) |v_ULTIMATE.start_main_~#t2065~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2065~0.base=|v_ULTIMATE.start_main_~#t2065~0.base_10|, ULTIMATE.start_main_~#t2065~0.offset=|v_ULTIMATE.start_main_~#t2065~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2065~0.base, ULTIMATE.start_main_~#t2065~0.offset] because there is no mapped edge [2019-12-07 18:22:55,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2066~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2066~0.base_11|) |v_ULTIMATE.start_main_~#t2066~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11| 1)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2066~0.base_11|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2066~0.base_11|) (= |v_ULTIMATE.start_main_~#t2066~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2066~0.base=|v_ULTIMATE.start_main_~#t2066~0.base_11|, ULTIMATE.start_main_~#t2066~0.offset=|v_ULTIMATE.start_main_~#t2066~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2066~0.base, ULTIMATE.start_main_~#t2066~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 18:22:55,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| (ite (not (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) (not (= (mod v_~x$w_buff0_used~0_105 256) 0)))) 1 0)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} 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 18:22:55,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-520889407 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-520889407 256) 0))) (or (and (= ~x$w_buff1~0_In-520889407 |P2Thread1of1ForFork1_#t~ite32_Out-520889407|) (not .cse0) (not .cse1)) (and (= ~x~0_In-520889407 |P2Thread1of1ForFork1_#t~ite32_Out-520889407|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-520889407, ~x~0=~x~0_In-520889407} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-520889407|, ~x$w_buff1~0=~x$w_buff1~0_In-520889407, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520889407, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-520889407, ~x~0=~x~0_In-520889407} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 18:22:55,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-854036548 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-854036548 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-854036548| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-854036548 |P2Thread1of1ForFork1_#t~ite34_Out-854036548|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-854036548|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854036548, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854036548} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 18:22:55,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In246690306 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In246690306 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out246690306|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In246690306 |P1Thread1of1ForFork0_#t~ite28_Out246690306|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246690306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246690306, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out246690306|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246690306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 18:22:55,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-56748426 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-56748426 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-56748426 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-56748426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-56748426| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-56748426| ~x$w_buff1_used~0_In-56748426)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-56748426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-56748426, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-56748426, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-56748426, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-56748426, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-56748426|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-56748426} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:22:55,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1799692160 256) 0))) (or (and .cse0 (= ~x$w_buff0~0_In-1799692160 |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1799692160 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1799692160 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1799692160 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1799692160 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite9_Out-1799692160| |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|)) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1799692160| ~x$w_buff0~0_In-1799692160) (= |P0Thread1of1ForFork2_#t~ite8_In-1799692160| |P0Thread1of1ForFork2_#t~ite8_Out-1799692160|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1799692160, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1799692160, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1799692160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1799692160, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799692160} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1799692160, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1799692160, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1799692160|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1799692160, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1799692160|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1799692160, ~weak$$choice2~0=~weak$$choice2~0_In-1799692160, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799692160} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 18:22:55,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1781104359 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In-1781104359| |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|) (= ~x$w_buff0_used~0_In-1781104359 |P0Thread1of1ForFork2_#t~ite15_Out-1781104359|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1781104359 256)))) (or (= (mod ~x$w_buff0_used~0_In-1781104359 256) 0) (and (= (mod ~x$r_buff1_thd1~0_In-1781104359 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1781104359 256))))) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-1781104359| |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|) (= ~x$w_buff0_used~0_In-1781104359 |P0Thread1of1ForFork2_#t~ite14_Out-1781104359|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1781104359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1781104359, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1781104359, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1781104359|, ~weak$$choice2~0=~weak$$choice2~0_In-1781104359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1781104359} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1781104359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1781104359, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1781104359|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1781104359, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1781104359|, ~weak$$choice2~0=~weak$$choice2~0_In-1781104359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1781104359} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 18:22:55,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In439984207 256)))) (or (and (= ~x$w_buff1_used~0_In439984207 |P0Thread1of1ForFork2_#t~ite18_Out439984207|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In439984207| |P0Thread1of1ForFork2_#t~ite17_Out439984207|)) (and (= |P0Thread1of1ForFork2_#t~ite17_Out439984207| |P0Thread1of1ForFork2_#t~ite18_Out439984207|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In439984207 256) 0))) (or (= (mod ~x$w_buff0_used~0_In439984207 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In439984207 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In439984207 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite17_Out439984207| ~x$w_buff1_used~0_In439984207)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439984207, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In439984207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439984207, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439984207, ~weak$$choice2~0=~weak$$choice2~0_In439984207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439984207} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In439984207, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out439984207|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out439984207|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In439984207, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In439984207, ~weak$$choice2~0=~weak$$choice2~0_In439984207, ~x$w_buff0_used~0=~x$w_buff0_used~0_In439984207} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 18:22:55,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_15|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 18:22:55,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-520684658 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-520684658 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-520684658 256) 0) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-520684658 256) 0) .cse0) (= (mod ~x$w_buff0_used~0_In-520684658 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out-520684658| ~x$r_buff1_thd1~0_In-520684658) (= |P0Thread1of1ForFork2_#t~ite23_Out-520684658| |P0Thread1of1ForFork2_#t~ite24_Out-520684658|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite24_Out-520684658| ~x$r_buff1_thd1~0_In-520684658) (= |P0Thread1of1ForFork2_#t~ite23_In-520684658| |P0Thread1of1ForFork2_#t~ite23_Out-520684658|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520684658, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520684658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520684658, ~weak$$choice2~0=~weak$$choice2~0_In-520684658, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-520684658|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520684658} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-520684658, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-520684658, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-520684658, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-520684658|, ~weak$$choice2~0=~weak$$choice2~0_In-520684658, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-520684658|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-520684658} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 18:22:55,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In432764255 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In432764255 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In432764255 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In432764255 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In432764255 |P2Thread1of1ForFork1_#t~ite35_Out432764255|) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out432764255| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In432764255, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out432764255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In432764255, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In432764255, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In432764255, ~x$w_buff0_used~0=~x$w_buff0_used~0_In432764255} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 18:22:55,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-367902746 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-367902746 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-367902746| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-367902746| ~x$r_buff0_thd3~0_In-367902746) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-367902746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367902746} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-367902746|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-367902746, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-367902746} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-2069088854 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-2069088854 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-2069088854 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-2069088854 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out-2069088854|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$r_buff1_thd3~0_In-2069088854 |P2Thread1of1ForFork1_#t~ite37_Out-2069088854|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2069088854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-2069088854|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2069088854, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2069088854, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2069088854, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2069088854} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, 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 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1651096095 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1651096095 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In1651096095 ~x$r_buff0_thd2~0_Out1651096095))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1651096095)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1651096095|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1651096095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1651096095} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-167876085 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-167876085 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-167876085 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-167876085 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-167876085| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-167876085| ~x$r_buff1_thd2~0_In-167876085)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-167876085, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-167876085|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167876085, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-167876085, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-167876085, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167876085} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_28|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, 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 18:22:55,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:22:55,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1115521006 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1115521006 256)))) (or (and (= ~x$w_buff1~0_In1115521006 |ULTIMATE.start_main_#t~ite41_Out1115521006|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite41_Out1115521006| ~x~0_In1115521006) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1115521006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1115521006, ~x~0=~x~0_In1115521006} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1115521006|, ~x$w_buff1~0=~x$w_buff1~0_In1115521006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1115521006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1115521006, ~x~0=~x~0_In1115521006} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 18:22:55,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 18:22:55,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-419535407 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-419535407 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-419535407|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-419535407 |ULTIMATE.start_main_#t~ite43_Out-419535407|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419535407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-419535407, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-419535407|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-419535407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 18:22:55,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1049123528 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1049123528 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1049123528 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1049123528 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out1049123528| ~x$w_buff1_used~0_In1049123528) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out1049123528| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049123528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1049123528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1049123528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049123528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1049123528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1049123528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1049123528, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1049123528|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1049123528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 18:22:55,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-486463264 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-486463264 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-486463264| ~x$r_buff0_thd0~0_In-486463264)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-486463264|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486463264, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486463264} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-486463264, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-486463264|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-486463264} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 18:22:55,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In262501188 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In262501188 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In262501188 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In262501188 256)))) (or (and (= ~x$r_buff1_thd0~0_In262501188 |ULTIMATE.start_main_#t~ite46_Out262501188|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out262501188|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In262501188, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In262501188, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out262501188|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In262501188, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In262501188, ~x$w_buff0_used~0=~x$w_buff0_used~0_In262501188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 18:22:55,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_23 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= 1 v_~__unbuffered_p0_EAX~0_42))) 1 0)) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} 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 18:22:55,219 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f07975e6-a83d-45be-ade7-42d5d70566fe/bin/uautomizer/witness.graphml [2019-12-07 18:22:55,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:55,221 INFO L168 Benchmark]: Toolchain (without parser) took 57589.51 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 940.9 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,221 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:55,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,222 INFO L168 Benchmark]: Boogie Preprocessor took 24.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:55,222 INFO L168 Benchmark]: RCFGBuilder took 387.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,222 INFO L168 Benchmark]: TraceAbstraction took 56709.29 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,223 INFO L168 Benchmark]: Witness Printer took 60.54 ms. Allocated memory is still 5.8 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:55,224 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 365.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -125.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.95 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56709.29 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 60.54 ms. Allocated memory is still 5.8 GB. Free memory was 3.8 GB in the beginning and 3.7 GB in the end (delta: 73.2 MB). Peak memory consumption was 73.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2064, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L820] FCALL, FORK 0 pthread_create(&t2065, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L822] FCALL, FORK 0 pthread_create(&t2066, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1] [L795] 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_p0_EBX=0, __unbuffered_p2_EAX=1, 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=1] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 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)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 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 [L831] 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: 56.5s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3566 SDtfs, 5126 SDslu, 9651 SDs, 0 SdLazy, 5055 SolverSat, 249 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134187occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 155630 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 736 NumberOfCodeBlocks, 736 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 115307 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...