./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013_tso.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_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/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 067e807811410fa96505932fe2d4a0eedd02acda ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:03:43,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:03:43,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:03:43,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:03:43,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:03:43,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:03:43,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:03:43,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:03:43,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:03:43,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:03:43,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:03:43,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:03:43,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:03:43,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:03:43,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:03:43,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:03:43,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:03:43,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:03:43,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:03:43,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:03:43,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:03:43,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:03:43,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:03:43,920 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:03:43,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:03:43,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:03:43,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:03:43,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:03:43,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:03:43,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:03:43,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:03:43,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:03:43,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:03:43,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:03:43,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:03:43,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:03:43,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:03:43,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:03:43,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:03:43,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:03:43,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:03:43,928 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:03:43,937 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:03:43,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:03:43,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:03:43,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:03:43,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:03:43,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:03:43,939 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:03:43,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:03:43,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:03:43,940 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_6144ce60-0e73-4622-be83-6579d8f1568f/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 -> 067e807811410fa96505932fe2d4a0eedd02acda [2019-12-07 18:03:44,043 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:03:44,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:03:44,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:03:44,058 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:03:44,058 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:03:44,059 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i [2019-12-07 18:03:44,100 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/data/22480e7e0/6290432da4f146e281612a6a21216540/FLAG5dc4c6e82 [2019-12-07 18:03:44,528 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:03:44,528 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i [2019-12-07 18:03:44,538 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/data/22480e7e0/6290432da4f146e281612a6a21216540/FLAG5dc4c6e82 [2019-12-07 18:03:44,873 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/data/22480e7e0/6290432da4f146e281612a6a21216540 [2019-12-07 18:03:44,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:03:44,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:03:44,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:03:44,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:03:44,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:03:44,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:03:44" (1/1) ... [2019-12-07 18:03:44,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c19867b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:44, skipping insertion in model container [2019-12-07 18:03:44,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:03:44" (1/1) ... [2019-12-07 18:03:44,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:03:44,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:03:45,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:03:45,170 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:03:45,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:03:45,258 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:03:45,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45 WrapperNode [2019-12-07 18:03:45,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:03:45,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:03:45,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:03:45,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:03:45,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:03:45,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:03:45,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:03:45,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:03:45,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... [2019-12-07 18:03:45,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:03:45,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:03:45,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:03:45,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:03:45,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:03:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:03:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:03:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:03:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:03:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:03:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:03:45,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:03:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:03:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:03:45,370 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:03:45,778 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:03:45,778 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:03:45,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:03:45 BoogieIcfgContainer [2019-12-07 18:03:45,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:03:45,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:03:45,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:03:45,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:03:45,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:03:44" (1/3) ... [2019-12-07 18:03:45,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c41df4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:03:45, skipping insertion in model container [2019-12-07 18:03:45,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:03:45" (2/3) ... [2019-12-07 18:03:45,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c41df4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:03:45, skipping insertion in model container [2019-12-07 18:03:45,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:03:45" (3/3) ... [2019-12-07 18:03:45,783 INFO L109 eAbstractionObserver]: Analyzing ICFG mix013_tso.opt.i [2019-12-07 18:03:45,790 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:03:45,790 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:03:45,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:03:45,795 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:03:45,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,825 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,842 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,843 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,844 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,845 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,846 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,847 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,848 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,849 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,850 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,851 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,852 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,860 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:03:45,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:03:45,884 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:03:45,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:03:45,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:03:45,885 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:03:45,885 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:03:45,885 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:03:45,885 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:03:45,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:03:45,896 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 18:03:45,897 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 18:03:45,964 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 18:03:45,964 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:03:45,977 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 18:03:46,000 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 18:03:46,037 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 18:03:46,037 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:03:46,046 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 18:03:46,072 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:03:46,072 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:03:49,938 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 18:03:50,401 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 18:03:50,452 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131114 [2019-12-07 18:03:50,452 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 18:03:50,455 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 18:03:59,828 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97990 states. [2019-12-07 18:03:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 97990 states. [2019-12-07 18:03:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:03:59,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:59,909 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:59,910 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 18:03:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash -904171455, now seen corresponding path program 1 times [2019-12-07 18:03:59,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:59,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928577541] [2019-12-07 18:03:59,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:00,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928577541] [2019-12-07 18:04:00,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:00,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:04:00,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465674750] [2019-12-07 18:04:00,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:04:00,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:00,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:04:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:00,086 INFO L87 Difference]: Start difference. First operand 97990 states. Second operand 3 states. [2019-12-07 18:04:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:00,758 INFO L93 Difference]: Finished difference Result 97126 states and 446136 transitions. [2019-12-07 18:04:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:04:00,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:04:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:01,262 INFO L225 Difference]: With dead ends: 97126 [2019-12-07 18:04:01,262 INFO L226 Difference]: Without dead ends: 90910 [2019-12-07 18:04:01,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:03,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90910 states. [2019-12-07 18:04:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90910 to 90910. [2019-12-07 18:04:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90910 states. [2019-12-07 18:04:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90910 states to 90910 states and 417332 transitions. [2019-12-07 18:04:06,594 INFO L78 Accepts]: Start accepts. Automaton has 90910 states and 417332 transitions. Word has length 9 [2019-12-07 18:04:06,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:06,595 INFO L462 AbstractCegarLoop]: Abstraction has 90910 states and 417332 transitions. [2019-12-07 18:04:06,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:04:06,595 INFO L276 IsEmpty]: Start isEmpty. Operand 90910 states and 417332 transitions. [2019-12-07 18:04:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:04:06,601 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:06,601 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:06,601 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 18:04:06,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1686431172, now seen corresponding path program 1 times [2019-12-07 18:04:06,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:06,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392081041] [2019-12-07 18:04:06,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:06,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:06,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392081041] [2019-12-07 18:04:06,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:06,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:04:06,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775176758] [2019-12-07 18:04:06,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:04:06,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:04:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:04:06,663 INFO L87 Difference]: Start difference. First operand 90910 states and 417332 transitions. Second operand 4 states. [2019-12-07 18:04:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:07,557 INFO L93 Difference]: Finished difference Result 140998 states and 625524 transitions. [2019-12-07 18:04:07,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:04:07,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:04:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:07,954 INFO L225 Difference]: With dead ends: 140998 [2019-12-07 18:04:07,954 INFO L226 Difference]: Without dead ends: 140930 [2019-12-07 18:04:07,955 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140930 states. [2019-12-07 18:04:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140930 to 137862. [2019-12-07 18:04:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137862 states. [2019-12-07 18:04:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137862 states to 137862 states and 614280 transitions. [2019-12-07 18:04:12,390 INFO L78 Accepts]: Start accepts. Automaton has 137862 states and 614280 transitions. Word has length 15 [2019-12-07 18:04:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:12,390 INFO L462 AbstractCegarLoop]: Abstraction has 137862 states and 614280 transitions. [2019-12-07 18:04:12,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:04:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 137862 states and 614280 transitions. [2019-12-07 18:04:12,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:04:12,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:12,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:12,397 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 18:04:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:12,397 INFO L82 PathProgramCache]: Analyzing trace with hash -806058920, now seen corresponding path program 1 times [2019-12-07 18:04:12,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:12,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802745978] [2019-12-07 18:04:12,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:12,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802745978] [2019-12-07 18:04:12,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:12,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:04:12,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848606049] [2019-12-07 18:04:12,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:04:12,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:04:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:04:12,444 INFO L87 Difference]: Start difference. First operand 137862 states and 614280 transitions. Second operand 4 states. [2019-12-07 18:04:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:14,888 INFO L93 Difference]: Finished difference Result 175654 states and 773028 transitions. [2019-12-07 18:04:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:04:14,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:04:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:15,433 INFO L225 Difference]: With dead ends: 175654 [2019-12-07 18:04:15,433 INFO L226 Difference]: Without dead ends: 175594 [2019-12-07 18:04:15,433 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175594 states. [2019-12-07 18:04:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175594 to 157746. [2019-12-07 18:04:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157746 states. [2019-12-07 18:04:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157746 states to 157746 states and 699816 transitions. [2019-12-07 18:04:20,581 INFO L78 Accepts]: Start accepts. Automaton has 157746 states and 699816 transitions. Word has length 18 [2019-12-07 18:04:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:20,582 INFO L462 AbstractCegarLoop]: Abstraction has 157746 states and 699816 transitions. [2019-12-07 18:04:20,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:04:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 157746 states and 699816 transitions. [2019-12-07 18:04:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:04:20,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:20,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:20,596 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 18:04:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash 363406382, now seen corresponding path program 1 times [2019-12-07 18:04:20,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:20,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015286976] [2019-12-07 18:04:20,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:20,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015286976] [2019-12-07 18:04:20,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:20,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:04:20,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690772782] [2019-12-07 18:04:20,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:04:20,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:20,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:04:20,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:20,665 INFO L87 Difference]: Start difference. First operand 157746 states and 699816 transitions. Second operand 3 states. [2019-12-07 18:04:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:21,367 INFO L93 Difference]: Finished difference Result 155822 states and 688606 transitions. [2019-12-07 18:04:21,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:04:21,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:04:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:21,798 INFO L225 Difference]: With dead ends: 155822 [2019-12-07 18:04:21,798 INFO L226 Difference]: Without dead ends: 155822 [2019-12-07 18:04:21,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155822 states. [2019-12-07 18:04:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155822 to 155675. [2019-12-07 18:04:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155675 states. [2019-12-07 18:04:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 688262 transitions. [2019-12-07 18:04:29,736 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 688262 transitions. Word has length 20 [2019-12-07 18:04:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:29,737 INFO L462 AbstractCegarLoop]: Abstraction has 155675 states and 688262 transitions. [2019-12-07 18:04:29,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:04:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 688262 transitions. [2019-12-07 18:04:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:04:29,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:29,748 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:29,748 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 18:04:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 811087671, now seen corresponding path program 1 times [2019-12-07 18:04:29,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:29,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925721779] [2019-12-07 18:04:29,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:29,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925721779] [2019-12-07 18:04:29,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:29,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:04:29,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250205261] [2019-12-07 18:04:29,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:04:29,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:04:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:04:29,811 INFO L87 Difference]: Start difference. First operand 155675 states and 688262 transitions. Second operand 4 states. [2019-12-07 18:04:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:30,498 INFO L93 Difference]: Finished difference Result 148754 states and 659072 transitions. [2019-12-07 18:04:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:04:30,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:04:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:30,893 INFO L225 Difference]: With dead ends: 148754 [2019-12-07 18:04:30,893 INFO L226 Difference]: Without dead ends: 148754 [2019-12-07 18:04:30,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:04:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148754 states. [2019-12-07 18:04:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148754 to 148754. [2019-12-07 18:04:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148754 states. [2019-12-07 18:04:35,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148754 states to 148754 states and 659072 transitions. [2019-12-07 18:04:35,341 INFO L78 Accepts]: Start accepts. Automaton has 148754 states and 659072 transitions. Word has length 21 [2019-12-07 18:04:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:35,341 INFO L462 AbstractCegarLoop]: Abstraction has 148754 states and 659072 transitions. [2019-12-07 18:04:35,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:04:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 148754 states and 659072 transitions. [2019-12-07 18:04:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 18:04:35,368 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:35,368 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 18:04:35,368 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 18:04:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1517939491, now seen corresponding path program 1 times [2019-12-07 18:04:35,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:35,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994960546] [2019-12-07 18:04:35,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:35,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994960546] [2019-12-07 18:04:35,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:35,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:04:35,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701134684] [2019-12-07 18:04:35,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:04:35,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:35,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:04:35,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:35,409 INFO L87 Difference]: Start difference. First operand 148754 states and 659072 transitions. Second operand 5 states. [2019-12-07 18:04:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:36,558 INFO L93 Difference]: Finished difference Result 175846 states and 770252 transitions. [2019-12-07 18:04:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:04:36,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 18:04:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:37,446 INFO L225 Difference]: With dead ends: 175846 [2019-12-07 18:04:37,446 INFO L226 Difference]: Without dead ends: 175738 [2019-12-07 18:04:37,446 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 18:04:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175738 states. [2019-12-07 18:04:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175738 to 147798. [2019-12-07 18:04:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147798 states. [2019-12-07 18:04:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147798 states to 147798 states and 655176 transitions. [2019-12-07 18:04:42,488 INFO L78 Accepts]: Start accepts. Automaton has 147798 states and 655176 transitions. Word has length 24 [2019-12-07 18:04:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:42,488 INFO L462 AbstractCegarLoop]: Abstraction has 147798 states and 655176 transitions. [2019-12-07 18:04:42,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:04:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 147798 states and 655176 transitions. [2019-12-07 18:04:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:04:42,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:42,630 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 18:04:42,630 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 18:04:42,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 455873455, now seen corresponding path program 1 times [2019-12-07 18:04:42,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:42,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972633260] [2019-12-07 18:04:42,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:42,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972633260] [2019-12-07 18:04:42,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:42,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:04:42,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997833830] [2019-12-07 18:04:42,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:04:42,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:04:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:42,690 INFO L87 Difference]: Start difference. First operand 147798 states and 655176 transitions. Second operand 3 states. [2019-12-07 18:04:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:43,337 INFO L93 Difference]: Finished difference Result 139222 states and 609976 transitions. [2019-12-07 18:04:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:04:43,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 18:04:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:43,713 INFO L225 Difference]: With dead ends: 139222 [2019-12-07 18:04:43,713 INFO L226 Difference]: Without dead ends: 139222 [2019-12-07 18:04:43,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:04:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139222 states. [2019-12-07 18:04:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139222 to 138902. [2019-12-07 18:04:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138902 states. [2019-12-07 18:04:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138902 states to 138902 states and 608808 transitions. [2019-12-07 18:04:49,713 INFO L78 Accepts]: Start accepts. Automaton has 138902 states and 608808 transitions. Word has length 34 [2019-12-07 18:04:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:49,713 INFO L462 AbstractCegarLoop]: Abstraction has 138902 states and 608808 transitions. [2019-12-07 18:04:49,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:04:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 138902 states and 608808 transitions. [2019-12-07 18:04:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:04:49,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:49,842 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:04:49,842 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 18:04:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash -608772183, now seen corresponding path program 1 times [2019-12-07 18:04:49,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:49,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123022481] [2019-12-07 18:04:49,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:49,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:49,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123022481] [2019-12-07 18:04:49,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:49,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:04:49,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34968532] [2019-12-07 18:04:49,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:04:49,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:49,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:04:49,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:04:49,908 INFO L87 Difference]: Start difference. First operand 138902 states and 608808 transitions. Second operand 5 states. [2019-12-07 18:04:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:04:51,206 INFO L93 Difference]: Finished difference Result 194896 states and 864928 transitions. [2019-12-07 18:04:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:04:51,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 18:04:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:04:51,723 INFO L225 Difference]: With dead ends: 194896 [2019-12-07 18:04:51,723 INFO L226 Difference]: Without dead ends: 194896 [2019-12-07 18:04:51,724 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 18:04:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194896 states. [2019-12-07 18:04:56,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194896 to 188630. [2019-12-07 18:04:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188630 states. [2019-12-07 18:04:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188630 states to 188630 states and 839240 transitions. [2019-12-07 18:04:57,690 INFO L78 Accepts]: Start accepts. Automaton has 188630 states and 839240 transitions. Word has length 35 [2019-12-07 18:04:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:04:57,690 INFO L462 AbstractCegarLoop]: Abstraction has 188630 states and 839240 transitions. [2019-12-07 18:04:57,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:04:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 188630 states and 839240 transitions. [2019-12-07 18:04:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:04:57,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:04:57,896 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 18:04:57,896 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 18:04:57,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:04:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash 151916713, now seen corresponding path program 2 times [2019-12-07 18:04:57,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:04:57,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439716800] [2019-12-07 18:04:57,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:04:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:04:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:04:58,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439716800] [2019-12-07 18:04:58,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:04:58,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:04:58,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043291741] [2019-12-07 18:04:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:04:58,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:04:58,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:04:58,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:04:58,006 INFO L87 Difference]: Start difference. First operand 188630 states and 839240 transitions. Second operand 7 states. [2019-12-07 18:05:00,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:00,167 INFO L93 Difference]: Finished difference Result 290542 states and 1293524 transitions. [2019-12-07 18:05:00,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:05:00,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 18:05:00,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:03,867 INFO L225 Difference]: With dead ends: 290542 [2019-12-07 18:05:03,867 INFO L226 Difference]: Without dead ends: 290542 [2019-12-07 18:05:03,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:05:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290542 states. [2019-12-07 18:05:09,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290542 to 196670. [2019-12-07 18:05:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196670 states. [2019-12-07 18:05:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196670 states to 196670 states and 877404 transitions. [2019-12-07 18:05:10,631 INFO L78 Accepts]: Start accepts. Automaton has 196670 states and 877404 transitions. Word has length 35 [2019-12-07 18:05:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:10,631 INFO L462 AbstractCegarLoop]: Abstraction has 196670 states and 877404 transitions. [2019-12-07 18:05:10,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:05:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 196670 states and 877404 transitions. [2019-12-07 18:05:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:10,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:10,852 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 18:05:10,852 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 18:05:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash -340130255, now seen corresponding path program 3 times [2019-12-07 18:05:10,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:10,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135662109] [2019-12-07 18:05:10,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:10,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135662109] [2019-12-07 18:05:10,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:10,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:05:10,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848055392] [2019-12-07 18:05:10,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:05:10,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:05:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:05:10,946 INFO L87 Difference]: Start difference. First operand 196670 states and 877404 transitions. Second operand 8 states. [2019-12-07 18:05:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:14,064 INFO L93 Difference]: Finished difference Result 389598 states and 1733674 transitions. [2019-12-07 18:05:14,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:05:14,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 18:05:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:15,148 INFO L225 Difference]: With dead ends: 389598 [2019-12-07 18:05:15,148 INFO L226 Difference]: Without dead ends: 389598 [2019-12-07 18:05:15,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:05:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389598 states. [2019-12-07 18:05:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389598 to 214622. [2019-12-07 18:05:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214622 states. [2019-12-07 18:05:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214622 states to 214622 states and 954372 transitions. [2019-12-07 18:05:27,276 INFO L78 Accepts]: Start accepts. Automaton has 214622 states and 954372 transitions. Word has length 35 [2019-12-07 18:05:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:27,276 INFO L462 AbstractCegarLoop]: Abstraction has 214622 states and 954372 transitions. [2019-12-07 18:05:27,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:05:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 214622 states and 954372 transitions. [2019-12-07 18:05:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:27,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:27,503 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 18:05:27,503 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 18:05:27,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 159357381, now seen corresponding path program 4 times [2019-12-07 18:05:27,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:27,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811061798] [2019-12-07 18:05:27,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:27,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811061798] [2019-12-07 18:05:27,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:27,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:05:27,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31732054] [2019-12-07 18:05:27,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:05:27,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:27,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:05:27,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:05:27,638 INFO L87 Difference]: Start difference. First operand 214622 states and 954372 transitions. Second operand 8 states. [2019-12-07 18:05:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:30,440 INFO L93 Difference]: Finished difference Result 392754 states and 1744382 transitions. [2019-12-07 18:05:30,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 18:05:30,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 18:05:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:31,983 INFO L225 Difference]: With dead ends: 392754 [2019-12-07 18:05:31,983 INFO L226 Difference]: Without dead ends: 392754 [2019-12-07 18:05:31,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:05:34,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392754 states. [2019-12-07 18:05:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392754 to 232578. [2019-12-07 18:05:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232578 states. [2019-12-07 18:05:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232578 states to 232578 states and 1031012 transitions. [2019-12-07 18:05:40,488 INFO L78 Accepts]: Start accepts. Automaton has 232578 states and 1031012 transitions. Word has length 35 [2019-12-07 18:05:40,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:40,489 INFO L462 AbstractCegarLoop]: Abstraction has 232578 states and 1031012 transitions. [2019-12-07 18:05:40,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:05:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 232578 states and 1031012 transitions. [2019-12-07 18:05:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:05:40,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:40,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] [2019-12-07 18:05:40,735 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 18:05:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1992335047, now seen corresponding path program 5 times [2019-12-07 18:05:40,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:40,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312052530] [2019-12-07 18:05:40,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:40,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312052530] [2019-12-07 18:05:40,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:40,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:05:40,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428585556] [2019-12-07 18:05:40,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:05:40,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:40,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:05:40,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:40,786 INFO L87 Difference]: Start difference. First operand 232578 states and 1031012 transitions. Second operand 4 states. [2019-12-07 18:05:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:42,272 INFO L93 Difference]: Finished difference Result 230782 states and 1022526 transitions. [2019-12-07 18:05:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:05:42,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:05:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:42,911 INFO L225 Difference]: With dead ends: 230782 [2019-12-07 18:05:42,911 INFO L226 Difference]: Without dead ends: 230782 [2019-12-07 18:05:42,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:05:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230782 states. [2019-12-07 18:05:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230782 to 227746. [2019-12-07 18:05:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227746 states. [2019-12-07 18:05:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227746 states to 227746 states and 1008400 transitions. [2019-12-07 18:05:52,366 INFO L78 Accepts]: Start accepts. Automaton has 227746 states and 1008400 transitions. Word has length 35 [2019-12-07 18:05:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:05:52,367 INFO L462 AbstractCegarLoop]: Abstraction has 227746 states and 1008400 transitions. [2019-12-07 18:05:52,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:05:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 227746 states and 1008400 transitions. [2019-12-07 18:05:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:05:52,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:05:52,643 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 18:05:52,643 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 18:05:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:05:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1442520795, now seen corresponding path program 1 times [2019-12-07 18:05:52,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:05:52,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118714367] [2019-12-07 18:05:52,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:05:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:05:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:05:52,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118714367] [2019-12-07 18:05:52,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:05:52,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:05:52,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929081974] [2019-12-07 18:05:52,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:05:52,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:05:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:05:52,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:05:52,713 INFO L87 Difference]: Start difference. First operand 227746 states and 1008400 transitions. Second operand 6 states. [2019-12-07 18:05:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:05:54,647 INFO L93 Difference]: Finished difference Result 287858 states and 1273620 transitions. [2019-12-07 18:05:54,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:05:54,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 18:05:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:05:55,361 INFO L225 Difference]: With dead ends: 287858 [2019-12-07 18:05:55,361 INFO L226 Difference]: Without dead ends: 257106 [2019-12-07 18:05:55,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:05:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257106 states. [2019-12-07 18:06:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257106 to 257106. [2019-12-07 18:06:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257106 states. [2019-12-07 18:06:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257106 states to 257106 states and 1141904 transitions. [2019-12-07 18:06:02,680 INFO L78 Accepts]: Start accepts. Automaton has 257106 states and 1141904 transitions. Word has length 36 [2019-12-07 18:06:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:02,680 INFO L462 AbstractCegarLoop]: Abstraction has 257106 states and 1141904 transitions. [2019-12-07 18:06:02,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:06:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 257106 states and 1141904 transitions. [2019-12-07 18:06:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:06:02,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:02,998 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 18:06:02,999 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 18:06:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 663998501, now seen corresponding path program 2 times [2019-12-07 18:06:02,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:02,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753767857] [2019-12-07 18:06:02,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753767857] [2019-12-07 18:06:03,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:03,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:06:03,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139240423] [2019-12-07 18:06:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:06:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:03,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:06:03,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:06:03,102 INFO L87 Difference]: Start difference. First operand 257106 states and 1141904 transitions. Second operand 8 states. [2019-12-07 18:06:08,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:08,418 INFO L93 Difference]: Finished difference Result 369118 states and 1636008 transitions. [2019-12-07 18:06:08,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:06:08,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 18:06:08,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:09,356 INFO L225 Difference]: With dead ends: 369118 [2019-12-07 18:06:09,357 INFO L226 Difference]: Without dead ends: 344926 [2019-12-07 18:06:09,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:06:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344926 states. [2019-12-07 18:06:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344926 to 264674. [2019-12-07 18:06:16,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264674 states. [2019-12-07 18:06:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264674 states to 264674 states and 1177472 transitions. [2019-12-07 18:06:18,081 INFO L78 Accepts]: Start accepts. Automaton has 264674 states and 1177472 transitions. Word has length 36 [2019-12-07 18:06:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:18,082 INFO L462 AbstractCegarLoop]: Abstraction has 264674 states and 1177472 transitions. [2019-12-07 18:06:18,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:06:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 264674 states and 1177472 transitions. [2019-12-07 18:06:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:06:18,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:18,408 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 18:06:18,409 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 18:06:18,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1704555619, now seen corresponding path program 3 times [2019-12-07 18:06:18,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:18,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605128278] [2019-12-07 18:06:18,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:18,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605128278] [2019-12-07 18:06:18,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:18,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:06:18,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264088592] [2019-12-07 18:06:18,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:06:18,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:18,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:06:18,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:06:18,484 INFO L87 Difference]: Start difference. First operand 264674 states and 1177472 transitions. Second operand 8 states. [2019-12-07 18:06:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:21,864 INFO L93 Difference]: Finished difference Result 458096 states and 2026641 transitions. [2019-12-07 18:06:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:06:21,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 18:06:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:23,117 INFO L225 Difference]: With dead ends: 458096 [2019-12-07 18:06:23,118 INFO L226 Difference]: Without dead ends: 423188 [2019-12-07 18:06:23,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:06:26,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423188 states. [2019-12-07 18:06:31,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423188 to 273174. [2019-12-07 18:06:31,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273174 states. [2019-12-07 18:06:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273174 states to 273174 states and 1213176 transitions. [2019-12-07 18:06:32,736 INFO L78 Accepts]: Start accepts. Automaton has 273174 states and 1213176 transitions. Word has length 36 [2019-12-07 18:06:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:32,737 INFO L462 AbstractCegarLoop]: Abstraction has 273174 states and 1213176 transitions. [2019-12-07 18:06:32,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:06:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 273174 states and 1213176 transitions. [2019-12-07 18:06:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:06:33,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:33,053 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 18:06:33,053 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 18:06:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash 894659209, now seen corresponding path program 4 times [2019-12-07 18:06:33,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:33,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407939266] [2019-12-07 18:06:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:33,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407939266] [2019-12-07 18:06:33,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:33,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:06:33,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37809854] [2019-12-07 18:06:33,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:06:33,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:33,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:06:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:06:33,166 INFO L87 Difference]: Start difference. First operand 273174 states and 1213176 transitions. Second operand 9 states. [2019-12-07 18:06:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:40,947 INFO L93 Difference]: Finished difference Result 536386 states and 2378414 transitions. [2019-12-07 18:06:40,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 18:06:40,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 18:06:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:42,373 INFO L225 Difference]: With dead ends: 536386 [2019-12-07 18:06:42,373 INFO L226 Difference]: Without dead ends: 490174 [2019-12-07 18:06:42,373 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:06:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490174 states. [2019-12-07 18:06:52,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490174 to 287550. [2019-12-07 18:06:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287550 states. [2019-12-07 18:06:52,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287550 states to 287550 states and 1277518 transitions. [2019-12-07 18:06:52,953 INFO L78 Accepts]: Start accepts. Automaton has 287550 states and 1277518 transitions. Word has length 36 [2019-12-07 18:06:52,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:52,953 INFO L462 AbstractCegarLoop]: Abstraction has 287550 states and 1277518 transitions. [2019-12-07 18:06:52,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:06:52,954 INFO L276 IsEmpty]: Start isEmpty. Operand 287550 states and 1277518 transitions. [2019-12-07 18:06:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 18:06:53,300 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:53,301 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 18:06:53,301 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 18:06:53,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1886066689, now seen corresponding path program 5 times [2019-12-07 18:06:53,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:06:53,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383374244] [2019-12-07 18:06:53,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:06:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:06:53,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383374244] [2019-12-07 18:06:53,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:53,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:06:53,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627845068] [2019-12-07 18:06:53,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:06:53,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:06:53,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:06:53,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:06:53,374 INFO L87 Difference]: Start difference. First operand 287550 states and 1277518 transitions. Second operand 9 states. [2019-12-07 18:06:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:57,151 INFO L93 Difference]: Finished difference Result 510954 states and 2264182 transitions. [2019-12-07 18:06:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 18:06:57,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 18:06:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:58,534 INFO L225 Difference]: With dead ends: 510954 [2019-12-07 18:06:58,534 INFO L226 Difference]: Without dead ends: 484202 [2019-12-07 18:06:58,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:07:02,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484202 states. [2019-12-07 18:07:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484202 to 271594. [2019-12-07 18:07:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271594 states. [2019-12-07 18:07:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271594 states to 271594 states and 1204630 transitions. [2019-12-07 18:07:08,772 INFO L78 Accepts]: Start accepts. Automaton has 271594 states and 1204630 transitions. Word has length 36 [2019-12-07 18:07:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:08,773 INFO L462 AbstractCegarLoop]: Abstraction has 271594 states and 1204630 transitions. [2019-12-07 18:07:08,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:07:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 271594 states and 1204630 transitions. [2019-12-07 18:07:09,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:07:09,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:09,119 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 18:07:09,120 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 18:07:09,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:09,120 INFO L82 PathProgramCache]: Analyzing trace with hash 442372446, now seen corresponding path program 1 times [2019-12-07 18:07:09,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:09,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524927372] [2019-12-07 18:07:09,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:09,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524927372] [2019-12-07 18:07:09,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:09,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:07:09,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013643363] [2019-12-07 18:07:09,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:07:09,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:09,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:07:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:09,151 INFO L87 Difference]: Start difference. First operand 271594 states and 1204630 transitions. Second operand 3 states. [2019-12-07 18:07:12,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:12,752 INFO L93 Difference]: Finished difference Result 210233 states and 865162 transitions. [2019-12-07 18:07:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:07:12,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 18:07:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:13,325 INFO L225 Difference]: With dead ends: 210233 [2019-12-07 18:07:13,325 INFO L226 Difference]: Without dead ends: 210233 [2019-12-07 18:07:13,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:07:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210233 states. [2019-12-07 18:07:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210233 to 210233. [2019-12-07 18:07:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210233 states. [2019-12-07 18:07:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210233 states to 210233 states and 865162 transitions. [2019-12-07 18:07:18,646 INFO L78 Accepts]: Start accepts. Automaton has 210233 states and 865162 transitions. Word has length 37 [2019-12-07 18:07:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:18,646 INFO L462 AbstractCegarLoop]: Abstraction has 210233 states and 865162 transitions. [2019-12-07 18:07:18,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:07:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 210233 states and 865162 transitions. [2019-12-07 18:07:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:07:18,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:18,897 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 18:07:18,897 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 18:07:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1811485366, now seen corresponding path program 2 times [2019-12-07 18:07:18,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:18,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262580001] [2019-12-07 18:07:18,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:18,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262580001] [2019-12-07 18:07:18,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:18,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:18,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147435086] [2019-12-07 18:07:18,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:18,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:18,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:18,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:18,924 INFO L87 Difference]: Start difference. First operand 210233 states and 865162 transitions. Second operand 4 states. [2019-12-07 18:07:19,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:19,220 INFO L93 Difference]: Finished difference Result 84417 states and 295696 transitions. [2019-12-07 18:07:19,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:19,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 18:07:19,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:19,749 INFO L225 Difference]: With dead ends: 84417 [2019-12-07 18:07:19,749 INFO L226 Difference]: Without dead ends: 84417 [2019-12-07 18:07:19,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84417 states. [2019-12-07 18:07:21,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84417 to 84417. [2019-12-07 18:07:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84417 states. [2019-12-07 18:07:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84417 states to 84417 states and 295696 transitions. [2019-12-07 18:07:21,423 INFO L78 Accepts]: Start accepts. Automaton has 84417 states and 295696 transitions. Word has length 37 [2019-12-07 18:07:21,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:21,424 INFO L462 AbstractCegarLoop]: Abstraction has 84417 states and 295696 transitions. [2019-12-07 18:07:21,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:21,424 INFO L276 IsEmpty]: Start isEmpty. Operand 84417 states and 295696 transitions. [2019-12-07 18:07:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 18:07:21,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:21,508 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 18:07:21,508 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 18:07:21,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:21,508 INFO L82 PathProgramCache]: Analyzing trace with hash -502050099, now seen corresponding path program 1 times [2019-12-07 18:07:21,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:21,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246096727] [2019-12-07 18:07:21,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:21,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246096727] [2019-12-07 18:07:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:21,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335720232] [2019-12-07 18:07:21,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:21,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:21,547 INFO L87 Difference]: Start difference. First operand 84417 states and 295696 transitions. Second operand 5 states. [2019-12-07 18:07:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:21,633 INFO L93 Difference]: Finished difference Result 18158 states and 62816 transitions. [2019-12-07 18:07:21,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:21,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 18:07:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:21,660 INFO L225 Difference]: With dead ends: 18158 [2019-12-07 18:07:21,660 INFO L226 Difference]: Without dead ends: 18158 [2019-12-07 18:07:21,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18158 states. [2019-12-07 18:07:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18158 to 14706. [2019-12-07 18:07:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14706 states. [2019-12-07 18:07:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14706 states to 14706 states and 49948 transitions. [2019-12-07 18:07:21,889 INFO L78 Accepts]: Start accepts. Automaton has 14706 states and 49948 transitions. Word has length 38 [2019-12-07 18:07:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:21,889 INFO L462 AbstractCegarLoop]: Abstraction has 14706 states and 49948 transitions. [2019-12-07 18:07:21,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14706 states and 49948 transitions. [2019-12-07 18:07:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:07:21,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:21,904 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 18:07:21,904 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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 18:07:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1651509924, now seen corresponding path program 1 times [2019-12-07 18:07:21,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:21,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534052286] [2019-12-07 18:07:21,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:22,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534052286] [2019-12-07 18:07:22,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:22,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16380647] [2019-12-07 18:07:22,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:22,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:22,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:22,253 INFO L87 Difference]: Start difference. First operand 14706 states and 49948 transitions. Second operand 4 states. [2019-12-07 18:07:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:22,302 INFO L93 Difference]: Finished difference Result 16452 states and 54447 transitions. [2019-12-07 18:07:22,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:22,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:07:22,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:22,322 INFO L225 Difference]: With dead ends: 16452 [2019-12-07 18:07:22,322 INFO L226 Difference]: Without dead ends: 14207 [2019-12-07 18:07:22,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14207 states. [2019-12-07 18:07:22,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14207 to 14138. [2019-12-07 18:07:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14138 states. [2019-12-07 18:07:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 48419 transitions. [2019-12-07 18:07:22,517 INFO L78 Accepts]: Start accepts. Automaton has 14138 states and 48419 transitions. Word has length 49 [2019-12-07 18:07:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:22,518 INFO L462 AbstractCegarLoop]: Abstraction has 14138 states and 48419 transitions. [2019-12-07 18:07:22,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 14138 states and 48419 transitions. [2019-12-07 18:07:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:07:22,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:22,532 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 18:07:22,532 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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 18:07:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash -87410594, now seen corresponding path program 2 times [2019-12-07 18:07:22,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:22,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720470572] [2019-12-07 18:07:22,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:22,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720470572] [2019-12-07 18:07:22,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:07:22,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048923115] [2019-12-07 18:07:22,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:07:22,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:22,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:07:22,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:22,575 INFO L87 Difference]: Start difference. First operand 14138 states and 48419 transitions. Second operand 6 states. [2019-12-07 18:07:22,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:22,637 INFO L93 Difference]: Finished difference Result 12674 states and 45088 transitions. [2019-12-07 18:07:22,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:07:22,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 18:07:22,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:22,648 INFO L225 Difference]: With dead ends: 12674 [2019-12-07 18:07:22,648 INFO L226 Difference]: Without dead ends: 7406 [2019-12-07 18:07:22,648 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 18:07:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7406 states. [2019-12-07 18:07:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7406 to 7390. [2019-12-07 18:07:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-07 18:07:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 23431 transitions. [2019-12-07 18:07:22,738 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 23431 transitions. Word has length 49 [2019-12-07 18:07:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:22,739 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 23431 transitions. [2019-12-07 18:07:22,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:07:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 23431 transitions. [2019-12-07 18:07:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:07:22,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:22,745 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 18:07:22,745 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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 18:07:22,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 471345684, now seen corresponding path program 1 times [2019-12-07 18:07:22,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:22,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53348881] [2019-12-07 18:07:22,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:22,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53348881] [2019-12-07 18:07:22,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:07:22,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643250896] [2019-12-07 18:07:22,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:07:22,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:07:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:22,803 INFO L87 Difference]: Start difference. First operand 7390 states and 23431 transitions. Second operand 5 states. [2019-12-07 18:07:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:22,843 INFO L93 Difference]: Finished difference Result 7933 states and 24660 transitions. [2019-12-07 18:07:22,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:07:22,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 18:07:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:22,848 INFO L225 Difference]: With dead ends: 7933 [2019-12-07 18:07:22,848 INFO L226 Difference]: Without dead ends: 4235 [2019-12-07 18:07:22,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:07:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2019-12-07 18:07:22,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4235. [2019-12-07 18:07:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4235 states. [2019-12-07 18:07:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4235 states to 4235 states and 11630 transitions. [2019-12-07 18:07:22,892 INFO L78 Accepts]: Start accepts. Automaton has 4235 states and 11630 transitions. Word has length 65 [2019-12-07 18:07:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 4235 states and 11630 transitions. [2019-12-07 18:07:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:07:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4235 states and 11630 transitions. [2019-12-07 18:07:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:07:22,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:22,895 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 18:07:22,895 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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 18:07:22,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:22,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1242442434, now seen corresponding path program 2 times [2019-12-07 18:07:22,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:22,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718283100] [2019-12-07 18:07:22,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:22,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718283100] [2019-12-07 18:07:22,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:07:22,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688833319] [2019-12-07 18:07:22,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:07:22,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:07:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:07:22,967 INFO L87 Difference]: Start difference. First operand 4235 states and 11630 transitions. Second operand 7 states. [2019-12-07 18:07:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:23,092 INFO L93 Difference]: Finished difference Result 8273 states and 23125 transitions. [2019-12-07 18:07:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 18:07:23,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 18:07:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:23,098 INFO L225 Difference]: With dead ends: 8273 [2019-12-07 18:07:23,098 INFO L226 Difference]: Without dead ends: 6699 [2019-12-07 18:07:23,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:07:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6699 states. [2019-12-07 18:07:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6699 to 4680. [2019-12-07 18:07:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-12-07 18:07:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 12724 transitions. [2019-12-07 18:07:23,157 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 12724 transitions. Word has length 65 [2019-12-07 18:07:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:23,158 INFO L462 AbstractCegarLoop]: Abstraction has 4680 states and 12724 transitions. [2019-12-07 18:07:23,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:07:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 12724 transitions. [2019-12-07 18:07:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:07:23,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:23,161 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 18:07:23,161 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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 18:07:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1552413418, now seen corresponding path program 3 times [2019-12-07 18:07:23,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:23,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145107249] [2019-12-07 18:07:23,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:23,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145107249] [2019-12-07 18:07:23,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:23,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:07:23,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854795424] [2019-12-07 18:07:23,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:07:23,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:23,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:07:23,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:07:23,193 INFO L87 Difference]: Start difference. First operand 4680 states and 12724 transitions. Second operand 4 states. [2019-12-07 18:07:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:23,211 INFO L93 Difference]: Finished difference Result 5087 states and 13659 transitions. [2019-12-07 18:07:23,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:07:23,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:07:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:23,212 INFO L225 Difference]: With dead ends: 5087 [2019-12-07 18:07:23,212 INFO L226 Difference]: Without dead ends: 481 [2019-12-07 18:07:23,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:07:23,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-12-07 18:07:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2019-12-07 18:07:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-12-07 18:07:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1053 transitions. [2019-12-07 18:07:23,217 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1053 transitions. Word has length 65 [2019-12-07 18:07:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:23,217 INFO L462 AbstractCegarLoop]: Abstraction has 481 states and 1053 transitions. [2019-12-07 18:07:23,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:07:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1053 transitions. [2019-12-07 18:07:23,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:07:23,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:23,218 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 18:07:23,218 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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 18:07:23,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:23,218 INFO L82 PathProgramCache]: Analyzing trace with hash -654325219, now seen corresponding path program 1 times [2019-12-07 18:07:23,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:23,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821222928] [2019-12-07 18:07:23,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:07:23,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821222928] [2019-12-07 18:07:23,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:23,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:07:23,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530353249] [2019-12-07 18:07:23,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:07:23,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:07:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:07:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:07:23,360 INFO L87 Difference]: Start difference. First operand 481 states and 1053 transitions. Second operand 11 states. [2019-12-07 18:07:24,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:07:24,829 INFO L93 Difference]: Finished difference Result 1177 states and 2550 transitions. [2019-12-07 18:07:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:07:24,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 18:07:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:07:24,832 INFO L225 Difference]: With dead ends: 1177 [2019-12-07 18:07:24,832 INFO L226 Difference]: Without dead ends: 890 [2019-12-07 18:07:24,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:07:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2019-12-07 18:07:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 551. [2019-12-07 18:07:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-12-07 18:07:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1177 transitions. [2019-12-07 18:07:24,848 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 1177 transitions. Word has length 66 [2019-12-07 18:07:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:07:24,848 INFO L462 AbstractCegarLoop]: Abstraction has 551 states and 1177 transitions. [2019-12-07 18:07:24,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:07:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 1177 transitions. [2019-12-07 18:07:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:07:24,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:07:24,850 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 18:07:24,850 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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 18:07:24,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:07:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1220820073, now seen corresponding path program 2 times [2019-12-07 18:07:24,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:07:24,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076436167] [2019-12-07 18:07:24,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:07:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:07:24,949 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:07:24,949 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:07:24,952 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) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t349~0.base_32| 4)) (= |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) (= (select .cse0 |v_ULTIMATE.start_main_~#t349~0.base_32|) 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t349~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t349~0.base_32|) |v_ULTIMATE.start_main_~#t349~0.offset_23| 0)) |v_#memory_int_27|) (= 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) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t349~0.base_32|) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t349~0.base_32| 1)) (= 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_ULTIMATE.start_main_~#t349~0.offset_23|) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= 0 v_~z$flush_delayed~0_302) (= 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_#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_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ULTIMATE.start_main_~#t351~0.offset=|v_ULTIMATE.start_main_~#t351~0.offset_15|, ~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_~#t349~0.base=|v_ULTIMATE.start_main_~#t349~0.base_32|, ~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, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t350~0.base=|v_ULTIMATE.start_main_~#t350~0.base_25|, ULTIMATE.start_main_~#t351~0.base=|v_ULTIMATE.start_main_~#t351~0.base_18|, ~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, ~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, ULTIMATE.start_main_~#t350~0.offset=|v_ULTIMATE.start_main_~#t350~0.offset_16|, ~__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, ULTIMATE.start_main_~#t349~0.offset=|v_ULTIMATE.start_main_~#t349~0.offset_23|, ULTIMATE.start_main_~#t352~0.base=|v_ULTIMATE.start_main_~#t352~0.base_19|, #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, ULTIMATE.start_main_~#t352~0.offset=|v_ULTIMATE.start_main_~#t352~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t351~0.offset, ~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_~#t349~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t350~0.base, ULTIMATE.start_main_~#t351~0.base, ~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, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t350~0.offset, ~__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, ULTIMATE.start_main_~#t349~0.offset, ULTIMATE.start_main_~#t352~0.base, #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, ULTIMATE.start_main_~#t352~0.offset] because there is no mapped edge [2019-12-07 18:07:24,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (not (= |v_ULTIMATE.start_main_~#t350~0.base_12| 0)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t350~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t350~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t350~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t350~0.base_12|) |v_ULTIMATE.start_main_~#t350~0.offset_11| 1)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t350~0.base_12| 4) |v_#length_21|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t350~0.base_12|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t350~0.base_12|)) 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_#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_~#t350~0.base=|v_ULTIMATE.start_main_~#t350~0.base_12|, ULTIMATE.start_main_~#t350~0.offset=|v_ULTIMATE.start_main_~#t350~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t350~0.base, ULTIMATE.start_main_~#t350~0.offset] because there is no mapped edge [2019-12-07 18:07:24,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t351~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t351~0.base_9| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t351~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t351~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t351~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t351~0.base_9|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t351~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t351~0.base_9|) |v_ULTIMATE.start_main_~#t351~0.offset_8| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t351~0.base=|v_ULTIMATE.start_main_~#t351~0.base_9|, #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|, ULTIMATE.start_main_~#t351~0.offset=|v_ULTIMATE.start_main_~#t351~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t351~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t351~0.offset] because there is no mapped edge [2019-12-07 18:07:24,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t352~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t352~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t352~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t352~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t352~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t352~0.base_13|) |v_ULTIMATE.start_main_~#t352~0.offset_11| 3)) |v_#memory_int_19|) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t352~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t352~0.base_13| 4) |v_#length_23|)) 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_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t352~0.base=|v_ULTIMATE.start_main_~#t352~0.base_13|, ULTIMATE.start_main_~#t352~0.offset=|v_ULTIMATE.start_main_~#t352~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t352~0.base, ULTIMATE.start_main_~#t352~0.offset] because there is no mapped edge [2019-12-07 18:07:24,955 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 18:07:24,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In327161913 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In327161913 256) 0)) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out327161913| |P3Thread1of1ForFork3_#t~ite28_Out327161913|))) (or (and (= ~z$w_buff1~0_In327161913 |P3Thread1of1ForFork3_#t~ite28_Out327161913|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff0~0_In327161913 |P3Thread1of1ForFork3_#t~ite28_Out327161913|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In327161913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In327161913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In327161913, ~z$w_buff1~0=~z$w_buff1~0_In327161913} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out327161913|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out327161913|, ~z$w_buff0~0=~z$w_buff0~0_In327161913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In327161913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In327161913, ~z$w_buff1~0=~z$w_buff1~0_In327161913} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 18:07:24,959 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 18:07:24,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1580614253 256) 0))) (or (and (= ~z~0_In1580614253 |P3Thread1of1ForFork3_#t~ite48_Out1580614253|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1580614253 |P3Thread1of1ForFork3_#t~ite48_Out1580614253|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1580614253, ~z$flush_delayed~0=~z$flush_delayed~0_In1580614253, ~z~0=~z~0_In1580614253} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1580614253, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1580614253|, ~z$flush_delayed~0=~z$flush_delayed~0_In1580614253, ~z~0=~z~0_In1580614253} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 18:07:24,960 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 18:07:24,960 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 18:07:24,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1582210758 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite25_Out-1582210758| ~z~0_In-1582210758) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-1582210758 |P2Thread1of1ForFork2_#t~ite25_Out-1582210758|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1582210758, ~z$flush_delayed~0=~z$flush_delayed~0_In-1582210758, ~z~0=~z~0_In-1582210758} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1582210758, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-1582210758|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1582210758, ~z~0=~z~0_In-1582210758} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:07:24,967 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 18:07:24,967 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2080200521 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2080200521 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite51_Out-2080200521| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-2080200521 |P3Thread1of1ForFork3_#t~ite51_Out-2080200521|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2080200521, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2080200521} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-2080200521|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2080200521, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2080200521} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 18:07:24,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1141964374 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1141964374 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1141964374 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1141964374 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite52_Out1141964374|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1141964374 |P3Thread1of1ForFork3_#t~ite52_Out1141964374|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1141964374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1141964374, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1141964374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141964374} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out1141964374|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1141964374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1141964374, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1141964374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141964374} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 18:07:24,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1673996868 ~z$r_buff0_thd4~0_In-1673996868)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1673996868 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1673996868 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out-1673996868 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1673996868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1673996868} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-1673996868|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1673996868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1673996868} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:07:24,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2068317950 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In2068317950 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2068317950 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2068317950 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite54_Out2068317950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite54_Out2068317950| ~z$r_buff1_thd4~0_In2068317950) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2068317950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068317950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2068317950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068317950} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out2068317950|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2068317950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068317950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2068317950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068317950} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 18:07:24,969 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 18:07:24,969 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 18:07:24,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1431078090 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1431078090 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1431078090| ~z~0_In1431078090)) (and (not .cse1) (= ~z$w_buff1~0_In1431078090 |ULTIMATE.start_main_#t~ite59_Out1431078090|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1431078090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1431078090, ~z$w_buff1~0=~z$w_buff1~0_In1431078090, ~z~0=~z~0_In1431078090} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1431078090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1431078090, ~z$w_buff1~0=~z$w_buff1~0_In1431078090, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1431078090|, ~z~0=~z~0_In1431078090} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:07:24,969 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 18:07:24,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In946153759 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In946153759 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out946153759| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out946153759| ~z$w_buff0_used~0_In946153759) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946153759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946153759} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946153759, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out946153759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946153759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:07:24,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-135292897 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-135292897 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-135292897 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-135292897 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-135292897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-135292897| ~z$w_buff1_used~0_In-135292897) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-135292897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135292897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-135292897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135292897} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-135292897|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-135292897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135292897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-135292897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135292897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:07:24,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-202255241 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-202255241 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-202255241|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-202255241 |ULTIMATE.start_main_#t~ite63_Out-202255241|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202255241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202255241} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-202255241|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202255241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202255241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:07:24,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-871884909 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-871884909 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-871884909 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-871884909 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-871884909| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-871884909| ~z$r_buff1_thd0~0_In-871884909) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-871884909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-871884909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-871884909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871884909} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-871884909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-871884909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-871884909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871884909, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-871884909|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:07:24,971 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 18:07:25,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:07:25 BasicIcfg [2019-12-07 18:07:25,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:07:25,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:07:25,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:07:25,039 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:07:25,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:03:45" (3/4) ... [2019-12-07 18:07:25,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:07:25,041 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) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t349~0.base_32| 4)) (= |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) (= (select .cse0 |v_ULTIMATE.start_main_~#t349~0.base_32|) 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t349~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t349~0.base_32|) |v_ULTIMATE.start_main_~#t349~0.offset_23| 0)) |v_#memory_int_27|) (= 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) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t349~0.base_32|) (= 0 v_~__unbuffered_p1_EAX~0_76) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t349~0.base_32| 1)) (= 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_ULTIMATE.start_main_~#t349~0.offset_23|) (= 0 v_~__unbuffered_p3_EBX~0_68) (= v_~a~0_21 0) (= v_~y~0_64 0) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= 0 v_~z$flush_delayed~0_302) (= 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_#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_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ULTIMATE.start_main_~#t351~0.offset=|v_ULTIMATE.start_main_~#t351~0.offset_15|, ~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_~#t349~0.base=|v_ULTIMATE.start_main_~#t349~0.base_32|, ~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, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t350~0.base=|v_ULTIMATE.start_main_~#t350~0.base_25|, ULTIMATE.start_main_~#t351~0.base=|v_ULTIMATE.start_main_~#t351~0.base_18|, ~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, ~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, ULTIMATE.start_main_~#t350~0.offset=|v_ULTIMATE.start_main_~#t350~0.offset_16|, ~__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, ULTIMATE.start_main_~#t349~0.offset=|v_ULTIMATE.start_main_~#t349~0.offset_23|, ULTIMATE.start_main_~#t352~0.base=|v_ULTIMATE.start_main_~#t352~0.base_19|, #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, ULTIMATE.start_main_~#t352~0.offset=|v_ULTIMATE.start_main_~#t352~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t351~0.offset, ~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_~#t349~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t350~0.base, ULTIMATE.start_main_~#t351~0.base, ~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, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t350~0.offset, ~__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, ULTIMATE.start_main_~#t349~0.offset, ULTIMATE.start_main_~#t352~0.base, #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, ULTIMATE.start_main_~#t352~0.offset] because there is no mapped edge [2019-12-07 18:07:25,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (not (= |v_ULTIMATE.start_main_~#t350~0.base_12| 0)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t350~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t350~0.offset_11| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t350~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t350~0.base_12|) |v_ULTIMATE.start_main_~#t350~0.offset_11| 1)) |v_#memory_int_17|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t350~0.base_12| 4) |v_#length_21|) (= (select |v_#valid_44| |v_ULTIMATE.start_main_~#t350~0.base_12|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t350~0.base_12|)) 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_#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_~#t350~0.base=|v_ULTIMATE.start_main_~#t350~0.base_12|, ULTIMATE.start_main_~#t350~0.offset=|v_ULTIMATE.start_main_~#t350~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t350~0.base, ULTIMATE.start_main_~#t350~0.offset] because there is no mapped edge [2019-12-07 18:07:25,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t351~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t351~0.base_9| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t351~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t351~0.base_9|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t351~0.base_9| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t351~0.base_9|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t351~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t351~0.base_9|) |v_ULTIMATE.start_main_~#t351~0.offset_8| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t351~0.base=|v_ULTIMATE.start_main_~#t351~0.base_9|, #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|, ULTIMATE.start_main_~#t351~0.offset=|v_ULTIMATE.start_main_~#t351~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t351~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t351~0.offset] because there is no mapped edge [2019-12-07 18:07:25,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= (select |v_#valid_50| |v_ULTIMATE.start_main_~#t352~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t352~0.base_13| 0)) (= |v_ULTIMATE.start_main_~#t352~0.offset_11| 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t352~0.base_13|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t352~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t352~0.base_13|) |v_ULTIMATE.start_main_~#t352~0.offset_11| 3)) |v_#memory_int_19|) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t352~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t352~0.base_13| 4) |v_#length_23|)) 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_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t352~0.base=|v_ULTIMATE.start_main_~#t352~0.base_13|, ULTIMATE.start_main_~#t352~0.offset=|v_ULTIMATE.start_main_~#t352~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t352~0.base, ULTIMATE.start_main_~#t352~0.offset] because there is no mapped edge [2019-12-07 18:07:25,043 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 18:07:25,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In327161913 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In327161913 256) 0)) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out327161913| |P3Thread1of1ForFork3_#t~ite28_Out327161913|))) (or (and (= ~z$w_buff1~0_In327161913 |P3Thread1of1ForFork3_#t~ite28_Out327161913|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~z$w_buff0~0_In327161913 |P3Thread1of1ForFork3_#t~ite28_Out327161913|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In327161913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In327161913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In327161913, ~z$w_buff1~0=~z$w_buff1~0_In327161913} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out327161913|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out327161913|, ~z$w_buff0~0=~z$w_buff0~0_In327161913, ~z$w_buff0_used~0=~z$w_buff0_used~0_In327161913, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In327161913, ~z$w_buff1~0=~z$w_buff1~0_In327161913} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 18:07:25,047 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 18:07:25,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1580614253 256) 0))) (or (and (= ~z~0_In1580614253 |P3Thread1of1ForFork3_#t~ite48_Out1580614253|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In1580614253 |P3Thread1of1ForFork3_#t~ite48_Out1580614253|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1580614253, ~z$flush_delayed~0=~z$flush_delayed~0_In1580614253, ~z~0=~z~0_In1580614253} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1580614253, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1580614253|, ~z$flush_delayed~0=~z$flush_delayed~0_In1580614253, ~z~0=~z~0_In1580614253} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 18:07:25,049 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 18:07:25,049 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 18:07:25,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1582210758 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite25_Out-1582210758| ~z~0_In-1582210758) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-1582210758 |P2Thread1of1ForFork2_#t~ite25_Out-1582210758|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1582210758, ~z$flush_delayed~0=~z$flush_delayed~0_In-1582210758, ~z~0=~z~0_In-1582210758} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1582210758, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-1582210758|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1582210758, ~z~0=~z~0_In-1582210758} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 18:07:25,056 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 18:07:25,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2080200521 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2080200521 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite51_Out-2080200521| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-2080200521 |P3Thread1of1ForFork3_#t~ite51_Out-2080200521|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2080200521, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2080200521} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-2080200521|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2080200521, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2080200521} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 18:07:25,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In1141964374 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1141964374 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1141964374 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1141964374 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite52_Out1141964374|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1141964374 |P3Thread1of1ForFork3_#t~ite52_Out1141964374|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1141964374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1141964374, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1141964374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141964374} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out1141964374|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1141964374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1141964374, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1141964374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1141964374} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 18:07:25,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1673996868 ~z$r_buff0_thd4~0_In-1673996868)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1673996868 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1673996868 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out-1673996868 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1673996868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1673996868} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-1673996868|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1673996868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1673996868} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:07:25,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In2068317950 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In2068317950 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In2068317950 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In2068317950 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite54_Out2068317950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite54_Out2068317950| ~z$r_buff1_thd4~0_In2068317950) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2068317950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068317950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2068317950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068317950} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out2068317950|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2068317950, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2068317950, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2068317950, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2068317950} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 18:07:25,058 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 18:07:25,058 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 18:07:25,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In1431078090 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1431078090 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1431078090| ~z~0_In1431078090)) (and (not .cse1) (= ~z$w_buff1~0_In1431078090 |ULTIMATE.start_main_#t~ite59_Out1431078090|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1431078090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1431078090, ~z$w_buff1~0=~z$w_buff1~0_In1431078090, ~z~0=~z~0_In1431078090} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1431078090, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1431078090, ~z$w_buff1~0=~z$w_buff1~0_In1431078090, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1431078090|, ~z~0=~z~0_In1431078090} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:07:25,058 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 18:07:25,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In946153759 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In946153759 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out946153759| 0)) (and (= |ULTIMATE.start_main_#t~ite61_Out946153759| ~z$w_buff0_used~0_In946153759) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946153759, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946153759} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In946153759, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out946153759|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In946153759} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:07:25,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-135292897 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-135292897 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-135292897 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-135292897 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out-135292897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite62_Out-135292897| ~z$w_buff1_used~0_In-135292897) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-135292897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135292897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-135292897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135292897} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-135292897|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-135292897, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-135292897, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-135292897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-135292897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:07:25,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-202255241 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-202255241 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out-202255241|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-202255241 |ULTIMATE.start_main_#t~ite63_Out-202255241|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202255241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202255241} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-202255241|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202255241, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202255241} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:07:25,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-871884909 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-871884909 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-871884909 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-871884909 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-871884909| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-871884909| ~z$r_buff1_thd0~0_In-871884909) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-871884909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-871884909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-871884909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871884909} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-871884909, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-871884909, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-871884909, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-871884909, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-871884909|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:07:25,060 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 18:07:25,126 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6144ce60-0e73-4622-be83-6579d8f1568f/bin/uautomizer/witness.graphml [2019-12-07 18:07:25,126 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:07:25,128 INFO L168 Benchmark]: Toolchain (without parser) took 220251.11 ms. Allocated memory was 1.0 GB in the beginning and 8.0 GB in the end (delta: 6.9 GB). Free memory was 938.2 MB in the beginning and 3.7 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,128 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:07:25,128 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,128 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:07:25,129 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,129 INFO L168 Benchmark]: RCFGBuilder took 452.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,129 INFO L168 Benchmark]: TraceAbstraction took 219259.30 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,129 INFO L168 Benchmark]: Witness Printer took 87.81 ms. Allocated memory is still 8.0 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:25,131 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -136.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.20 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 27.09 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 452.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 219259.30 ms. Allocated memory was 1.1 GB in the beginning and 8.0 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 87.81 ms. Allocated memory is still 8.0 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.5s, 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.6s, 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(&t349, ((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(&t350, ((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(&t351, ((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(&t352, ((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: 219.0s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 63.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6351 SDtfs, 11733 SDslu, 16571 SDs, 0 SdLazy, 7441 SolverSat, 384 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287550occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 135.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1139042 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 256343 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...