./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_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_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/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 35b05b36a50b73fe2cd2de349b955b189bdd47c3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:50:05,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:50:05,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:50:05,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:50:05,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:50:05,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:50:05,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:50:05,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:50:05,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:50:05,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:50:05,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:50:05,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:50:05,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:50:05,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:50:05,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:50:05,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:50:05,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:50:05,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:50:05,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:50:05,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:50:05,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:50:05,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:50:05,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:50:05,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:50:05,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:50:05,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:50:05,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:50:05,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:50:05,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:50:05,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:50:05,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:50:05,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:50:05,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:50:05,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:50:05,039 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:50:05,039 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:50:05,039 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:50:05,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:50:05,040 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:50:05,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:50:05,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:50:05,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:50:05,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:50:05,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:50:05,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:50:05,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:50:05,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:50:05,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:50:05,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:50:05,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:50:05,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:50:05,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:50:05,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:50:05,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:50:05,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:50:05,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:50:05,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:50:05,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:50:05,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:50:05,055 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:50:05,055 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_46bebc7c-c033-4800-bc72-103433673872/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 -> 35b05b36a50b73fe2cd2de349b955b189bdd47c3 [2019-12-07 13:50:05,155 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:50:05,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:50:05,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:50:05,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:50:05,170 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:50:05,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i [2019-12-07 13:50:05,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/data/5dc254c9e/ce5c14c11fd941c78537e244e3e3f32b/FLAG99012e9b8 [2019-12-07 13:50:05,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:50:05,648 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/sv-benchmarks/c/pthread-wmm/mix037_tso.opt.i [2019-12-07 13:50:05,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/data/5dc254c9e/ce5c14c11fd941c78537e244e3e3f32b/FLAG99012e9b8 [2019-12-07 13:50:06,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/data/5dc254c9e/ce5c14c11fd941c78537e244e3e3f32b [2019-12-07 13:50:06,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:50:06,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:50:06,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:50:06,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:50:06,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:50:06,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296938c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06, skipping insertion in model container [2019-12-07 13:50:06,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:50:06,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:50:06,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:50:06,314 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:50:06,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:50:06,398 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:50:06,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06 WrapperNode [2019-12-07 13:50:06,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:50:06,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:50:06,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:50:06,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:50:06,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:50:06,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:50:06,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:50:06,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:50:06,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... [2019-12-07 13:50:06,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:50:06,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:50:06,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:50:06,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:50:06,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/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 13:50:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:50:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:50:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:50:06,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:50:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:50:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:50:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 13:50:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:50:06,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:50:06,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:50:06,503 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 13:50:06,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:50:06,831 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:50:06,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:50:06 BoogieIcfgContainer [2019-12-07 13:50:06,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:50:06,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:50:06,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:50:06,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:50:06,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:50:06" (1/3) ... [2019-12-07 13:50:06,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7295e22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:50:06, skipping insertion in model container [2019-12-07 13:50:06,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:50:06" (2/3) ... [2019-12-07 13:50:06,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7295e22a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:50:06, skipping insertion in model container [2019-12-07 13:50:06,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:50:06" (3/3) ... [2019-12-07 13:50:06,836 INFO L109 eAbstractionObserver]: Analyzing ICFG mix037_tso.opt.i [2019-12-07 13:50:06,843 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:50:06,843 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:50:06,847 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:50:06,848 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:50:06,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,871 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,884 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,885 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,886 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,887 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,888 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:50:06,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 13:50:06,912 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:50:06,912 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:50:06,912 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:50:06,912 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:50:06,913 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:50:06,913 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:50:06,913 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:50:06,913 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:50:06,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 192 transitions [2019-12-07 13:50:06,925 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:50:06,976 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:50:06,976 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:50:06,985 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:50:06,998 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 170 places, 192 transitions [2019-12-07 13:50:07,023 INFO L134 PetriNetUnfolder]: 35/188 cut-off events. [2019-12-07 13:50:07,024 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:50:07,027 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 188 events. 35/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 575 event pairs. 12/163 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-12-07 13:50:07,039 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-12-07 13:50:07,040 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:50:09,939 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 13:50:10,181 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 13:50:10,287 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44168 [2019-12-07 13:50:10,287 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 13:50:10,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 78 transitions [2019-12-07 13:50:11,283 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 21398 states. [2019-12-07 13:50:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states. [2019-12-07 13:50:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 13:50:11,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:11,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:11,292 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:11,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1244651740, now seen corresponding path program 1 times [2019-12-07 13:50:11,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:11,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373390826] [2019-12-07 13:50:11,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:11,458 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 13:50:11,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373390826] [2019-12-07 13:50:11,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:11,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:50:11,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882725674] [2019-12-07 13:50:11,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:11,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:11,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:11,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:11,474 INFO L87 Difference]: Start difference. First operand 21398 states. Second operand 3 states. [2019-12-07 13:50:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:11,751 INFO L93 Difference]: Finished difference Result 20958 states and 90416 transitions. [2019-12-07 13:50:11,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:11,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 13:50:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:11,896 INFO L225 Difference]: With dead ends: 20958 [2019-12-07 13:50:11,896 INFO L226 Difference]: Without dead ends: 19662 [2019-12-07 13:50:11,897 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 13:50:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-07 13:50:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 19662. [2019-12-07 13:50:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19662 states. [2019-12-07 13:50:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19662 states to 19662 states and 84692 transitions. [2019-12-07 13:50:12,649 INFO L78 Accepts]: Start accepts. Automaton has 19662 states and 84692 transitions. Word has length 9 [2019-12-07 13:50:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:12,650 INFO L462 AbstractCegarLoop]: Abstraction has 19662 states and 84692 transitions. [2019-12-07 13:50:12,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 19662 states and 84692 transitions. [2019-12-07 13:50:12,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:50:12,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:12,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:50:12,655 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:12,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:12,656 INFO L82 PathProgramCache]: Analyzing trace with hash -6792795, now seen corresponding path program 1 times [2019-12-07 13:50:12,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:12,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960441930] [2019-12-07 13:50:12,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:12,715 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 13:50:12,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960441930] [2019-12-07 13:50:12,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:12,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:12,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545452275] [2019-12-07 13:50:12,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:12,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:12,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:12,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:12,718 INFO L87 Difference]: Start difference. First operand 19662 states and 84692 transitions. Second operand 4 states. [2019-12-07 13:50:13,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:13,078 INFO L93 Difference]: Finished difference Result 30494 states and 126452 transitions. [2019-12-07 13:50:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:50:13,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 13:50:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:13,256 INFO L225 Difference]: With dead ends: 30494 [2019-12-07 13:50:13,256 INFO L226 Difference]: Without dead ends: 30438 [2019-12-07 13:50:13,256 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 13:50:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30438 states. [2019-12-07 13:50:13,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30438 to 27742. [2019-12-07 13:50:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27742 states. [2019-12-07 13:50:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27742 states to 27742 states and 116300 transitions. [2019-12-07 13:50:13,892 INFO L78 Accepts]: Start accepts. Automaton has 27742 states and 116300 transitions. Word has length 15 [2019-12-07 13:50:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:13,892 INFO L462 AbstractCegarLoop]: Abstraction has 27742 states and 116300 transitions. [2019-12-07 13:50:13,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 27742 states and 116300 transitions. [2019-12-07 13:50:13,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:50:13,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:13,898 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 13:50:13,898 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:13,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:13,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1479332799, now seen corresponding path program 1 times [2019-12-07 13:50:13,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:13,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145157009] [2019-12-07 13:50:13,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:13,955 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 13:50:13,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145157009] [2019-12-07 13:50:13,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:13,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:13,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325648626] [2019-12-07 13:50:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:13,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:13,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:13,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:13,956 INFO L87 Difference]: Start difference. First operand 27742 states and 116300 transitions. Second operand 4 states. [2019-12-07 13:50:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:14,288 INFO L93 Difference]: Finished difference Result 35230 states and 146308 transitions. [2019-12-07 13:50:14,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:50:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:50:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:14,361 INFO L225 Difference]: With dead ends: 35230 [2019-12-07 13:50:14,361 INFO L226 Difference]: Without dead ends: 35182 [2019-12-07 13:50:14,361 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 13:50:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35182 states. [2019-12-07 13:50:15,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35182 to 30378. [2019-12-07 13:50:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30378 states. [2019-12-07 13:50:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30378 states to 30378 states and 127172 transitions. [2019-12-07 13:50:15,089 INFO L78 Accepts]: Start accepts. Automaton has 30378 states and 127172 transitions. Word has length 18 [2019-12-07 13:50:15,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:15,090 INFO L462 AbstractCegarLoop]: Abstraction has 30378 states and 127172 transitions. [2019-12-07 13:50:15,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 30378 states and 127172 transitions. [2019-12-07 13:50:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:50:15,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:15,099 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 13:50:15,100 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash -45820751, now seen corresponding path program 1 times [2019-12-07 13:50:15,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:15,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164116679] [2019-12-07 13:50:15,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:15,159 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 13:50:15,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164116679] [2019-12-07 13:50:15,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:15,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:15,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828594458] [2019-12-07 13:50:15,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:15,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:15,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:15,161 INFO L87 Difference]: Start difference. First operand 30378 states and 127172 transitions. Second operand 3 states. [2019-12-07 13:50:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:15,280 INFO L93 Difference]: Finished difference Result 30378 states and 125828 transitions. [2019-12-07 13:50:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:15,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 13:50:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:15,342 INFO L225 Difference]: With dead ends: 30378 [2019-12-07 13:50:15,342 INFO L226 Difference]: Without dead ends: 30378 [2019-12-07 13:50:15,343 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 13:50:15,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30378 states. [2019-12-07 13:50:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30378 to 29978. [2019-12-07 13:50:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29978 states. [2019-12-07 13:50:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29978 states to 29978 states and 124268 transitions. [2019-12-07 13:50:16,039 INFO L78 Accepts]: Start accepts. Automaton has 29978 states and 124268 transitions. Word has length 20 [2019-12-07 13:50:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 29978 states and 124268 transitions. [2019-12-07 13:50:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 29978 states and 124268 transitions. [2019-12-07 13:50:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 13:50:16,045 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:16,045 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 13:50:16,045 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:16,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:16,045 INFO L82 PathProgramCache]: Analyzing trace with hash -405590648, now seen corresponding path program 1 times [2019-12-07 13:50:16,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:16,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145669288] [2019-12-07 13:50:16,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:16,096 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 13:50:16,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145669288] [2019-12-07 13:50:16,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:16,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:16,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713854642] [2019-12-07 13:50:16,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:16,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:16,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:16,098 INFO L87 Difference]: Start difference. First operand 29978 states and 124268 transitions. Second operand 4 states. [2019-12-07 13:50:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:16,224 INFO L93 Difference]: Finished difference Result 25451 states and 97159 transitions. [2019-12-07 13:50:16,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:50:16,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 13:50:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:16,266 INFO L225 Difference]: With dead ends: 25451 [2019-12-07 13:50:16,266 INFO L226 Difference]: Without dead ends: 23699 [2019-12-07 13:50:16,267 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 13:50:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23699 states. [2019-12-07 13:50:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23699 to 23699. [2019-12-07 13:50:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23699 states. [2019-12-07 13:50:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23699 states to 23699 states and 91015 transitions. [2019-12-07 13:50:16,662 INFO L78 Accepts]: Start accepts. Automaton has 23699 states and 91015 transitions. Word has length 20 [2019-12-07 13:50:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:16,662 INFO L462 AbstractCegarLoop]: Abstraction has 23699 states and 91015 transitions. [2019-12-07 13:50:16,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23699 states and 91015 transitions. [2019-12-07 13:50:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 13:50:16,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:16,666 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 13:50:16,666 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:16,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -488858070, now seen corresponding path program 1 times [2019-12-07 13:50:16,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:16,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344348063] [2019-12-07 13:50:16,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:16,738 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 13:50:16,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344348063] [2019-12-07 13:50:16,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:16,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:50:16,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453969103] [2019-12-07 13:50:16,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:16,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:16,740 INFO L87 Difference]: Start difference. First operand 23699 states and 91015 transitions. Second operand 4 states. [2019-12-07 13:50:16,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:16,943 INFO L93 Difference]: Finished difference Result 34231 states and 128294 transitions. [2019-12-07 13:50:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:50:16,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 13:50:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:17,000 INFO L225 Difference]: With dead ends: 34231 [2019-12-07 13:50:17,000 INFO L226 Difference]: Without dead ends: 33647 [2019-12-07 13:50:17,000 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 13:50:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33647 states. [2019-12-07 13:50:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33647 to 33067. [2019-12-07 13:50:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-12-07 13:50:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 124717 transitions. [2019-12-07 13:50:17,546 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 124717 transitions. Word has length 21 [2019-12-07 13:50:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:17,546 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 124717 transitions. [2019-12-07 13:50:17,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 124717 transitions. [2019-12-07 13:50:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 13:50:17,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:17,555 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] [2019-12-07 13:50:17,555 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1033614589, now seen corresponding path program 1 times [2019-12-07 13:50:17,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:17,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617601290] [2019-12-07 13:50:17,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:17,604 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 13:50:17,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617601290] [2019-12-07 13:50:17,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:17,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:17,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313196477] [2019-12-07 13:50:17,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:17,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:17,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:17,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:17,606 INFO L87 Difference]: Start difference. First operand 33067 states and 124717 transitions. Second operand 5 states. [2019-12-07 13:50:17,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:17,684 INFO L93 Difference]: Finished difference Result 17355 states and 56700 transitions. [2019-12-07 13:50:17,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:50:17,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 13:50:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:17,704 INFO L225 Difference]: With dead ends: 17355 [2019-12-07 13:50:17,704 INFO L226 Difference]: Without dead ends: 15269 [2019-12-07 13:50:17,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:17,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15269 states. [2019-12-07 13:50:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15269 to 15269. [2019-12-07 13:50:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15269 states. [2019-12-07 13:50:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15269 states to 15269 states and 49483 transitions. [2019-12-07 13:50:17,910 INFO L78 Accepts]: Start accepts. Automaton has 15269 states and 49483 transitions. Word has length 23 [2019-12-07 13:50:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:17,911 INFO L462 AbstractCegarLoop]: Abstraction has 15269 states and 49483 transitions. [2019-12-07 13:50:17,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15269 states and 49483 transitions. [2019-12-07 13:50:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 13:50:17,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:17,916 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 13:50:17,916 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1862087193, now seen corresponding path program 1 times [2019-12-07 13:50:17,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:17,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416397673] [2019-12-07 13:50:17,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:17,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416397673] [2019-12-07 13:50:17,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:17,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:50:17,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306013840] [2019-12-07 13:50:17,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:17,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:17,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:17,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:17,964 INFO L87 Difference]: Start difference. First operand 15269 states and 49483 transitions. Second operand 6 states. [2019-12-07 13:50:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:18,025 INFO L93 Difference]: Finished difference Result 4715 states and 14026 transitions. [2019-12-07 13:50:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:50:18,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 13:50:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:18,029 INFO L225 Difference]: With dead ends: 4715 [2019-12-07 13:50:18,030 INFO L226 Difference]: Without dead ends: 3764 [2019-12-07 13:50:18,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:50:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2019-12-07 13:50:18,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3433. [2019-12-07 13:50:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3433 states. [2019-12-07 13:50:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3433 states to 3433 states and 9867 transitions. [2019-12-07 13:50:18,065 INFO L78 Accepts]: Start accepts. Automaton has 3433 states and 9867 transitions. Word has length 24 [2019-12-07 13:50:18,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:18,066 INFO L462 AbstractCegarLoop]: Abstraction has 3433 states and 9867 transitions. [2019-12-07 13:50:18,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3433 states and 9867 transitions. [2019-12-07 13:50:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:50:18,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:18,069 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] [2019-12-07 13:50:18,069 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1619810495, now seen corresponding path program 1 times [2019-12-07 13:50:18,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:18,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872375850] [2019-12-07 13:50:18,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:18,096 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 13:50:18,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872375850] [2019-12-07 13:50:18,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:18,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:18,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968456239] [2019-12-07 13:50:18,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:50:18,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:18,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:50:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:18,098 INFO L87 Difference]: Start difference. First operand 3433 states and 9867 transitions. Second operand 3 states. [2019-12-07 13:50:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:18,131 INFO L93 Difference]: Finished difference Result 5138 states and 14718 transitions. [2019-12-07 13:50:18,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:50:18,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:50:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:18,136 INFO L225 Difference]: With dead ends: 5138 [2019-12-07 13:50:18,136 INFO L226 Difference]: Without dead ends: 5138 [2019-12-07 13:50:18,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:50:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5138 states. [2019-12-07 13:50:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5138 to 4101. [2019-12-07 13:50:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4101 states. [2019-12-07 13:50:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 11922 transitions. [2019-12-07 13:50:18,179 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 11922 transitions. Word has length 32 [2019-12-07 13:50:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:18,179 INFO L462 AbstractCegarLoop]: Abstraction has 4101 states and 11922 transitions. [2019-12-07 13:50:18,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:50:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 11922 transitions. [2019-12-07 13:50:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:50:18,183 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:18,183 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] [2019-12-07 13:50:18,183 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1082300219, now seen corresponding path program 1 times [2019-12-07 13:50:18,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:18,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382821091] [2019-12-07 13:50:18,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:18,243 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 13:50:18,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382821091] [2019-12-07 13:50:18,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:18,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:18,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681939613] [2019-12-07 13:50:18,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:18,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:18,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:18,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:18,244 INFO L87 Difference]: Start difference. First operand 4101 states and 11922 transitions. Second operand 6 states. [2019-12-07 13:50:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:18,526 INFO L93 Difference]: Finished difference Result 8453 states and 23415 transitions. [2019-12-07 13:50:18,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:50:18,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 13:50:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:18,534 INFO L225 Difference]: With dead ends: 8453 [2019-12-07 13:50:18,534 INFO L226 Difference]: Without dead ends: 8449 [2019-12-07 13:50:18,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:18,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8449 states. [2019-12-07 13:50:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8449 to 4400. [2019-12-07 13:50:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2019-12-07 13:50:18,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 12742 transitions. [2019-12-07 13:50:18,589 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 12742 transitions. Word has length 32 [2019-12-07 13:50:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:18,590 INFO L462 AbstractCegarLoop]: Abstraction has 4400 states and 12742 transitions. [2019-12-07 13:50:18,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 12742 transitions. [2019-12-07 13:50:18,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:50:18,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:18,594 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] [2019-12-07 13:50:18,594 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -345264620, now seen corresponding path program 1 times [2019-12-07 13:50:18,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:18,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372562243] [2019-12-07 13:50:18,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:18,650 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 13:50:18,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372562243] [2019-12-07 13:50:18,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:18,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:18,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736004563] [2019-12-07 13:50:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:18,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:18,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:18,652 INFO L87 Difference]: Start difference. First operand 4400 states and 12742 transitions. Second operand 6 states. [2019-12-07 13:50:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:18,949 INFO L93 Difference]: Finished difference Result 8182 states and 22535 transitions. [2019-12-07 13:50:18,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:50:18,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 13:50:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:18,957 INFO L225 Difference]: With dead ends: 8182 [2019-12-07 13:50:18,957 INFO L226 Difference]: Without dead ends: 8180 [2019-12-07 13:50:18,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:18,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2019-12-07 13:50:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 4268. [2019-12-07 13:50:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-12-07 13:50:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 12416 transitions. [2019-12-07 13:50:19,016 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 12416 transitions. Word has length 33 [2019-12-07 13:50:19,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,016 INFO L462 AbstractCegarLoop]: Abstraction has 4268 states and 12416 transitions. [2019-12-07 13:50:19,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:19,016 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 12416 transitions. [2019-12-07 13:50:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:50:19,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,020 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] [2019-12-07 13:50:19,020 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 452387979, now seen corresponding path program 1 times [2019-12-07 13:50:19,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275044843] [2019-12-07 13:50:19,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:50:19,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275044843] [2019-12-07 13:50:19,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:19,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:19,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907075581] [2019-12-07 13:50:19,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:19,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:19,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:19,083 INFO L87 Difference]: Start difference. First operand 4268 states and 12416 transitions. Second operand 4 states. [2019-12-07 13:50:19,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,120 INFO L93 Difference]: Finished difference Result 5753 states and 15997 transitions. [2019-12-07 13:50:19,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:50:19,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 13:50:19,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,126 INFO L225 Difference]: With dead ends: 5753 [2019-12-07 13:50:19,126 INFO L226 Difference]: Without dead ends: 5241 [2019-12-07 13:50:19,126 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 13:50:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5241 states. [2019-12-07 13:50:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5241 to 4178. [2019-12-07 13:50:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4178 states. [2019-12-07 13:50:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4178 states to 4178 states and 12153 transitions. [2019-12-07 13:50:19,171 INFO L78 Accepts]: Start accepts. Automaton has 4178 states and 12153 transitions. Word has length 33 [2019-12-07 13:50:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,171 INFO L462 AbstractCegarLoop]: Abstraction has 4178 states and 12153 transitions. [2019-12-07 13:50:19,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4178 states and 12153 transitions. [2019-12-07 13:50:19,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:50:19,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,175 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] [2019-12-07 13:50:19,175 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1138990633, now seen corresponding path program 2 times [2019-12-07 13:50:19,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277687373] [2019-12-07 13:50:19,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,227 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 13:50:19,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277687373] [2019-12-07 13:50:19,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:19,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:50:19,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646638159] [2019-12-07 13:50:19,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:50:19,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:50:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:19,228 INFO L87 Difference]: Start difference. First operand 4178 states and 12153 transitions. Second operand 7 states. [2019-12-07 13:50:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,296 INFO L93 Difference]: Finished difference Result 3024 states and 9347 transitions. [2019-12-07 13:50:19,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:50:19,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 13:50:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,299 INFO L225 Difference]: With dead ends: 3024 [2019-12-07 13:50:19,299 INFO L226 Difference]: Without dead ends: 2842 [2019-12-07 13:50:19,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2019-12-07 13:50:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2282. [2019-12-07 13:50:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2282 states. [2019-12-07 13:50:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2282 states to 2282 states and 7425 transitions. [2019-12-07 13:50:19,326 INFO L78 Accepts]: Start accepts. Automaton has 2282 states and 7425 transitions. Word has length 33 [2019-12-07 13:50:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,326 INFO L462 AbstractCegarLoop]: Abstraction has 2282 states and 7425 transitions. [2019-12-07 13:50:19,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:50:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2282 states and 7425 transitions. [2019-12-07 13:50:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:19,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,329 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] [2019-12-07 13:50:19,330 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,330 INFO L82 PathProgramCache]: Analyzing trace with hash -754041251, now seen corresponding path program 1 times [2019-12-07 13:50:19,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089231699] [2019-12-07 13:50:19,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,394 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 13:50:19,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089231699] [2019-12-07 13:50:19,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:19,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:50:19,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899774909] [2019-12-07 13:50:19,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:19,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:19,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:19,395 INFO L87 Difference]: Start difference. First operand 2282 states and 7425 transitions. Second operand 6 states. [2019-12-07 13:50:19,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,621 INFO L93 Difference]: Finished difference Result 9094 states and 28060 transitions. [2019-12-07 13:50:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:50:19,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:50:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,630 INFO L225 Difference]: With dead ends: 9094 [2019-12-07 13:50:19,630 INFO L226 Difference]: Without dead ends: 7582 [2019-12-07 13:50:19,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:50:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7582 states. [2019-12-07 13:50:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7582 to 3154. [2019-12-07 13:50:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3154 states. [2019-12-07 13:50:19,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3154 states to 3154 states and 10069 transitions. [2019-12-07 13:50:19,684 INFO L78 Accepts]: Start accepts. Automaton has 3154 states and 10069 transitions. Word has length 48 [2019-12-07 13:50:19,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,685 INFO L462 AbstractCegarLoop]: Abstraction has 3154 states and 10069 transitions. [2019-12-07 13:50:19,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3154 states and 10069 transitions. [2019-12-07 13:50:19,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:19,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,689 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] [2019-12-07 13:50:19,689 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,689 INFO L82 PathProgramCache]: Analyzing trace with hash -231356835, now seen corresponding path program 2 times [2019-12-07 13:50:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871717569] [2019-12-07 13:50:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,750 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 13:50:19,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871717569] [2019-12-07 13:50:19,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594464299] [2019-12-07 13:50:19,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:19,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:19,752 INFO L87 Difference]: Start difference. First operand 3154 states and 10069 transitions. Second operand 5 states. [2019-12-07 13:50:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,791 INFO L93 Difference]: Finished difference Result 5175 states and 15333 transitions. [2019-12-07 13:50:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:50:19,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:50:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,795 INFO L225 Difference]: With dead ends: 5175 [2019-12-07 13:50:19,795 INFO L226 Difference]: Without dead ends: 3428 [2019-12-07 13:50:19,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2019-12-07 13:50:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2898. [2019-12-07 13:50:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-12-07 13:50:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9136 transitions. [2019-12-07 13:50:19,827 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9136 transitions. Word has length 48 [2019-12-07 13:50:19,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,827 INFO L462 AbstractCegarLoop]: Abstraction has 2898 states and 9136 transitions. [2019-12-07 13:50:19,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:19,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9136 transitions. [2019-12-07 13:50:19,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:19,830 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,830 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] [2019-12-07 13:50:19,831 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1878148035, now seen corresponding path program 3 times [2019-12-07 13:50:19,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451315629] [2019-12-07 13:50:19,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,898 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 13:50:19,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451315629] [2019-12-07 13:50:19,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:19,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:50:19,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56159185] [2019-12-07 13:50:19,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:50:19,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:19,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:50:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:50:19,899 INFO L87 Difference]: Start difference. First operand 2898 states and 9136 transitions. Second operand 4 states. [2019-12-07 13:50:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:19,921 INFO L93 Difference]: Finished difference Result 3450 states and 10403 transitions. [2019-12-07 13:50:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:50:19,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 13:50:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:19,924 INFO L225 Difference]: With dead ends: 3450 [2019-12-07 13:50:19,924 INFO L226 Difference]: Without dead ends: 2299 [2019-12-07 13:50:19,924 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 13:50:19,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2019-12-07 13:50:19,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2019-12-07 13:50:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2299 states. [2019-12-07 13:50:19,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 6689 transitions. [2019-12-07 13:50:19,946 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 6689 transitions. Word has length 48 [2019-12-07 13:50:19,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:19,946 INFO L462 AbstractCegarLoop]: Abstraction has 2299 states and 6689 transitions. [2019-12-07 13:50:19,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:50:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 6689 transitions. [2019-12-07 13:50:19,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:19,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:19,949 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] [2019-12-07 13:50:19,949 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:19,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:19,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1908529501, now seen corresponding path program 4 times [2019-12-07 13:50:19,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:19,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258557597] [2019-12-07 13:50:19,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:19,999 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 13:50:20,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258557597] [2019-12-07 13:50:20,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:20,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:50:20,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098204696] [2019-12-07 13:50:20,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:50:20,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:20,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:50:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:50:20,001 INFO L87 Difference]: Start difference. First operand 2299 states and 6689 transitions. Second operand 6 states. [2019-12-07 13:50:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:20,109 INFO L93 Difference]: Finished difference Result 4234 states and 12004 transitions. [2019-12-07 13:50:20,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:50:20,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 13:50:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:20,112 INFO L225 Difference]: With dead ends: 4234 [2019-12-07 13:50:20,112 INFO L226 Difference]: Without dead ends: 3062 [2019-12-07 13:50:20,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:50:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2019-12-07 13:50:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 1755. [2019-12-07 13:50:20,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2019-12-07 13:50:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 5105 transitions. [2019-12-07 13:50:20,133 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 5105 transitions. Word has length 48 [2019-12-07 13:50:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:20,133 INFO L462 AbstractCegarLoop]: Abstraction has 1755 states and 5105 transitions. [2019-12-07 13:50:20,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:50:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 5105 transitions. [2019-12-07 13:50:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:20,135 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:20,135 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] [2019-12-07 13:50:20,136 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1923718495, now seen corresponding path program 5 times [2019-12-07 13:50:20,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:20,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77774995] [2019-12-07 13:50:20,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:20,351 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 13:50:20,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77774995] [2019-12-07 13:50:20,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:20,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:50:20,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069769743] [2019-12-07 13:50:20,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:50:20,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:50:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:50:20,352 INFO L87 Difference]: Start difference. First operand 1755 states and 5105 transitions. Second operand 12 states. [2019-12-07 13:50:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:21,499 INFO L93 Difference]: Finished difference Result 3685 states and 10444 transitions. [2019-12-07 13:50:21,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 13:50:21,499 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2019-12-07 13:50:21,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:21,502 INFO L225 Difference]: With dead ends: 3685 [2019-12-07 13:50:21,502 INFO L226 Difference]: Without dead ends: 3616 [2019-12-07 13:50:21,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:50:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3616 states. [2019-12-07 13:50:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3616 to 1786. [2019-12-07 13:50:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-12-07 13:50:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 5206 transitions. [2019-12-07 13:50:21,525 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 5206 transitions. Word has length 48 [2019-12-07 13:50:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:21,525 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 5206 transitions. [2019-12-07 13:50:21,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:50:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 5206 transitions. [2019-12-07 13:50:21,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:21,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:21,528 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] [2019-12-07 13:50:21,528 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:21,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:21,528 INFO L82 PathProgramCache]: Analyzing trace with hash -507128511, now seen corresponding path program 6 times [2019-12-07 13:50:21,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005520722] [2019-12-07 13:50:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:21,584 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 13:50:21,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005520722] [2019-12-07 13:50:21,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:21,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:50:21,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676627522] [2019-12-07 13:50:21,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:50:21,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:21,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:50:21,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:50:21,585 INFO L87 Difference]: Start difference. First operand 1786 states and 5206 transitions. Second operand 5 states. [2019-12-07 13:50:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:21,620 INFO L93 Difference]: Finished difference Result 2290 states and 6376 transitions. [2019-12-07 13:50:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:50:21,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 13:50:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:21,621 INFO L225 Difference]: With dead ends: 2290 [2019-12-07 13:50:21,621 INFO L226 Difference]: Without dead ends: 504 [2019-12-07 13:50:21,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:21,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-07 13:50:21,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2019-12-07 13:50:21,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 13:50:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1111 transitions. [2019-12-07 13:50:21,626 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1111 transitions. Word has length 48 [2019-12-07 13:50:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:21,626 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 1111 transitions. [2019-12-07 13:50:21,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:50:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1111 transitions. [2019-12-07 13:50:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:21,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:21,627 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] [2019-12-07 13:50:21,627 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -126758993, now seen corresponding path program 7 times [2019-12-07 13:50:21,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:21,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269883066] [2019-12-07 13:50:21,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:50:21,692 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 13:50:21,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269883066] [2019-12-07 13:50:21,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:50:21,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:50:21,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580115873] [2019-12-07 13:50:21,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:50:21,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:50:21,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:50:21,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:50:21,693 INFO L87 Difference]: Start difference. First operand 504 states and 1111 transitions. Second operand 7 states. [2019-12-07 13:50:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:50:21,864 INFO L93 Difference]: Finished difference Result 892 states and 1938 transitions. [2019-12-07 13:50:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:50:21,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 13:50:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:50:21,865 INFO L225 Difference]: With dead ends: 892 [2019-12-07 13:50:21,865 INFO L226 Difference]: Without dead ends: 594 [2019-12-07 13:50:21,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:50:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-12-07 13:50:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 536. [2019-12-07 13:50:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2019-12-07 13:50:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1171 transitions. [2019-12-07 13:50:21,870 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 1171 transitions. Word has length 48 [2019-12-07 13:50:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:50:21,871 INFO L462 AbstractCegarLoop]: Abstraction has 536 states and 1171 transitions. [2019-12-07 13:50:21,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:50:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 1171 transitions. [2019-12-07 13:50:21,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 13:50:21,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:50:21,872 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] [2019-12-07 13:50:21,872 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:50:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:50:21,872 INFO L82 PathProgramCache]: Analyzing trace with hash 24927743, now seen corresponding path program 8 times [2019-12-07 13:50:21,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:50:21,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878814022] [2019-12-07 13:50:21,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:50:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:50:21,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:50:21,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:50:21,955 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:50:21,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_59|) (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59|) |v_ULTIMATE.start_main_~#t997~0.offset_37| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59|) 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t997~0.base_59| 4) |v_#length_31|) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_37|) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59| 1)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_37|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_22|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~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_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_59|, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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_132, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_32|, ~y~0=v_~y~0_19, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_35|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_23|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-07 13:50:21,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-07 13:50:21,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-07 13:50:21,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-07 13:50:21,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-582343323 ~__unbuffered_p3_EAX~0_Out-582343323) (= ~a~0_Out-582343323 1) (= ~__unbuffered_p3_EBX~0_Out-582343323 ~b~0_In-582343323) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323)) (= ~z$r_buff0_thd4~0_Out-582343323 1) (= ~z$r_buff0_thd0~0_In-582343323 ~z$r_buff1_thd0~0_Out-582343323) (= ~z$r_buff0_thd4~0_In-582343323 ~z$r_buff1_thd4~0_Out-582343323) (= ~z$r_buff1_thd2~0_Out-582343323 ~z$r_buff0_thd2~0_In-582343323) (= ~z$r_buff1_thd1~0_Out-582343323 ~z$r_buff0_thd1~0_In-582343323) (= ~z$r_buff1_thd3~0_Out-582343323 ~z$r_buff0_thd3~0_In-582343323)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-582343323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-582343323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-582343323, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-582343323, ~a~0=~a~0_Out-582343323, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-582343323, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-582343323, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} AuxVars[] AssignedVars[~a~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, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:50:21,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:50:21,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:50:21,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In733469695 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite8_In733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In733469695 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In733469695 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In733469695 256))) (= (mod ~z$w_buff0_used~0_In733469695 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In733469695|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out733469695|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out733469695|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:50:21,965 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2140763264 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2140763264 256)))) (or (= (mod ~z$w_buff0_used~0_In-2140763264 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2140763264 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-2140763264 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite12_Out-2140763264|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-2140763264|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:50:21,966 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1701741168 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1701741168 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1701741168 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1701741168 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1701741168 256))))) .cse1 (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite14_In-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite15_Out-1701741168|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1701741168|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:50:21,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:50:21,968 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489179615 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-489179615 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-489179615 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-489179615 256))) (= (mod ~z$w_buff0_used~0_In-489179615 256) 0))) (= ~z$r_buff1_thd3~0_In-489179615 |P2Thread1of1ForFork1_#t~ite23_Out-489179615|) (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| ~z$r_buff1_thd3~0_In-489179615) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-489179615|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:50:21,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:50:21,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1574994956 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1574994956 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1574994956 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1574994956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:50:21,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1210292619 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1210292619 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1210292619 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1210292619|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:50:21,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In101925086 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In101925086 ~z$r_buff0_thd4~0_Out101925086)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In101925086 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out101925086) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In101925086} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out101925086, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out101925086|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:50:21,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:50:21,971 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:50:21,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:50:21,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-60958231 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-60958231 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-60958231| |ULTIMATE.start_main_#t~ite36_Out-60958231|))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z$w_buff1~0_In-60958231) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z~0_In-60958231) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ~z~0=~z~0_In-60958231} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-60958231|, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-60958231|, ~z~0=~z~0_In-60958231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:50:21,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In908169825 |ULTIMATE.start_main_#t~ite38_Out908169825|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out908169825| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out908169825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:50:21,973 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In203778712 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In203778712 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In203778712 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In203778712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| ~z$w_buff1_used~0_In203778712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out203778712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:50:21,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1762638813 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1762638813 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| ~z$r_buff0_thd0~0_In1762638813) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1762638813|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:50:21,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256)))) (or (and (= ~z$r_buff1_thd0~0_In2096769610 |ULTIMATE.start_main_#t~ite41_Out2096769610|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out2096769610| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2096769610|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:50:21,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:50:22,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:50:22 BasicIcfg [2019-12-07 13:50:22,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:50:22,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:50:22,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:50:22,034 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:50:22,034 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:50:06" (3/4) ... [2019-12-07 13:50:22,036 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:50:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_107| 0 0))) (and (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t997~0.base_59|) (= v_~x~0_71 0) (= 0 v_~weak$$choice0~0_10) (= v_~z$w_buff0_used~0_514 0) (= 0 v_~z$r_buff1_thd3~0_207) (= v_~main$tmp_guard0~0_30 0) (= v_~main$tmp_guard1~0_44 0) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t997~0.base_59|) |v_ULTIMATE.start_main_~#t997~0.offset_37| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~a~0_59 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59|) 0) (= 0 v_~z$flush_delayed~0_37) (= v_~z$mem_tmp~0_16 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~z$r_buff0_thd0~0_119 0) (= 0 v_~z$r_buff1_thd4~0_110) (= v_~y~0_19 0) (= v_~z$w_buff0~0_183 0) (= 0 v_~z$r_buff1_thd1~0_59) (= 0 v_~z$r_buff0_thd4~0_166) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_87) (= 0 v_~z$r_buff1_thd2~0_58) (= v_~z$r_buff0_thd1~0_58 0) (= v_~z$r_buff0_thd2~0_57 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd0~0_132 0) (= |v_#NULL.offset_5| 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t997~0.base_59| 4) |v_#length_31|) (= 0 |v_ULTIMATE.start_main_~#t997~0.offset_37|) (= v_~z~0_116 0) (= 0 v_~__unbuffered_p2_EAX~0_54) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~z$r_buff0_thd3~0_266) (= 0 v_~__unbuffered_p3_EBX~0_88) (= 0 v_~weak$$choice2~0_95) (= v_~z$w_buff1_used~0_298 0) (= |v_#valid_105| (store .cse0 |v_ULTIMATE.start_main_~#t997~0.base_59| 1)) (= 0 |v_#NULL.base_5|) (= v_~z$w_buff1~0_123 0) (= v_~b~0_79 0) (= v_~__unbuffered_cnt~0_126 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_107|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_58, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t997~0.offset=|v_ULTIMATE.start_main_~#t997~0.offset_37|, ~a~0=v_~a~0_59, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_119, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_32|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_166, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_87, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_22|, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_54, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_81|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_298, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_72|, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_59, ~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_266, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, ~x~0=v_~x~0_71, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_110, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_10|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t997~0.base=|v_ULTIMATE.start_main_~#t997~0.base_59|, ~z$w_buff1~0=v_~z$w_buff1~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~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_132, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_32|, ~y~0=v_~y~0_19, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_35|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_514, ~z$w_buff0~0=v_~z$w_buff0~0_183, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_207, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_45|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_141|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_88, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_23|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_91|, ~b~0=v_~b~0_79, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_38|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_116, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_58, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_56|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t997~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t999~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t1000~0.offset, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ULTIMATE.start_main_~#t997~0.base, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1000~0.base, ~y~0, ULTIMATE.start_main_~#t998~0.offset, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t999~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t998~0.base] because there is no mapped edge [2019-12-07 13:50:22,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t998~0.base_11|) |v_ULTIMATE.start_main_~#t998~0.offset_10| 1)) |v_#memory_int_19|) (not (= 0 |v_ULTIMATE.start_main_~#t998~0.base_11|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t998~0.base_11| 4) |v_#length_23|) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t998~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t998~0.offset_10| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t998~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t998~0.base=|v_ULTIMATE.start_main_~#t998~0.base_11|, ULTIMATE.start_main_~#t998~0.offset=|v_ULTIMATE.start_main_~#t998~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t998~0.base, ULTIMATE.start_main_~#t998~0.offset] because there is no mapped edge [2019-12-07 13:50:22,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t999~0.base_12|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t999~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t999~0.base_12|) |v_ULTIMATE.start_main_~#t999~0.offset_11| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t999~0.offset_11| 0) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t999~0.base_12| 1) |v_#valid_46|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t999~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, ULTIMATE.start_main_~#t999~0.base=|v_ULTIMATE.start_main_~#t999~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|, ULTIMATE.start_main_~#t999~0.offset=|v_ULTIMATE.start_main_~#t999~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t999~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t999~0.offset] because there is no mapped edge [2019-12-07 13:50:22,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L849: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1000~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1000~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1000~0.base_12| 4)) (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1000~0.base_12|) |v_ULTIMATE.start_main_~#t1000~0.offset_10| 3)) |v_#memory_int_15|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1000~0.base_12| 1)) (not (= |v_ULTIMATE.start_main_~#t1000~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_6|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1000~0.base=|v_ULTIMATE.start_main_~#t1000~0.base_12|, ULTIMATE.start_main_~#t1000~0.offset=|v_ULTIMATE.start_main_~#t1000~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1000~0.base, ULTIMATE.start_main_~#t1000~0.offset, #length] because there is no mapped edge [2019-12-07 13:50:22,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L820: Formula: (and (= ~a~0_Out-582343323 ~__unbuffered_p3_EAX~0_Out-582343323) (= ~a~0_Out-582343323 1) (= ~__unbuffered_p3_EBX~0_Out-582343323 ~b~0_In-582343323) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323)) (= ~z$r_buff0_thd4~0_Out-582343323 1) (= ~z$r_buff0_thd0~0_In-582343323 ~z$r_buff1_thd0~0_Out-582343323) (= ~z$r_buff0_thd4~0_In-582343323 ~z$r_buff1_thd4~0_Out-582343323) (= ~z$r_buff1_thd2~0_Out-582343323 ~z$r_buff0_thd2~0_In-582343323) (= ~z$r_buff1_thd1~0_Out-582343323 ~z$r_buff0_thd1~0_In-582343323) (= ~z$r_buff1_thd3~0_Out-582343323 ~z$r_buff0_thd3~0_In-582343323)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-582343323, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-582343323, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-582343323, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-582343323, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out-582343323, ~a~0=~a~0_Out-582343323, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582343323, ~b~0=~b~0_In-582343323, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-582343323, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-582343323, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out-582343323, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-582343323, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-582343323, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-582343323, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-582343323} AuxVars[] AssignedVars[~a~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, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-07 13:50:22,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_20 |v_P0Thread1of1ForFork3_#in~arg.base_22|) (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_22| v_P0Thread1of1ForFork3_~arg.offset_20) (= v_~x~0_36 1) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~b~0_48 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|} OutVars{~b~0=v_~b~0_48, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_22|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_20, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_20, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_22|, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 13:50:22,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P1ENTRY-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.base_11| v_P1Thread1of1ForFork0_~arg.base_9) (= v_~y~0_15 v_~__unbuffered_p1_EAX~0_14) (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x~0_23 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_11| v_P1Thread1of1ForFork0_~arg.offset_9)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, ~y~0=v_~y~0_15} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_9, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_11|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_15, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 13:50:22,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In733469695 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite8_In733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In733469695 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In733469695 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In733469695 256))) (= (mod ~z$w_buff0_used~0_In733469695 256) 0))) .cse0 (= |P2Thread1of1ForFork1_#t~ite8_Out733469695| ~z$w_buff0~0_In733469695) (= |P2Thread1of1ForFork1_#t~ite9_Out733469695| |P2Thread1of1ForFork1_#t~ite8_Out733469695|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_In733469695|} OutVars{~z$w_buff0~0=~z$w_buff0~0_In733469695, ~z$w_buff0_used~0=~z$w_buff0_used~0_In733469695, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In733469695, ~z$w_buff1_used~0=~z$w_buff1_used~0_In733469695, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In733469695, ~weak$$choice2~0=~weak$$choice2~0_In733469695, P2Thread1of1ForFork1_#t~ite9=|P2Thread1of1ForFork1_#t~ite9_Out733469695|, P2Thread1of1ForFork1_#t~ite8=|P2Thread1of1ForFork1_#t~ite8_Out733469695|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite9, P2Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 13:50:22,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L779-->L779-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2140763264 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2140763264 256)))) (or (= (mod ~z$w_buff0_used~0_In-2140763264 256) 0) (and (= 0 (mod ~z$r_buff1_thd3~0_In-2140763264 256)) .cse0) (and (= 0 (mod ~z$w_buff1_used~0_In-2140763264 256)) .cse0))) .cse1 (= |P2Thread1of1ForFork1_#t~ite12_Out-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite11_In-2140763264| |P2Thread1of1ForFork1_#t~ite11_Out-2140763264|) (= ~z$w_buff1~0_In-2140763264 |P2Thread1of1ForFork1_#t~ite12_Out-2140763264|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_In-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140763264, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-2140763264|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2140763264, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-2140763264|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2140763264, ~z$w_buff1~0=~z$w_buff1~0_In-2140763264, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2140763264, ~weak$$choice2~0=~weak$$choice2~0_In-2140763264} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:50:22,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L780-->L780-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1701741168 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite15_Out-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1701741168 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1701741168 256)) (and .cse0 (= (mod ~z$r_buff1_thd3~0_In-1701741168 256) 0)) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-1701741168 256))))) .cse1 (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|)) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite14_In-1701741168| |P2Thread1of1ForFork1_#t~ite14_Out-1701741168|) (= ~z$w_buff0_used~0_In-1701741168 |P2Thread1of1ForFork1_#t~ite15_Out-1701741168|)))) InVars {P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_In-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-1701741168|, P2Thread1of1ForFork1_#t~ite15=|P2Thread1of1ForFork1_#t~ite15_Out-1701741168|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1701741168, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1701741168, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1701741168, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1701741168, ~weak$$choice2~0=~weak$$choice2~0_In-1701741168} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, P2Thread1of1ForFork1_#t~ite15] because there is no mapped edge [2019-12-07 13:50:22,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L782-->L783: Formula: (and (= v_~z$r_buff0_thd3~0_90 v_~z$r_buff0_thd3~0_89) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_9|, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_89, ~weak$$choice2~0=v_~weak$$choice2~0_22, P2Thread1of1ForFork1_#t~ite19=|v_P2Thread1of1ForFork1_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 13:50:22,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-489179615 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-489179615 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In-489179615 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-489179615 256))) (= (mod ~z$w_buff0_used~0_In-489179615 256) 0))) (= ~z$r_buff1_thd3~0_In-489179615 |P2Thread1of1ForFork1_#t~ite23_Out-489179615|) (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)) (and (= |P2Thread1of1ForFork1_#t~ite24_Out-489179615| ~z$r_buff1_thd3~0_In-489179615) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite23_In-489179615| |P2Thread1of1ForFork1_#t~ite23_Out-489179615|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_In-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} OutVars{P2Thread1of1ForFork1_#t~ite24=|P2Thread1of1ForFork1_#t~ite24_Out-489179615|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-489179615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-489179615, P2Thread1of1ForFork1_#t~ite23=|P2Thread1of1ForFork1_#t~ite23_Out-489179615|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-489179615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-489179615, ~weak$$choice2~0=~weak$$choice2~0_In-489179615} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite24, P2Thread1of1ForFork1_#t~ite23] because there is no mapped edge [2019-12-07 13:50:22,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L785-->L793: Formula: (and (= 0 v_~z$flush_delayed~0_8) (= v_~z~0_22 v_~z$mem_tmp~0_6) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (not (= 0 (mod v_~z$flush_delayed~0_9 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_9} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_8, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:50:22,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In1574994956 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1574994956 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In1574994956 |P3Thread1of1ForFork2_#t~ite28_Out1574994956|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out1574994956|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1574994956, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1574994956} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 13:50:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In1210292619 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1210292619 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In1210292619 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1210292619 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1210292619 |P3Thread1of1ForFork2_#t~ite29_Out1210292619|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out1210292619|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1210292619, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1210292619, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1210292619, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1210292619} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:50:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L823-->L824: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In101925086 256) 0)) (.cse1 (= ~z$r_buff0_thd4~0_In101925086 ~z$r_buff0_thd4~0_Out101925086)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In101925086 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out101925086) (not .cse0) (not .cse2)) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In101925086} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In101925086, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out101925086, P3Thread1of1ForFork2_#t~ite30=|P3Thread1of1ForFork2_#t~ite30_Out101925086|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~ite30] because there is no mapped edge [2019-12-07 13:50:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1207685159 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1207685159 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1207685159 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1207685159 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| ~z$r_buff1_thd4~0_In1207685159) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite31_Out1207685159| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1207685159, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1207685159, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1207685159, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1207685159, P3Thread1of1ForFork2_#t~ite31=|P3Thread1of1ForFork2_#t~ite31_Out1207685159|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:50:22,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L824-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= |v_P3Thread1of1ForFork2_#t~ite31_42| v_~z$r_buff1_thd4~0_62) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_42|} OutVars{P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_62, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P3Thread1of1ForFork2_#t~ite31=|v_P3Thread1of1ForFork2_#t~ite31_41|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P3Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-07 13:50:22,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L853-->L855-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_93 256)) (= 0 (mod v_~z$r_buff0_thd0~0_15 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:50:22,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L855-2-->L855-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-60958231 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-60958231 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite37_Out-60958231| |ULTIMATE.start_main_#t~ite36_Out-60958231|))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z$w_buff1~0_In-60958231) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite36_Out-60958231| ~z~0_In-60958231) (or .cse0 .cse2) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ~z~0=~z~0_In-60958231} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-60958231, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-60958231, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-60958231|, ~z$w_buff1~0=~z$w_buff1~0_In-60958231, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-60958231|, ~z~0=~z~0_In-60958231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 13:50:22,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In908169825 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In908169825 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In908169825 |ULTIMATE.start_main_#t~ite38_Out908169825|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out908169825| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In908169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In908169825, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out908169825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 13:50:22,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In203778712 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In203778712 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In203778712 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In203778712 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite39_Out203778712| ~z$w_buff1_used~0_In203778712) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In203778712, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out203778712|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In203778712, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In203778712, ~z$w_buff1_used~0=~z$w_buff1_used~0_In203778712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 13:50:22,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1762638813 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1762638813 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1762638813| ~z$r_buff0_thd0~0_In1762638813) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1762638813, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1762638813|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1762638813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:50:22,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2096769610 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2096769610 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2096769610 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2096769610 256)))) (or (and (= ~z$r_buff1_thd0~0_In2096769610 |ULTIMATE.start_main_#t~ite41_Out2096769610|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite41_Out2096769610| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2096769610|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2096769610, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2096769610, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2096769610, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2096769610} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 13:50:22,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= |v_ULTIMATE.start_main_#t~ite41_31| v_~z$r_buff1_thd0~0_73) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~main$tmp_guard1~0_13 (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p3_EAX~0_43) (= 0 v_~__unbuffered_p3_EBX~0_41) (= v_~x~0_41 2) (= 0 v_~__unbuffered_p2_EAX~0_17))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_73, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_17, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_41, ~x~0=v_~x~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:50:22,094 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_46bebc7c-c033-4800-bc72-103433673872/bin/uautomizer/witness.graphml [2019-12-07 13:50:22,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:50:22,095 INFO L168 Benchmark]: Toolchain (without parser) took 16081.61 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 935.5 MB in the beginning and 1.7 GB in the end (delta: -739.3 MB). Peak memory consumption was 685.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:22,095 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:50:22,096 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:22,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.40 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 13:50:22,096 INFO L168 Benchmark]: Boogie Preprocessor took 24.84 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 13:50:22,096 INFO L168 Benchmark]: RCFGBuilder took 370.08 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:22,097 INFO L168 Benchmark]: TraceAbstraction took 15200.93 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -697.9 MB). Peak memory consumption was 625.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:22,097 INFO L168 Benchmark]: Witness Printer took 60.66 ms. Allocated memory is still 2.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:50:22,098 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.84 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 370.08 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: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15200.93 ms. Allocated memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: -697.9 MB). Peak memory consumption was 625.5 MB. Max. memory is 11.5 GB. * Witness Printer took 60.66 ms. Allocated memory is still 2.5 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 170 ProgramPointsBefore, 74 ProgramPointsAfterwards, 192 TransitionsBefore, 78 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 23 ChoiceCompositions, 5751 VarBasedMoverChecksPositive, 155 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 169 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.6s, 0 MoverChecksTotal, 44168 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t997, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L845] FCALL, FORK 0 pthread_create(&t998, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L847] FCALL, FORK 0 pthread_create(&t999, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L849] FCALL, FORK 0 pthread_create(&t1000, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 1 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L820] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L770] 3 y = 1 [L773] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L774] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L775] 3 z$flush_delayed = weak$$choice2 [L776] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L777] 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_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L777] 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) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 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_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, 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=2, 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] [L781] 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)) [L783] 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)) [L784] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L820] 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) [L821] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 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 [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, 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] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 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 [L858] 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, 158 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.0s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2606 SDtfs, 4012 SDslu, 5911 SDs, 0 SdLazy, 2197 SolverSat, 281 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33067occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 27585 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 189863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...