./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/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 6f729b6ce601b7b62788a1137ba803a4071be5ee ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:59:40,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:59:40,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:59:40,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:59:40,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:59:40,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:59:40,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:59:40,845 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:59:40,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:59:40,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:59:40,848 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:59:40,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:59:40,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:59:40,849 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:59:40,850 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:59:40,851 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:59:40,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:59:40,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:59:40,853 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:59:40,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:59:40,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:59:40,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:59:40,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:59:40,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:59:40,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:59:40,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:59:40,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:59:40,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:59:40,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:59:40,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:59:40,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:59:40,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:59:40,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:59:40,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:59:40,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:59:40,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:59:40,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:59:40,863 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:59:40,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:59:40,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:59:40,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:59:40,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:59:40,874 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:59:40,875 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:59:40,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:59:40,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:59:40,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:59:40,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:59:40,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:59:40,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:59:40,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:59:40,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:59:40,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:59:40,879 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:59:40,879 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_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/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 -> 6f729b6ce601b7b62788a1137ba803a4071be5ee [2019-12-07 10:59:40,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:59:40,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:59:40,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:59:40,988 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:59:40,988 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:59:40,989 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix013_power.opt.i [2019-12-07 10:59:41,033 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/data/1847b5e24/7f9def3a78024748aa2192bb306c6ce5/FLAGce851bbd7 [2019-12-07 10:59:41,503 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:59:41,503 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/sv-benchmarks/c/pthread-wmm/mix013_power.opt.i [2019-12-07 10:59:41,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/data/1847b5e24/7f9def3a78024748aa2192bb306c6ce5/FLAGce851bbd7 [2019-12-07 10:59:42,013 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/data/1847b5e24/7f9def3a78024748aa2192bb306c6ce5 [2019-12-07 10:59:42,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:59:42,016 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:59:42,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:42,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:59:42,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:59:42,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a7eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42, skipping insertion in model container [2019-12-07 10:59:42,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:59:42,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:59:42,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:42,320 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:59:42,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:59:42,415 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:59:42,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42 WrapperNode [2019-12-07 10:59:42,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:59:42,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:42,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:59:42,416 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:59:42,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:59:42,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:59:42,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:59:42,459 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:59:42,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,469 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,469 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... [2019-12-07 10:59:42,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:59:42,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:59:42,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:59:42,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:59:42,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/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 10:59:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:59:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:59:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:59:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:59:42,540 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:59:42,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:59:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:59:42,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:59:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:59:42,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:59:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 10:59:42,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 10:59:42,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:59:42,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:59:42,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:59:42,543 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 10:59:42,949 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:59:42,949 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:59:42,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:42 BoogieIcfgContainer [2019-12-07 10:59:42,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:59:42,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:59:42,951 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:59:42,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:59:42,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:59:42" (1/3) ... [2019-12-07 10:59:42,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4dd6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:42, skipping insertion in model container [2019-12-07 10:59:42,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:59:42" (2/3) ... [2019-12-07 10:59:42,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4dd6ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:59:42, skipping insertion in model container [2019-12-07 10:59:42,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:42" (3/3) ... [2019-12-07 10:59:42,955 INFO L109 eAbstractionObserver]: Analyzing ICFG mix013_power.opt.i [2019-12-07 10:59:42,961 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:59:42,961 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:59:42,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:59:42,966 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:59:42,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,994 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:42,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,006 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,007 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,008 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,009 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,010 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,011 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,012 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,013 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,014 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,015 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,016 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,017 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,018 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,019 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:59:43,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 10:59:43,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:59:43,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:59:43,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:59:43,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:59:43,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:59:43,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:59:43,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:59:43,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:59:43,055 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 10:59:43,057 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 10:59:43,124 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 10:59:43,125 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:59:43,136 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 10:59:43,159 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 10:59:43,198 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 10:59:43,198 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:59:43,207 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 10:59:43,233 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 10:59:43,234 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:59:47,040 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 10:59:47,473 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 10:59:47,531 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131114 [2019-12-07 10:59:47,531 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 10:59:47,533 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 10:59:57,812 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97990 states. [2019-12-07 10:59:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 97990 states. [2019-12-07 10:59:57,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:59:57,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:59:57,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:59:57,819 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:59:57,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:59:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash -904171455, now seen corresponding path program 1 times [2019-12-07 10:59:57,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:59:57,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49550133] [2019-12-07 10:59:57,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:59:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:59:57,981 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 10:59:57,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49550133] [2019-12-07 10:59:57,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:59:57,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:59:57,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155906662] [2019-12-07 10:59:57,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:59:57,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:59:57,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:59:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:59:57,996 INFO L87 Difference]: Start difference. First operand 97990 states. Second operand 3 states. [2019-12-07 10:59:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:59:58,855 INFO L93 Difference]: Finished difference Result 97126 states and 446136 transitions. [2019-12-07 10:59:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:59:58,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:59:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:59:59,404 INFO L225 Difference]: With dead ends: 97126 [2019-12-07 10:59:59,404 INFO L226 Difference]: Without dead ends: 90910 [2019-12-07 10:59:59,405 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 11:00:01,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90910 states. [2019-12-07 11:00:02,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90910 to 90910. [2019-12-07 11:00:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90910 states. [2019-12-07 11:00:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90910 states to 90910 states and 417332 transitions. [2019-12-07 11:00:02,806 INFO L78 Accepts]: Start accepts. Automaton has 90910 states and 417332 transitions. Word has length 9 [2019-12-07 11:00:02,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:02,807 INFO L462 AbstractCegarLoop]: Abstraction has 90910 states and 417332 transitions. [2019-12-07 11:00:02,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:02,808 INFO L276 IsEmpty]: Start isEmpty. Operand 90910 states and 417332 transitions. [2019-12-07 11:00:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:00:02,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:02,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:02,814 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1686431172, now seen corresponding path program 1 times [2019-12-07 11:00:02,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:02,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804539767] [2019-12-07 11:00:02,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:02,874 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 11:00:02,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804539767] [2019-12-07 11:00:02,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:02,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:02,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977960521] [2019-12-07 11:00:02,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:02,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:02,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:02,876 INFO L87 Difference]: Start difference. First operand 90910 states and 417332 transitions. Second operand 4 states. [2019-12-07 11:00:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:05,720 INFO L93 Difference]: Finished difference Result 140998 states and 625524 transitions. [2019-12-07 11:00:05,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:05,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:00:05,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:06,116 INFO L225 Difference]: With dead ends: 140998 [2019-12-07 11:00:06,116 INFO L226 Difference]: Without dead ends: 140930 [2019-12-07 11:00:06,117 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 11:00:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140930 states. [2019-12-07 11:00:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140930 to 137862. [2019-12-07 11:00:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137862 states. [2019-12-07 11:00:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137862 states to 137862 states and 614280 transitions. [2019-12-07 11:00:10,748 INFO L78 Accepts]: Start accepts. Automaton has 137862 states and 614280 transitions. Word has length 15 [2019-12-07 11:00:10,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:10,748 INFO L462 AbstractCegarLoop]: Abstraction has 137862 states and 614280 transitions. [2019-12-07 11:00:10,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 137862 states and 614280 transitions. [2019-12-07 11:00:10,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:00:10,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:10,755 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 11:00:10,756 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:10,756 INFO L82 PathProgramCache]: Analyzing trace with hash -806058920, now seen corresponding path program 1 times [2019-12-07 11:00:10,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:10,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113324873] [2019-12-07 11:00:10,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:10,803 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 11:00:10,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113324873] [2019-12-07 11:00:10,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:10,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:10,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182241268] [2019-12-07 11:00:10,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:10,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:10,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:10,805 INFO L87 Difference]: Start difference. First operand 137862 states and 614280 transitions. Second operand 4 states. [2019-12-07 11:00:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:11,870 INFO L93 Difference]: Finished difference Result 175654 states and 773028 transitions. [2019-12-07 11:00:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:00:11,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 11:00:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:12,381 INFO L225 Difference]: With dead ends: 175654 [2019-12-07 11:00:12,381 INFO L226 Difference]: Without dead ends: 175594 [2019-12-07 11:00:12,381 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 11:00:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175594 states. [2019-12-07 11:00:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175594 to 157746. [2019-12-07 11:00:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157746 states. [2019-12-07 11:00:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157746 states to 157746 states and 699816 transitions. [2019-12-07 11:00:19,773 INFO L78 Accepts]: Start accepts. Automaton has 157746 states and 699816 transitions. Word has length 18 [2019-12-07 11:00:19,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:19,773 INFO L462 AbstractCegarLoop]: Abstraction has 157746 states and 699816 transitions. [2019-12-07 11:00:19,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 157746 states and 699816 transitions. [2019-12-07 11:00:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:00:19,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:19,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:19,789 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:19,789 INFO L82 PathProgramCache]: Analyzing trace with hash 363406382, now seen corresponding path program 1 times [2019-12-07 11:00:19,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612205512] [2019-12-07 11:00:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:19,859 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 11:00:19,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612205512] [2019-12-07 11:00:19,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:19,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:00:19,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362422381] [2019-12-07 11:00:19,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:19,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:19,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:19,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:19,861 INFO L87 Difference]: Start difference. First operand 157746 states and 699816 transitions. Second operand 3 states. [2019-12-07 11:00:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:20,661 INFO L93 Difference]: Finished difference Result 155822 states and 688606 transitions. [2019-12-07 11:00:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:20,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:00:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:21,101 INFO L225 Difference]: With dead ends: 155822 [2019-12-07 11:00:21,101 INFO L226 Difference]: Without dead ends: 155822 [2019-12-07 11:00:21,101 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 11:00:23,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155822 states. [2019-12-07 11:00:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155822 to 155675. [2019-12-07 11:00:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155675 states. [2019-12-07 11:00:29,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 688262 transitions. [2019-12-07 11:00:29,135 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 688262 transitions. Word has length 20 [2019-12-07 11:00:29,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:29,136 INFO L462 AbstractCegarLoop]: Abstraction has 155675 states and 688262 transitions. [2019-12-07 11:00:29,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 688262 transitions. [2019-12-07 11:00:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:00:29,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:29,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:00:29,149 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 811087671, now seen corresponding path program 1 times [2019-12-07 11:00:29,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:29,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771370394] [2019-12-07 11:00:29,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:29,216 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 11:00:29,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771370394] [2019-12-07 11:00:29,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:29,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:29,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650098640] [2019-12-07 11:00:29,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:29,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:29,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:29,218 INFO L87 Difference]: Start difference. First operand 155675 states and 688262 transitions. Second operand 4 states. [2019-12-07 11:00:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:29,974 INFO L93 Difference]: Finished difference Result 148754 states and 659072 transitions. [2019-12-07 11:00:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:29,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 11:00:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:30,377 INFO L225 Difference]: With dead ends: 148754 [2019-12-07 11:00:30,378 INFO L226 Difference]: Without dead ends: 148754 [2019-12-07 11:00:30,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148754 states. [2019-12-07 11:00:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148754 to 148754. [2019-12-07 11:00:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148754 states. [2019-12-07 11:00:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148754 states to 148754 states and 659072 transitions. [2019-12-07 11:00:35,063 INFO L78 Accepts]: Start accepts. Automaton has 148754 states and 659072 transitions. Word has length 21 [2019-12-07 11:00:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:35,064 INFO L462 AbstractCegarLoop]: Abstraction has 148754 states and 659072 transitions. [2019-12-07 11:00:35,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 148754 states and 659072 transitions. [2019-12-07 11:00:35,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:00:35,093 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:35,093 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] [2019-12-07 11:00:35,093 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:35,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1517939491, now seen corresponding path program 1 times [2019-12-07 11:00:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:35,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908578044] [2019-12-07 11:00:35,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:35,141 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 11:00:35,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908578044] [2019-12-07 11:00:35,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:35,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:35,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246178464] [2019-12-07 11:00:35,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:00:35,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:00:35,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:35,143 INFO L87 Difference]: Start difference. First operand 148754 states and 659072 transitions. Second operand 5 states. [2019-12-07 11:00:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:36,873 INFO L93 Difference]: Finished difference Result 175846 states and 770252 transitions. [2019-12-07 11:00:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:00:36,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 11:00:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:37,336 INFO L225 Difference]: With dead ends: 175846 [2019-12-07 11:00:37,336 INFO L226 Difference]: Without dead ends: 175738 [2019-12-07 11:00:37,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:00:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175738 states. [2019-12-07 11:00:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175738 to 147798. [2019-12-07 11:00:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147798 states. [2019-12-07 11:00:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147798 states to 147798 states and 655176 transitions. [2019-12-07 11:00:44,481 INFO L78 Accepts]: Start accepts. Automaton has 147798 states and 655176 transitions. Word has length 24 [2019-12-07 11:00:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:44,482 INFO L462 AbstractCegarLoop]: Abstraction has 147798 states and 655176 transitions. [2019-12-07 11:00:44,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:00:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 147798 states and 655176 transitions. [2019-12-07 11:00:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:00:44,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:44,640 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] [2019-12-07 11:00:44,640 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:44,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:44,640 INFO L82 PathProgramCache]: Analyzing trace with hash 455873455, now seen corresponding path program 1 times [2019-12-07 11:00:44,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:44,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659810531] [2019-12-07 11:00:44,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:44,676 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 11:00:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659810531] [2019-12-07 11:00:44,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:44,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:44,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022241673] [2019-12-07 11:00:44,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:44,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:44,678 INFO L87 Difference]: Start difference. First operand 147798 states and 655176 transitions. Second operand 3 states. [2019-12-07 11:00:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:45,524 INFO L93 Difference]: Finished difference Result 114652 states and 471298 transitions. [2019-12-07 11:00:45,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:45,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 11:00:45,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:45,810 INFO L225 Difference]: With dead ends: 114652 [2019-12-07 11:00:45,810 INFO L226 Difference]: Without dead ends: 114652 [2019-12-07 11:00:45,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114652 states. [2019-12-07 11:00:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114652 to 114652. [2019-12-07 11:00:49,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114652 states. [2019-12-07 11:00:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114652 states to 114652 states and 471298 transitions. [2019-12-07 11:00:49,404 INFO L78 Accepts]: Start accepts. Automaton has 114652 states and 471298 transitions. Word has length 34 [2019-12-07 11:00:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:49,405 INFO L462 AbstractCegarLoop]: Abstraction has 114652 states and 471298 transitions. [2019-12-07 11:00:49,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 114652 states and 471298 transitions. [2019-12-07 11:00:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:00:49,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:49,514 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] [2019-12-07 11:00:49,514 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash -919297288, now seen corresponding path program 1 times [2019-12-07 11:00:49,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:49,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565276245] [2019-12-07 11:00:49,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:49,548 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 11:00:49,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565276245] [2019-12-07 11:00:49,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:49,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:49,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089599801] [2019-12-07 11:00:49,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:49,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:49,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:49,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:49,550 INFO L87 Difference]: Start difference. First operand 114652 states and 471298 transitions. Second operand 4 states. [2019-12-07 11:00:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:49,732 INFO L93 Difference]: Finished difference Result 46839 states and 163211 transitions. [2019-12-07 11:00:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:49,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 11:00:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:49,812 INFO L225 Difference]: With dead ends: 46839 [2019-12-07 11:00:49,812 INFO L226 Difference]: Without dead ends: 46839 [2019-12-07 11:00:49,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46839 states. [2019-12-07 11:00:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46839 to 46839. [2019-12-07 11:00:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46839 states. [2019-12-07 11:00:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46839 states to 46839 states and 163211 transitions. [2019-12-07 11:00:50,896 INFO L78 Accepts]: Start accepts. Automaton has 46839 states and 163211 transitions. Word has length 35 [2019-12-07 11:00:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:50,896 INFO L462 AbstractCegarLoop]: Abstraction has 46839 states and 163211 transitions. [2019-12-07 11:00:50,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46839 states and 163211 transitions. [2019-12-07 11:00:50,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 11:00:50,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:50,930 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] [2019-12-07 11:00:50,930 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:50,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:50,931 INFO L82 PathProgramCache]: Analyzing trace with hash -466879402, now seen corresponding path program 1 times [2019-12-07 11:00:50,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:50,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252649680] [2019-12-07 11:00:50,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:00:50,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252649680] [2019-12-07 11:00:50,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:50,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:00:50,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683418135] [2019-12-07 11:00:50,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:00:50,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:50,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:00:50,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:00:50,975 INFO L87 Difference]: Start difference. First operand 46839 states and 163211 transitions. Second operand 3 states. [2019-12-07 11:00:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:51,376 INFO L93 Difference]: Finished difference Result 44516 states and 153303 transitions. [2019-12-07 11:00:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:00:51,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 11:00:51,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:51,452 INFO L225 Difference]: With dead ends: 44516 [2019-12-07 11:00:51,453 INFO L226 Difference]: Without dead ends: 44516 [2019-12-07 11:00:51,453 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 11:00:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44516 states. [2019-12-07 11:00:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44516 to 44289. [2019-12-07 11:00:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44289 states. [2019-12-07 11:00:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44289 states to 44289 states and 152627 transitions. [2019-12-07 11:00:52,457 INFO L78 Accepts]: Start accepts. Automaton has 44289 states and 152627 transitions. Word has length 36 [2019-12-07 11:00:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:52,457 INFO L462 AbstractCegarLoop]: Abstraction has 44289 states and 152627 transitions. [2019-12-07 11:00:52,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:00:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44289 states and 152627 transitions. [2019-12-07 11:00:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:00:52,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:52,490 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] [2019-12-07 11:00:52,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:52,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1238254400, now seen corresponding path program 1 times [2019-12-07 11:00:52,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:52,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303253002] [2019-12-07 11:00:52,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:52,562 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 11:00:52,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303253002] [2019-12-07 11:00:52,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:52,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:00:52,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823003964] [2019-12-07 11:00:52,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:00:52,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:00:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:00:52,564 INFO L87 Difference]: Start difference. First operand 44289 states and 152627 transitions. Second operand 5 states. [2019-12-07 11:00:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:52,901 INFO L93 Difference]: Finished difference Result 62015 states and 217652 transitions. [2019-12-07 11:00:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:00:52,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 11:00:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:53,021 INFO L225 Difference]: With dead ends: 62015 [2019-12-07 11:00:53,021 INFO L226 Difference]: Without dead ends: 62015 [2019-12-07 11:00:53,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:00:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62015 states. [2019-12-07 11:00:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62015 to 60235. [2019-12-07 11:00:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60235 states. [2019-12-07 11:00:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60235 states to 60235 states and 211702 transitions. [2019-12-07 11:00:54,633 INFO L78 Accepts]: Start accepts. Automaton has 60235 states and 211702 transitions. Word has length 37 [2019-12-07 11:00:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:54,633 INFO L462 AbstractCegarLoop]: Abstraction has 60235 states and 211702 transitions. [2019-12-07 11:00:54,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:00:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 60235 states and 211702 transitions. [2019-12-07 11:00:54,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:00:54,681 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:54,681 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] [2019-12-07 11:00:54,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1998943296, now seen corresponding path program 2 times [2019-12-07 11:00:54,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:54,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489524366] [2019-12-07 11:00:54,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:54,741 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 11:00:54,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489524366] [2019-12-07 11:00:54,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:54,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:00:54,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535647804] [2019-12-07 11:00:54,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:00:54,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:54,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:00:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:54,743 INFO L87 Difference]: Start difference. First operand 60235 states and 211702 transitions. Second operand 4 states. [2019-12-07 11:00:55,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:55,181 INFO L93 Difference]: Finished difference Result 72556 states and 251278 transitions. [2019-12-07 11:00:55,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:00:55,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 11:00:55,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:55,323 INFO L225 Difference]: With dead ends: 72556 [2019-12-07 11:00:55,323 INFO L226 Difference]: Without dead ends: 72556 [2019-12-07 11:00:55,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:00:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72556 states. [2019-12-07 11:00:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72556 to 50559. [2019-12-07 11:00:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50559 states. [2019-12-07 11:00:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50559 states to 50559 states and 173361 transitions. [2019-12-07 11:00:56,872 INFO L78 Accepts]: Start accepts. Automaton has 50559 states and 173361 transitions. Word has length 37 [2019-12-07 11:00:56,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:00:56,872 INFO L462 AbstractCegarLoop]: Abstraction has 50559 states and 173361 transitions. [2019-12-07 11:00:56,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:00:56,872 INFO L276 IsEmpty]: Start isEmpty. Operand 50559 states and 173361 transitions. [2019-12-07 11:00:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:00:56,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:00:56,910 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] [2019-12-07 11:00:56,910 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:00:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:00:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash -23521902, now seen corresponding path program 3 times [2019-12-07 11:00:56,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:00:56,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725689052] [2019-12-07 11:00:56,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:00:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:00:57,020 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 11:00:57,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725689052] [2019-12-07 11:00:57,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:00:57,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:00:57,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406492695] [2019-12-07 11:00:57,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:00:57,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:00:57,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:00:57,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:00:57,022 INFO L87 Difference]: Start difference. First operand 50559 states and 173361 transitions. Second operand 8 states. [2019-12-07 11:00:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:00:58,082 INFO L93 Difference]: Finished difference Result 85449 states and 291155 transitions. [2019-12-07 11:00:58,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:00:58,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 11:00:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:00:58,226 INFO L225 Difference]: With dead ends: 85449 [2019-12-07 11:00:58,226 INFO L226 Difference]: Without dead ends: 78521 [2019-12-07 11:00:58,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:00:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78521 states. [2019-12-07 11:00:59,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78521 to 64121. [2019-12-07 11:00:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64121 states. [2019-12-07 11:01:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64121 states to 64121 states and 220697 transitions. [2019-12-07 11:01:00,047 INFO L78 Accepts]: Start accepts. Automaton has 64121 states and 220697 transitions. Word has length 37 [2019-12-07 11:01:00,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:00,047 INFO L462 AbstractCegarLoop]: Abstraction has 64121 states and 220697 transitions. [2019-12-07 11:01:00,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:01:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64121 states and 220697 transitions. [2019-12-07 11:01:00,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:01:00,092 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:00,092 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] [2019-12-07 11:01:00,092 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash 655065106, now seen corresponding path program 4 times [2019-12-07 11:01:00,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:00,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322607486] [2019-12-07 11:01:00,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:00,179 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 11:01:00,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322607486] [2019-12-07 11:01:00,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:00,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:01:00,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882310943] [2019-12-07 11:01:00,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:01:00,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:01:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:01:00,180 INFO L87 Difference]: Start difference. First operand 64121 states and 220697 transitions. Second operand 8 states. [2019-12-07 11:01:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:01,231 INFO L93 Difference]: Finished difference Result 101810 states and 347450 transitions. [2019-12-07 11:01:01,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:01:01,232 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 11:01:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:01,400 INFO L225 Difference]: With dead ends: 101810 [2019-12-07 11:01:01,400 INFO L226 Difference]: Without dead ends: 95792 [2019-12-07 11:01:01,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:01:02,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95792 states. [2019-12-07 11:01:03,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95792 to 65766. [2019-12-07 11:01:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65766 states. [2019-12-07 11:01:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65766 states to 65766 states and 225938 transitions. [2019-12-07 11:01:03,395 INFO L78 Accepts]: Start accepts. Automaton has 65766 states and 225938 transitions. Word has length 37 [2019-12-07 11:01:03,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:03,395 INFO L462 AbstractCegarLoop]: Abstraction has 65766 states and 225938 transitions. [2019-12-07 11:01:03,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:01:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 65766 states and 225938 transitions. [2019-12-07 11:01:03,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 11:01:03,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:03,448 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] [2019-12-07 11:01:03,448 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash -502050099, now seen corresponding path program 1 times [2019-12-07 11:01:03,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:03,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344256417] [2019-12-07 11:01:03,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:03,481 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 11:01:03,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344256417] [2019-12-07 11:01:03,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:03,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:01:03,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266825682] [2019-12-07 11:01:03,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:01:03,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:03,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:01:03,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:03,482 INFO L87 Difference]: Start difference. First operand 65766 states and 225938 transitions. Second operand 5 states. [2019-12-07 11:01:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:03,541 INFO L93 Difference]: Finished difference Result 11544 states and 38169 transitions. [2019-12-07 11:01:03,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:01:03,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 11:01:03,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:03,557 INFO L225 Difference]: With dead ends: 11544 [2019-12-07 11:01:03,557 INFO L226 Difference]: Without dead ends: 11544 [2019-12-07 11:01:03,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:01:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11544 states. [2019-12-07 11:01:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11544 to 11544. [2019-12-07 11:01:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11544 states. [2019-12-07 11:01:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11544 states to 11544 states and 38169 transitions. [2019-12-07 11:01:03,722 INFO L78 Accepts]: Start accepts. Automaton has 11544 states and 38169 transitions. Word has length 38 [2019-12-07 11:01:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:03,723 INFO L462 AbstractCegarLoop]: Abstraction has 11544 states and 38169 transitions. [2019-12-07 11:01:03,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:01:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11544 states and 38169 transitions. [2019-12-07 11:01:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:01:03,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:03,735 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] [2019-12-07 11:01:03,735 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1651509924, now seen corresponding path program 1 times [2019-12-07 11:01:03,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:03,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955061881] [2019-12-07 11:01:03,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:03,779 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 11:01:03,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955061881] [2019-12-07 11:01:03,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:03,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:03,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854899058] [2019-12-07 11:01:03,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:03,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:03,781 INFO L87 Difference]: Start difference. First operand 11544 states and 38169 transitions. Second operand 4 states. [2019-12-07 11:01:03,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:03,833 INFO L93 Difference]: Finished difference Result 13290 states and 42668 transitions. [2019-12-07 11:01:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:01:03,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 11:01:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:03,850 INFO L225 Difference]: With dead ends: 13290 [2019-12-07 11:01:03,850 INFO L226 Difference]: Without dead ends: 11555 [2019-12-07 11:01:03,851 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 11:01:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11555 states. [2019-12-07 11:01:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11555 to 11536. [2019-12-07 11:01:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11536 states. [2019-12-07 11:01:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11536 states to 11536 states and 38025 transitions. [2019-12-07 11:01:04,020 INFO L78 Accepts]: Start accepts. Automaton has 11536 states and 38025 transitions. Word has length 49 [2019-12-07 11:01:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,020 INFO L462 AbstractCegarLoop]: Abstraction has 11536 states and 38025 transitions. [2019-12-07 11:01:04,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 11536 states and 38025 transitions. [2019-12-07 11:01:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:01:04,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,032 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] [2019-12-07 11:01:04,033 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:04,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:04,033 INFO L82 PathProgramCache]: Analyzing trace with hash -87410594, now seen corresponding path program 2 times [2019-12-07 11:01:04,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:04,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814807814] [2019-12-07 11:01:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:04,081 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 11:01:04,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814807814] [2019-12-07 11:01:04,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:04,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:04,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481780884] [2019-12-07 11:01:04,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:04,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:04,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:04,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:04,082 INFO L87 Difference]: Start difference. First operand 11536 states and 38025 transitions. Second operand 4 states. [2019-12-07 11:01:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:04,135 INFO L93 Difference]: Finished difference Result 15543 states and 47565 transitions. [2019-12-07 11:01:04,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:01:04,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 11:01:04,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:04,150 INFO L225 Difference]: With dead ends: 15543 [2019-12-07 11:01:04,150 INFO L226 Difference]: Without dead ends: 11537 [2019-12-07 11:01:04,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 11:01:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11537 states. [2019-12-07 11:01:04,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11537 to 11528. [2019-12-07 11:01:04,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11528 states. [2019-12-07 11:01:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11528 states to 11528 states and 35521 transitions. [2019-12-07 11:01:04,311 INFO L78 Accepts]: Start accepts. Automaton has 11528 states and 35521 transitions. Word has length 49 [2019-12-07 11:01:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,311 INFO L462 AbstractCegarLoop]: Abstraction has 11528 states and 35521 transitions. [2019-12-07 11:01:04,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 11528 states and 35521 transitions. [2019-12-07 11:01:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:01:04,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,322 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] [2019-12-07 11:01:04,322 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:04,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash -534834412, now seen corresponding path program 3 times [2019-12-07 11:01:04,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:04,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8368785] [2019-12-07 11:01:04,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:04,366 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 11:01:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8368785] [2019-12-07 11:01:04,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:01:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545364410] [2019-12-07 11:01:04,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:01:04,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:04,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:01:04,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:01:04,368 INFO L87 Difference]: Start difference. First operand 11528 states and 35521 transitions. Second operand 6 states. [2019-12-07 11:01:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:04,430 INFO L93 Difference]: Finished difference Result 9926 states and 31903 transitions. [2019-12-07 11:01:04,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:01:04,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 11:01:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:04,436 INFO L225 Difference]: With dead ends: 9926 [2019-12-07 11:01:04,436 INFO L226 Difference]: Without dead ends: 3559 [2019-12-07 11:01:04,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:01:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3559 states. [2019-12-07 11:01:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3559 to 3551. [2019-12-07 11:01:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3551 states. [2019-12-07 11:01:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 9643 transitions. [2019-12-07 11:01:04,479 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 9643 transitions. Word has length 49 [2019-12-07 11:01:04,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,480 INFO L462 AbstractCegarLoop]: Abstraction has 3551 states and 9643 transitions. [2019-12-07 11:01:04,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:01:04,480 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 9643 transitions. [2019-12-07 11:01:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 11:01:04,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:04,483 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:04,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1572659232, now seen corresponding path program 1 times [2019-12-07 11:01:04,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:04,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554805760] [2019-12-07 11:01:04,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:04,517 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 11:01:04,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554805760] [2019-12-07 11:01:04,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:04,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:01:04,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211499496] [2019-12-07 11:01:04,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:01:04,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:01:04,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:01:04,518 INFO L87 Difference]: Start difference. First operand 3551 states and 9643 transitions. Second operand 4 states. [2019-12-07 11:01:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:04,540 INFO L93 Difference]: Finished difference Result 3958 states and 10578 transitions. [2019-12-07 11:01:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:01:04,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 11:01:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:04,541 INFO L225 Difference]: With dead ends: 3958 [2019-12-07 11:01:04,541 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 11:01:04,541 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 11:01:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 11:01:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-07 11:01:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 11:01:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1050 transitions. [2019-12-07 11:01:04,545 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1050 transitions. Word has length 65 [2019-12-07 11:01:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,545 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1050 transitions. [2019-12-07 11:01:04,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:01:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1050 transitions. [2019-12-07 11:01:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:01:04,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:04,546 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:04,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:04,546 INFO L82 PathProgramCache]: Analyzing trace with hash -654325219, now seen corresponding path program 1 times [2019-12-07 11:01:04,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:04,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463787368] [2019-12-07 11:01:04,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:04,620 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 11:01:04,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463787368] [2019-12-07 11:01:04,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:04,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:01:04,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222463853] [2019-12-07 11:01:04,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:01:04,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:01:04,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:01:04,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:01:04,621 INFO L87 Difference]: Start difference. First operand 481 states and 1050 transitions. Second operand 7 states. [2019-12-07 11:01:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:04,776 INFO L93 Difference]: Finished difference Result 1024 states and 2199 transitions. [2019-12-07 11:01:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:01:04,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 11:01:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:04,777 INFO L225 Difference]: With dead ends: 1024 [2019-12-07 11:01:04,777 INFO L226 Difference]: Without dead ends: 757 [2019-12-07 11:01:04,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:01:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-12-07 11:01:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 551. [2019-12-07 11:01:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-12-07 11:01:04,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1174 transitions. [2019-12-07 11:01:04,782 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1174 transitions. Word has length 66 [2019-12-07 11:01:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:04,783 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 1174 transitions. [2019-12-07 11:01:04,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:01:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1174 transitions. [2019-12-07 11:01:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:01:04,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:04,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:01:04,783 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:01:04,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:04,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1220820073, now seen corresponding path program 2 times [2019-12-07 11:01:04,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:01:04,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395429395] [2019-12-07 11:01:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:01:04,862 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:01:04,862 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:01:04,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32|) |v_ULTIMATE.start_main_~#t325~0.offset_23| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t325~0.base_32|) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t325~0.base_32| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32| 1)) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32|) 0) (= 0 v_~z$flush_delayed~0_302) (= |v_ULTIMATE.start_main_~#t325~0.offset_23| 0) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t325~0.base=|v_ULTIMATE.start_main_~#t325~0.base_32|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_19|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_16|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_25|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t325~0.offset=|v_ULTIMATE.start_main_~#t325~0.offset_23|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t325~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t328~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_~#t327~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t326~0.base, ~x~0, ULTIMATE.start_main_~#t325~0.offset, ULTIMATE.start_main_~#t328~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t327~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:01:04,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t326~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t326~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t326~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12|) |v_ULTIMATE.start_main_~#t326~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t326~0.offset_11| 0) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t326~0.base] because there is no mapped edge [2019-12-07 11:01:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9|) |v_ULTIMATE.start_main_~#t327~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t327~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t327~0.base_9|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t327~0.base_9|) (= |v_ULTIMATE.start_main_~#t327~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_8|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t327~0.base, ULTIMATE.start_main_~#t327~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:04,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_ULTIMATE.start_main_~#t328~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t328~0.base_13|) (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t328~0.base_13| 4)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13|) |v_ULTIMATE.start_main_~#t328~0.offset_11| 3)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t328~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t328~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t328~0.base, #length] because there is no mapped edge [2019-12-07 11:01:04,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 11:01:04,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1926744270 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1926744270 256) 0)) (.cse1 (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| |P3Thread1of1ForFork3_#t~ite29_Out1926744270|))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| ~z$w_buff0~0_In1926744270) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| ~z$w_buff1~0_In1926744270) (or .cse0 .cse2) .cse1))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1926744270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926744270, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1926744270, ~z$w_buff1~0=~z$w_buff1~0_In1926744270} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1926744270|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1926744270|, ~z$w_buff0~0=~z$w_buff0~0_In1926744270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926744270, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1926744270, ~z$w_buff1~0=~z$w_buff1~0_In1926744270} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:01:04,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:01:04,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In536644220 256) 0))) (or (and (= ~z~0_In536644220 |P3Thread1of1ForFork3_#t~ite48_Out536644220|) .cse0) (and (= ~z$mem_tmp~0_In536644220 |P3Thread1of1ForFork3_#t~ite48_Out536644220|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In536644220, ~z$flush_delayed~0=~z$flush_delayed~0_In536644220, ~z~0=~z~0_In536644220} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In536644220, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out536644220|, ~z$flush_delayed~0=~z$flush_delayed~0_In536644220, ~z~0=~z~0_In536644220} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 11:01:04,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:01:04,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 11:01:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-91441583 256)))) (or (and (= ~z~0_In-91441583 |P2Thread1of1ForFork2_#t~ite25_Out-91441583|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite25_Out-91441583| ~z$mem_tmp~0_In-91441583)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-91441583, ~z$flush_delayed~0=~z$flush_delayed~0_In-91441583, ~z~0=~z~0_In-91441583} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-91441583, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-91441583|, ~z$flush_delayed~0=~z$flush_delayed~0_In-91441583, ~z~0=~z~0_In-91441583} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:01:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:01:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-664869230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-664869230 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite51_Out-664869230| ~z$w_buff0_used~0_In-664869230) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite51_Out-664869230| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-664869230|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 11:01:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In569457847 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In569457847 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In569457847 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In569457847 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite52_Out569457847|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In569457847 |P3Thread1of1ForFork3_#t~ite52_Out569457847|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out569457847|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 11:01:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1692543363 ~z$r_buff0_thd4~0_In1692543363)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1692543363 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1692543363 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out1692543363 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1692543363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1692543363} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out1692543363|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1692543363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1692543363} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:01:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1219958149 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1219958149 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1219958149 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1219958149 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In1219958149 |P3Thread1of1ForFork3_#t~ite54_Out1219958149|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out1219958149|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1219958149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219958149} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out1219958149|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1219958149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219958149} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 11:01:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:01:04,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:01:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-568372031 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-568372031 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-568372031 |ULTIMATE.start_main_#t~ite59_Out-568372031|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-568372031| ~z~0_In-568372031)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-568372031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-568372031, ~z$w_buff1~0=~z$w_buff1~0_In-568372031, ~z~0=~z~0_In-568372031} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-568372031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-568372031, ~z$w_buff1~0=~z$w_buff1~0_In-568372031, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-568372031|, ~z~0=~z~0_In-568372031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:01:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 11:01:04,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1967332163 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1967332163 |ULTIMATE.start_main_#t~ite61_Out-1967332163|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1967332163|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1967332163, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1967332163|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:01:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2010509751 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2010509751 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2010509751|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2010509751 |ULTIMATE.start_main_#t~ite62_Out2010509751|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2010509751|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:01:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1927376317 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1927376317 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-1927376317| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1927376317| ~z$r_buff0_thd0~0_In-1927376317) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1927376317|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:01:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-383004899 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-383004899 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-383004899 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-383004899 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-383004899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out-383004899| ~z$r_buff1_thd0~0_In-383004899) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-383004899|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 11:01:04,884 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:04,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:01:04 BasicIcfg [2019-12-07 11:01:04,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:01:04,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:01:04,966 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:01:04,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:01:04,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:59:42" (3/4) ... [2019-12-07 11:01:04,969 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:01:04,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t325~0.base_32|) |v_ULTIMATE.start_main_~#t325~0.offset_23| 0)) |v_#memory_int_27|) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t325~0.base_32|) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t325~0.base_32| 4)) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32| 1)) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t325~0.base_32|) 0) (= 0 v_~z$flush_delayed~0_302) (= |v_ULTIMATE.start_main_~#t325~0.offset_23| 0) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_~#t325~0.base=|v_ULTIMATE.start_main_~#t325~0.base_32|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_19|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_16|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_25|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t325~0.offset=|v_ULTIMATE.start_main_~#t325~0.offset_23|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t325~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t328~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_~#t327~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t326~0.base, ~x~0, ULTIMATE.start_main_~#t325~0.offset, ULTIMATE.start_main_~#t328~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t327~0.base, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:01:04,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t326~0.base_12| 4) |v_#length_21|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t326~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12| 1) |v_#valid_43|) (not (= 0 |v_ULTIMATE.start_main_~#t326~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t326~0.base_12|) |v_ULTIMATE.start_main_~#t326~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t326~0.offset_11| 0) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t326~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t326~0.offset=|v_ULTIMATE.start_main_~#t326~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t326~0.base=|v_ULTIMATE.start_main_~#t326~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t326~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t326~0.base] because there is no mapped edge [2019-12-07 11:01:04,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t327~0.base_9|) |v_ULTIMATE.start_main_~#t327~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t327~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t327~0.base_9|)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9|) 0) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t327~0.base_9| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t327~0.base_9|) (= |v_ULTIMATE.start_main_~#t327~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t327~0.base=|v_ULTIMATE.start_main_~#t327~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t327~0.offset=|v_ULTIMATE.start_main_~#t327~0.offset_8|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t327~0.base, ULTIMATE.start_main_~#t327~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 11:01:04,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_ULTIMATE.start_main_~#t328~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t328~0.base_13|) (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t328~0.base_13| 4)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t328~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t328~0.base_13|) |v_ULTIMATE.start_main_~#t328~0.offset_11| 3)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t328~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t328~0.offset=|v_ULTIMATE.start_main_~#t328~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t328~0.base=|v_ULTIMATE.start_main_~#t328~0.base_13|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t328~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t328~0.base, #length] because there is no mapped edge [2019-12-07 11:01:04,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 11:01:04,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In1926744270 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1926744270 256) 0)) (.cse1 (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| |P3Thread1of1ForFork3_#t~ite29_Out1926744270|))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| ~z$w_buff0~0_In1926744270) .cse1 (not .cse2)) (and (= |P3Thread1of1ForFork3_#t~ite28_Out1926744270| ~z$w_buff1~0_In1926744270) (or .cse0 .cse2) .cse1))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1926744270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926744270, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1926744270, ~z$w_buff1~0=~z$w_buff1~0_In1926744270} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1926744270|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1926744270|, ~z$w_buff0~0=~z$w_buff0~0_In1926744270, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1926744270, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1926744270, ~z$w_buff1~0=~z$w_buff1~0_In1926744270} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:01:04,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:01:04,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In536644220 256) 0))) (or (and (= ~z~0_In536644220 |P3Thread1of1ForFork3_#t~ite48_Out536644220|) .cse0) (and (= ~z$mem_tmp~0_In536644220 |P3Thread1of1ForFork3_#t~ite48_Out536644220|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In536644220, ~z$flush_delayed~0=~z$flush_delayed~0_In536644220, ~z~0=~z~0_In536644220} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In536644220, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out536644220|, ~z$flush_delayed~0=~z$flush_delayed~0_In536644220, ~z~0=~z~0_In536644220} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 11:01:04,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 11:01:04,985 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 11:01:04,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-91441583 256)))) (or (and (= ~z~0_In-91441583 |P2Thread1of1ForFork2_#t~ite25_Out-91441583|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite25_Out-91441583| ~z$mem_tmp~0_In-91441583)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-91441583, ~z$flush_delayed~0=~z$flush_delayed~0_In-91441583, ~z~0=~z~0_In-91441583} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-91441583, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-91441583|, ~z$flush_delayed~0=~z$flush_delayed~0_In-91441583, ~z~0=~z~0_In-91441583} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:01:04,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:01:04,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-664869230 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-664869230 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite51_Out-664869230| ~z$w_buff0_used~0_In-664869230) (or .cse0 .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite51_Out-664869230| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-664869230|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-664869230, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-664869230} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 11:01:04,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In569457847 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In569457847 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In569457847 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In569457847 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite52_Out569457847|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In569457847 |P3Thread1of1ForFork3_#t~ite52_Out569457847|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out569457847|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In569457847, ~z$w_buff0_used~0=~z$w_buff0_used~0_In569457847, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In569457847, ~z$w_buff1_used~0=~z$w_buff1_used~0_In569457847} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 11:01:04,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse0 (= ~z$r_buff0_thd4~0_Out1692543363 ~z$r_buff0_thd4~0_In1692543363)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1692543363 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1692543363 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (not .cse1) (= ~z$r_buff0_thd4~0_Out1692543363 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1692543363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1692543363} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out1692543363|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1692543363, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1692543363} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 11:01:04,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1219958149 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1219958149 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1219958149 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1219958149 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In1219958149 |P3Thread1of1ForFork3_#t~ite54_Out1219958149|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out1219958149|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1219958149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219958149} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out1219958149|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1219958149, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1219958149, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1219958149, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1219958149} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 11:01:04,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:01:04,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:01:04,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-568372031 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-568372031 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-568372031 |ULTIMATE.start_main_#t~ite59_Out-568372031|)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-568372031| ~z~0_In-568372031)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-568372031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-568372031, ~z$w_buff1~0=~z$w_buff1~0_In-568372031, ~z~0=~z~0_In-568372031} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-568372031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-568372031, ~z$w_buff1~0=~z$w_buff1~0_In-568372031, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-568372031|, ~z~0=~z~0_In-568372031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 11:01:04,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 11:01:04,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1967332163 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1967332163 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1967332163 |ULTIMATE.start_main_#t~ite61_Out-1967332163|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1967332163|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1967332163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1967332163, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1967332163|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1967332163} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 11:01:04,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2010509751 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In2010509751 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out2010509751|)) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In2010509751 |ULTIMATE.start_main_#t~ite62_Out2010509751|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out2010509751|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2010509751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 11:01:04,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1927376317 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1927376317 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-1927376317| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1927376317| ~z$r_buff0_thd0~0_In-1927376317) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1927376317|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1927376317, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1927376317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 11:01:04,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-383004899 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-383004899 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-383004899 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-383004899 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-383004899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out-383004899| ~z$r_buff1_thd0~0_In-383004899) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-383004899|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 11:01:04,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:01:05,068 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1c76f143-fb4f-454e-bfd1-b9fe19634a3e/bin/uautomizer/witness.graphml [2019-12-07 11:01:05,068 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:01:05,069 INFO L168 Benchmark]: Toolchain (without parser) took 83053.47 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 939.8 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 11:01:05,069 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:01:05,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:05,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.81 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 11:01:05,070 INFO L168 Benchmark]: Boogie Preprocessor took 33.79 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 11:01:05,071 INFO L168 Benchmark]: RCFGBuilder took 457.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.5 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:05,071 INFO L168 Benchmark]: TraceAbstraction took 82014.95 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 994.5 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 11:01:05,071 INFO L168 Benchmark]: Witness Printer took 101.85 ms. Allocated memory is still 6.9 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:01:05,073 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 398.79 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.81 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. * Boogie Preprocessor took 33.79 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. * RCFGBuilder took 457.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.5 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82014.95 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 994.5 MB in the beginning and 3.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. * Witness Printer took 101.85 ms. Allocated memory is still 6.9 GB. Free memory was 3.2 GB in the beginning and 3.2 GB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 213 ProgramPointsBefore, 115 ProgramPointsAfterwards, 256 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 11402 VarBasedMoverChecksPositive, 391 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 392 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 131114 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L858] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = z$w_buff0 [L804] 4 z$w_buff0 = 1 [L805] 4 z$w_buff1_used = z$w_buff0_used [L806] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$flush_delayed ? z$mem_tmp : z [L829] 4 z$flush_delayed = (_Bool)0 [L832] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 y = 1 [L778] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 3 z$flush_delayed = weak$$choice2 [L781] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 201 locations, 2 error locations. Result: UNSAFE, OverallTime: 81.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4078 SDtfs, 5518 SDslu, 7545 SDs, 0 SdLazy, 3313 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157746occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 117675 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 115833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...