./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix016_rmo.oepc.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_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix016_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/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 a4427ecd60eb6320be5a84fbae9a9a3ed3d3d2ff ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:16:34,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:16:34,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:16:34,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:16:34,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:16:34,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:16:34,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:16:34,507 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:16:34,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:16:34,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:16:34,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:16:34,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:16:34,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:16:34,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:16:34,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:16:34,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:16:34,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:16:34,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:16:34,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:16:34,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:16:34,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:16:34,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:16:34,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:16:34,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:16:34,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:16:34,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:16:34,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:16:34,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:16:34,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:16:34,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:16:34,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:16:34,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:16:34,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:16:34,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:16:34,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:16:34,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:16:34,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:16:34,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:16:34,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:16:34,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:16:34,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:16:34,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:16:34,536 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:16:34,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:16:34,537 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:16:34,537 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:16:34,537 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:16:34,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:16:34,537 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:16:34,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:16:34,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:16:34,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:16:34,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:16:34,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:16:34,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:16:34,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:16:34,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:16:34,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:16:34,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:16:34,540 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_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/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 -> a4427ecd60eb6320be5a84fbae9a9a3ed3d3d2ff [2019-12-07 17:16:34,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:16:34,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:16:34,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:16:34,656 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:16:34,657 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:16:34,657 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix016_rmo.oepc.i [2019-12-07 17:16:34,704 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/data/497533f77/58d1192891b848fa92413226a09efe86/FLAG420388a3a [2019-12-07 17:16:35,159 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:16:35,159 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/sv-benchmarks/c/pthread-wmm/mix016_rmo.oepc.i [2019-12-07 17:16:35,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/data/497533f77/58d1192891b848fa92413226a09efe86/FLAG420388a3a [2019-12-07 17:16:35,179 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/data/497533f77/58d1192891b848fa92413226a09efe86 [2019-12-07 17:16:35,181 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:16:35,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:16:35,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:16:35,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:16:35,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:16:35,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35, skipping insertion in model container [2019-12-07 17:16:35,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:16:35,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:16:35,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:16:35,480 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:16:35,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:16:35,566 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:16:35,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35 WrapperNode [2019-12-07 17:16:35,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:16:35,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:16:35,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:16:35,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:16:35,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,603 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:16:35,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:16:35,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:16:35,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:16:35,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... [2019-12-07 17:16:35,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:16:35,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:16:35,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:16:35,628 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:16:35,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/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 17:16:35,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:16:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:16:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:16:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:16:35,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:16:35,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:16:35,671 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 17:16:36,031 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:16:36,032 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:16:36,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:36 BoogieIcfgContainer [2019-12-07 17:16:36,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:16:36,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:16:36,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:16:36,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:16:36,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:16:35" (1/3) ... [2019-12-07 17:16:36,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3106b9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:16:36, skipping insertion in model container [2019-12-07 17:16:36,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:16:35" (2/3) ... [2019-12-07 17:16:36,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3106b9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:16:36, skipping insertion in model container [2019-12-07 17:16:36,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:36" (3/3) ... [2019-12-07 17:16:36,038 INFO L109 eAbstractionObserver]: Analyzing ICFG mix016_rmo.oepc.i [2019-12-07 17:16:36,044 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:16:36,044 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:16:36,050 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:16:36,051 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,077 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,085 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:16:36,108 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:16:36,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:16:36,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:16:36,121 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:16:36,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:16:36,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:16:36,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:16:36,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:16:36,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:16:36,134 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-07 17:16:36,135 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 17:16:36,202 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 17:16:36,203 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:16:36,213 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 704 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:16:36,229 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 17:16:36,267 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 17:16:36,268 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:16:36,273 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 704 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:16:36,290 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 17:16:36,290 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:16:39,071 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-12-07 17:16:39,320 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 17:16:39,504 INFO L206 etLargeBlockEncoding]: Checked pairs total: 89688 [2019-12-07 17:16:39,504 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-07 17:16:39,506 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-07 17:16:52,059 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106864 states. [2019-12-07 17:16:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106864 states. [2019-12-07 17:16:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:16:52,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:52,065 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:16:52,065 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:52,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash 921701, now seen corresponding path program 1 times [2019-12-07 17:16:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:52,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770609973] [2019-12-07 17:16:52,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:52,205 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 17:16:52,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770609973] [2019-12-07 17:16:52,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:52,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:16:52,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151351975] [2019-12-07 17:16:52,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:16:52,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:52,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:16:52,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:16:52,221 INFO L87 Difference]: Start difference. First operand 106864 states. Second operand 3 states. [2019-12-07 17:16:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:53,005 INFO L93 Difference]: Finished difference Result 106034 states and 453004 transitions. [2019-12-07 17:16:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:16:53,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:16:53,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:53,434 INFO L225 Difference]: With dead ends: 106034 [2019-12-07 17:16:53,434 INFO L226 Difference]: Without dead ends: 99950 [2019-12-07 17:16:53,435 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 17:16:57,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99950 states. [2019-12-07 17:16:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99950 to 99950. [2019-12-07 17:16:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99950 states. [2019-12-07 17:17:00,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99950 states to 99950 states and 426445 transitions. [2019-12-07 17:17:00,569 INFO L78 Accepts]: Start accepts. Automaton has 99950 states and 426445 transitions. Word has length 3 [2019-12-07 17:17:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:00,569 INFO L462 AbstractCegarLoop]: Abstraction has 99950 states and 426445 transitions. [2019-12-07 17:17:00,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:17:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 99950 states and 426445 transitions. [2019-12-07 17:17:00,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:17:00,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:00,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:00,573 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1680645281, now seen corresponding path program 1 times [2019-12-07 17:17:00,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:00,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792614685] [2019-12-07 17:17:00,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:00,632 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 17:17:00,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792614685] [2019-12-07 17:17:00,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:00,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:17:00,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69150981] [2019-12-07 17:17:00,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:00,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:00,634 INFO L87 Difference]: Start difference. First operand 99950 states and 426445 transitions. Second operand 4 states. [2019-12-07 17:17:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:01,454 INFO L93 Difference]: Finished difference Result 159384 states and 652094 transitions. [2019-12-07 17:17:01,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:01,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:17:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:01,857 INFO L225 Difference]: With dead ends: 159384 [2019-12-07 17:17:01,857 INFO L226 Difference]: Without dead ends: 159335 [2019-12-07 17:17:01,858 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 17:17:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159335 states. [2019-12-07 17:17:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159335 to 143879. [2019-12-07 17:17:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143879 states. [2019-12-07 17:17:08,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143879 states to 143879 states and 597281 transitions. [2019-12-07 17:17:08,924 INFO L78 Accepts]: Start accepts. Automaton has 143879 states and 597281 transitions. Word has length 11 [2019-12-07 17:17:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:08,924 INFO L462 AbstractCegarLoop]: Abstraction has 143879 states and 597281 transitions. [2019-12-07 17:17:08,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 143879 states and 597281 transitions. [2019-12-07 17:17:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:17:08,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:08,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:08,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1535099311, now seen corresponding path program 1 times [2019-12-07 17:17:08,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:08,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571951288] [2019-12-07 17:17:08,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:08,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571951288] [2019-12-07 17:17:08,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:08,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:17:08,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922979556] [2019-12-07 17:17:08,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:08,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:08,983 INFO L87 Difference]: Start difference. First operand 143879 states and 597281 transitions. Second operand 4 states. [2019-12-07 17:17:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:09,961 INFO L93 Difference]: Finished difference Result 202801 states and 822791 transitions. [2019-12-07 17:17:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:09,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:17:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:10,488 INFO L225 Difference]: With dead ends: 202801 [2019-12-07 17:17:10,488 INFO L226 Difference]: Without dead ends: 202745 [2019-12-07 17:17:10,488 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 17:17:17,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202745 states. [2019-12-07 17:17:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202745 to 170256. [2019-12-07 17:17:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170256 states. [2019-12-07 17:17:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170256 states to 170256 states and 703222 transitions. [2019-12-07 17:17:20,303 INFO L78 Accepts]: Start accepts. Automaton has 170256 states and 703222 transitions. Word has length 13 [2019-12-07 17:17:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:20,304 INFO L462 AbstractCegarLoop]: Abstraction has 170256 states and 703222 transitions. [2019-12-07 17:17:20,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 170256 states and 703222 transitions. [2019-12-07 17:17:20,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:17:20,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:20,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:20,310 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:20,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:20,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1228744872, now seen corresponding path program 1 times [2019-12-07 17:17:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:20,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281707664] [2019-12-07 17:17:20,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:20,354 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 17:17:20,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281707664] [2019-12-07 17:17:20,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:20,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:17:20,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342023335] [2019-12-07 17:17:20,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:20,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:20,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:20,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:20,356 INFO L87 Difference]: Start difference. First operand 170256 states and 703222 transitions. Second operand 4 states. [2019-12-07 17:17:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:21,396 INFO L93 Difference]: Finished difference Result 214467 states and 881100 transitions. [2019-12-07 17:17:21,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:21,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:17:21,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:21,979 INFO L225 Difference]: With dead ends: 214467 [2019-12-07 17:17:21,979 INFO L226 Difference]: Without dead ends: 214467 [2019-12-07 17:17:21,979 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 17:17:27,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214467 states. [2019-12-07 17:17:31,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214467 to 183252. [2019-12-07 17:17:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183252 states. [2019-12-07 17:17:32,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183252 states to 183252 states and 757164 transitions. [2019-12-07 17:17:32,339 INFO L78 Accepts]: Start accepts. Automaton has 183252 states and 757164 transitions. Word has length 16 [2019-12-07 17:17:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:32,339 INFO L462 AbstractCegarLoop]: Abstraction has 183252 states and 757164 transitions. [2019-12-07 17:17:32,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 183252 states and 757164 transitions. [2019-12-07 17:17:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:17:32,346 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:32,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:32,346 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:32,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1228651655, now seen corresponding path program 1 times [2019-12-07 17:17:32,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:32,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703246363] [2019-12-07 17:17:32,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:32,381 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 17:17:32,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703246363] [2019-12-07 17:17:32,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:17:32,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598239923] [2019-12-07 17:17:32,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:32,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:32,382 INFO L87 Difference]: Start difference. First operand 183252 states and 757164 transitions. Second operand 4 states. [2019-12-07 17:17:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:33,908 INFO L93 Difference]: Finished difference Result 223450 states and 919042 transitions. [2019-12-07 17:17:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:33,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:17:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:34,498 INFO L225 Difference]: With dead ends: 223450 [2019-12-07 17:17:34,498 INFO L226 Difference]: Without dead ends: 223450 [2019-12-07 17:17:34,498 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 17:17:39,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223450 states. [2019-12-07 17:17:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223450 to 182620. [2019-12-07 17:17:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182620 states. [2019-12-07 17:17:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182620 states to 182620 states and 754482 transitions. [2019-12-07 17:17:46,231 INFO L78 Accepts]: Start accepts. Automaton has 182620 states and 754482 transitions. Word has length 16 [2019-12-07 17:17:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:46,232 INFO L462 AbstractCegarLoop]: Abstraction has 182620 states and 754482 transitions. [2019-12-07 17:17:46,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 182620 states and 754482 transitions. [2019-12-07 17:17:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:17:46,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:46,241 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 17:17:46,241 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:46,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1477868963, now seen corresponding path program 1 times [2019-12-07 17:17:46,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:46,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876913381] [2019-12-07 17:17:46,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:46,275 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 17:17:46,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876913381] [2019-12-07 17:17:46,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:46,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:17:46,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710004582] [2019-12-07 17:17:46,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:17:46,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:17:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:17:46,276 INFO L87 Difference]: Start difference. First operand 182620 states and 754482 transitions. Second operand 3 states. [2019-12-07 17:17:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:46,983 INFO L93 Difference]: Finished difference Result 182256 states and 753055 transitions. [2019-12-07 17:17:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:17:46,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:17:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:47,441 INFO L225 Difference]: With dead ends: 182256 [2019-12-07 17:17:47,442 INFO L226 Difference]: Without dead ends: 182256 [2019-12-07 17:17:47,442 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 17:17:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182256 states. [2019-12-07 17:17:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182256 to 182256. [2019-12-07 17:17:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182256 states. [2019-12-07 17:17:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182256 states to 182256 states and 753055 transitions. [2019-12-07 17:17:54,902 INFO L78 Accepts]: Start accepts. Automaton has 182256 states and 753055 transitions. Word has length 18 [2019-12-07 17:17:54,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:54,903 INFO L462 AbstractCegarLoop]: Abstraction has 182256 states and 753055 transitions. [2019-12-07 17:17:54,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:17:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 182256 states and 753055 transitions. [2019-12-07 17:17:54,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:17:54,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:54,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:54,914 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:54,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:54,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1719186322, now seen corresponding path program 1 times [2019-12-07 17:17:54,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:54,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402205839] [2019-12-07 17:17:54,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:54,967 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 17:17:54,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402205839] [2019-12-07 17:17:54,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:54,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:54,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021698881] [2019-12-07 17:17:54,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:54,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:54,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:54,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:54,968 INFO L87 Difference]: Start difference. First operand 182256 states and 753055 transitions. Second operand 4 states. [2019-12-07 17:17:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:55,145 INFO L93 Difference]: Finished difference Result 48553 states and 166612 transitions. [2019-12-07 17:17:55,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:55,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 17:17:55,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:55,205 INFO L225 Difference]: With dead ends: 48553 [2019-12-07 17:17:55,205 INFO L226 Difference]: Without dead ends: 36912 [2019-12-07 17:17:55,206 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 17:17:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36912 states. [2019-12-07 17:17:55,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36912 to 36776. [2019-12-07 17:17:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36776 states. [2019-12-07 17:17:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36776 states to 36776 states and 119594 transitions. [2019-12-07 17:17:55,808 INFO L78 Accepts]: Start accepts. Automaton has 36776 states and 119594 transitions. Word has length 19 [2019-12-07 17:17:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:55,809 INFO L462 AbstractCegarLoop]: Abstraction has 36776 states and 119594 transitions. [2019-12-07 17:17:55,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36776 states and 119594 transitions. [2019-12-07 17:17:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:17:55,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:55,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:55,814 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1838789338, now seen corresponding path program 1 times [2019-12-07 17:17:55,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:55,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239085896] [2019-12-07 17:17:55,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:55,870 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 17:17:55,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239085896] [2019-12-07 17:17:55,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:55,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:55,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297918004] [2019-12-07 17:17:55,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:55,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:55,872 INFO L87 Difference]: Start difference. First operand 36776 states and 119594 transitions. Second operand 5 states. [2019-12-07 17:17:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:56,278 INFO L93 Difference]: Finished difference Result 55414 states and 177137 transitions. [2019-12-07 17:17:56,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:17:56,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:17:56,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:56,454 INFO L225 Difference]: With dead ends: 55414 [2019-12-07 17:17:56,454 INFO L226 Difference]: Without dead ends: 55358 [2019-12-07 17:17:56,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:17:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55358 states. [2019-12-07 17:17:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55358 to 38662. [2019-12-07 17:17:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38662 states. [2019-12-07 17:17:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38662 states to 38662 states and 125720 transitions. [2019-12-07 17:17:57,134 INFO L78 Accepts]: Start accepts. Automaton has 38662 states and 125720 transitions. Word has length 22 [2019-12-07 17:17:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:57,134 INFO L462 AbstractCegarLoop]: Abstraction has 38662 states and 125720 transitions. [2019-12-07 17:17:57,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 38662 states and 125720 transitions. [2019-12-07 17:17:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:17:57,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:57,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:57,139 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:57,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:57,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1838882555, now seen corresponding path program 1 times [2019-12-07 17:17:57,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:57,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255015838] [2019-12-07 17:17:57,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:57,190 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 17:17:57,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255015838] [2019-12-07 17:17:57,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:57,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:57,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773892592] [2019-12-07 17:17:57,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:57,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:57,191 INFO L87 Difference]: Start difference. First operand 38662 states and 125720 transitions. Second operand 5 states. [2019-12-07 17:17:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:57,617 INFO L93 Difference]: Finished difference Result 57384 states and 182835 transitions. [2019-12-07 17:17:57,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:17:57,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:17:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:57,703 INFO L225 Difference]: With dead ends: 57384 [2019-12-07 17:17:57,704 INFO L226 Difference]: Without dead ends: 57328 [2019-12-07 17:17:57,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:17:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57328 states. [2019-12-07 17:17:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57328 to 36156. [2019-12-07 17:17:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36156 states. [2019-12-07 17:17:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36156 states to 36156 states and 117341 transitions. [2019-12-07 17:17:58,427 INFO L78 Accepts]: Start accepts. Automaton has 36156 states and 117341 transitions. Word has length 22 [2019-12-07 17:17:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:58,428 INFO L462 AbstractCegarLoop]: Abstraction has 36156 states and 117341 transitions. [2019-12-07 17:17:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 36156 states and 117341 transitions. [2019-12-07 17:17:58,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:17:58,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:58,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:58,435 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash 320469370, now seen corresponding path program 1 times [2019-12-07 17:17:58,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:58,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751070658] [2019-12-07 17:17:58,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:58,485 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 17:17:58,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751070658] [2019-12-07 17:17:58,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:58,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:58,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367098113] [2019-12-07 17:17:58,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:58,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:58,487 INFO L87 Difference]: Start difference. First operand 36156 states and 117341 transitions. Second operand 5 states. [2019-12-07 17:17:58,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:58,872 INFO L93 Difference]: Finished difference Result 50909 states and 161629 transitions. [2019-12-07 17:17:58,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:17:58,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:17:58,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:58,948 INFO L225 Difference]: With dead ends: 50909 [2019-12-07 17:17:58,948 INFO L226 Difference]: Without dead ends: 50896 [2019-12-07 17:17:58,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:17:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50896 states. [2019-12-07 17:17:59,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50896 to 41931. [2019-12-07 17:17:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41931 states. [2019-12-07 17:17:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41931 states to 41931 states and 135692 transitions. [2019-12-07 17:17:59,759 INFO L78 Accepts]: Start accepts. Automaton has 41931 states and 135692 transitions. Word has length 25 [2019-12-07 17:17:59,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:59,759 INFO L462 AbstractCegarLoop]: Abstraction has 41931 states and 135692 transitions. [2019-12-07 17:17:59,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:59,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41931 states and 135692 transitions. [2019-12-07 17:17:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:17:59,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:59,769 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:59,769 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:59,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:59,769 INFO L82 PathProgramCache]: Analyzing trace with hash 270212897, now seen corresponding path program 1 times [2019-12-07 17:17:59,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:59,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827644080] [2019-12-07 17:17:59,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:59,796 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 17:17:59,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827644080] [2019-12-07 17:17:59,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:59,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:59,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702873120] [2019-12-07 17:17:59,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:17:59,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:17:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:17:59,797 INFO L87 Difference]: Start difference. First operand 41931 states and 135692 transitions. Second operand 3 states. [2019-12-07 17:17:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:59,975 INFO L93 Difference]: Finished difference Result 64858 states and 208670 transitions. [2019-12-07 17:17:59,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:17:59,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:17:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:00,074 INFO L225 Difference]: With dead ends: 64858 [2019-12-07 17:18:00,074 INFO L226 Difference]: Without dead ends: 64858 [2019-12-07 17:18:00,074 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 17:18:00,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64858 states. [2019-12-07 17:18:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64858 to 49264. [2019-12-07 17:18:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49264 states. [2019-12-07 17:18:01,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49264 states to 49264 states and 159735 transitions. [2019-12-07 17:18:01,003 INFO L78 Accepts]: Start accepts. Automaton has 49264 states and 159735 transitions. Word has length 27 [2019-12-07 17:18:01,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:01,003 INFO L462 AbstractCegarLoop]: Abstraction has 49264 states and 159735 transitions. [2019-12-07 17:18:01,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:01,003 INFO L276 IsEmpty]: Start isEmpty. Operand 49264 states and 159735 transitions. [2019-12-07 17:18:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:18:01,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:01,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:01,017 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2064759266, now seen corresponding path program 1 times [2019-12-07 17:18:01,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:01,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042588069] [2019-12-07 17:18:01,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:01,045 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 17:18:01,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042588069] [2019-12-07 17:18:01,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:01,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:18:01,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913586326] [2019-12-07 17:18:01,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:01,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:01,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:01,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:18:01,046 INFO L87 Difference]: Start difference. First operand 49264 states and 159735 transitions. Second operand 3 states. [2019-12-07 17:18:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:01,224 INFO L93 Difference]: Finished difference Result 64858 states and 203721 transitions. [2019-12-07 17:18:01,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:18:01,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:18:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:01,321 INFO L225 Difference]: With dead ends: 64858 [2019-12-07 17:18:01,321 INFO L226 Difference]: Without dead ends: 64858 [2019-12-07 17:18:01,322 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 17:18:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64858 states. [2019-12-07 17:18:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64858 to 49264. [2019-12-07 17:18:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49264 states. [2019-12-07 17:18:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49264 states to 49264 states and 154786 transitions. [2019-12-07 17:18:02,251 INFO L78 Accepts]: Start accepts. Automaton has 49264 states and 154786 transitions. Word has length 27 [2019-12-07 17:18:02,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:02,251 INFO L462 AbstractCegarLoop]: Abstraction has 49264 states and 154786 transitions. [2019-12-07 17:18:02,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:02,251 INFO L276 IsEmpty]: Start isEmpty. Operand 49264 states and 154786 transitions. [2019-12-07 17:18:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:18:02,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:02,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:02,265 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2010439622, now seen corresponding path program 1 times [2019-12-07 17:18:02,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:02,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143218222] [2019-12-07 17:18:02,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:02,298 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 17:18:02,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143218222] [2019-12-07 17:18:02,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:02,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:18:02,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048336874] [2019-12-07 17:18:02,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:02,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:02,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:02,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:02,299 INFO L87 Difference]: Start difference. First operand 49264 states and 154786 transitions. Second operand 5 states. [2019-12-07 17:18:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:02,692 INFO L93 Difference]: Finished difference Result 60633 states and 188266 transitions. [2019-12-07 17:18:02,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:18:02,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:18:02,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:02,778 INFO L225 Difference]: With dead ends: 60633 [2019-12-07 17:18:02,778 INFO L226 Difference]: Without dead ends: 60457 [2019-12-07 17:18:02,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:18:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60457 states. [2019-12-07 17:18:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60457 to 53712. [2019-12-07 17:18:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53712 states. [2019-12-07 17:18:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53712 states to 53712 states and 168392 transitions. [2019-12-07 17:18:03,684 INFO L78 Accepts]: Start accepts. Automaton has 53712 states and 168392 transitions. Word has length 27 [2019-12-07 17:18:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:03,684 INFO L462 AbstractCegarLoop]: Abstraction has 53712 states and 168392 transitions. [2019-12-07 17:18:03,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 53712 states and 168392 transitions. [2019-12-07 17:18:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:18:03,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:03,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:03,701 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:03,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 773295241, now seen corresponding path program 1 times [2019-12-07 17:18:03,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:03,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063208066] [2019-12-07 17:18:03,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:18:03,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063208066] [2019-12-07 17:18:03,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:03,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:18:03,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009154787] [2019-12-07 17:18:03,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:03,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:03,743 INFO L87 Difference]: Start difference. First operand 53712 states and 168392 transitions. Second operand 5 states. [2019-12-07 17:18:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:04,063 INFO L93 Difference]: Finished difference Result 64178 states and 198922 transitions. [2019-12-07 17:18:04,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:18:04,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:18:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:04,146 INFO L225 Difference]: With dead ends: 64178 [2019-12-07 17:18:04,146 INFO L226 Difference]: Without dead ends: 63994 [2019-12-07 17:18:04,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:18:04,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63994 states. [2019-12-07 17:18:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63994 to 53604. [2019-12-07 17:18:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53604 states. [2019-12-07 17:18:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53604 states to 53604 states and 167863 transitions. [2019-12-07 17:18:05,074 INFO L78 Accepts]: Start accepts. Automaton has 53604 states and 167863 transitions. Word has length 28 [2019-12-07 17:18:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:05,074 INFO L462 AbstractCegarLoop]: Abstraction has 53604 states and 167863 transitions. [2019-12-07 17:18:05,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:05,074 INFO L276 IsEmpty]: Start isEmpty. Operand 53604 states and 167863 transitions. [2019-12-07 17:18:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:18:05,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:05,087 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:05,088 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash -340313241, now seen corresponding path program 1 times [2019-12-07 17:18:05,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:05,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996305122] [2019-12-07 17:18:05,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:05,128 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 17:18:05,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996305122] [2019-12-07 17:18:05,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:05,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:18:05,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133010423] [2019-12-07 17:18:05,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:05,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:05,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:05,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:05,130 INFO L87 Difference]: Start difference. First operand 53604 states and 167863 transitions. Second operand 5 states. [2019-12-07 17:18:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:05,633 INFO L93 Difference]: Finished difference Result 73481 states and 227986 transitions. [2019-12-07 17:18:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:18:05,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 17:18:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:05,742 INFO L225 Difference]: With dead ends: 73481 [2019-12-07 17:18:05,742 INFO L226 Difference]: Without dead ends: 73481 [2019-12-07 17:18:05,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73481 states. [2019-12-07 17:18:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73481 to 64191. [2019-12-07 17:18:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64191 states. [2019-12-07 17:18:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64191 states to 64191 states and 200913 transitions. [2019-12-07 17:18:06,884 INFO L78 Accepts]: Start accepts. Automaton has 64191 states and 200913 transitions. Word has length 29 [2019-12-07 17:18:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:06,884 INFO L462 AbstractCegarLoop]: Abstraction has 64191 states and 200913 transitions. [2019-12-07 17:18:06,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 64191 states and 200913 transitions. [2019-12-07 17:18:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:18:06,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:06,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:06,903 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1820575072, now seen corresponding path program 1 times [2019-12-07 17:18:06,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:06,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859248296] [2019-12-07 17:18:06,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:06,948 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 17:18:06,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859248296] [2019-12-07 17:18:06,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:06,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:18:06,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718656463] [2019-12-07 17:18:06,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:06,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:06,949 INFO L87 Difference]: Start difference. First operand 64191 states and 200913 transitions. Second operand 5 states. [2019-12-07 17:18:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:07,057 INFO L93 Difference]: Finished difference Result 32040 states and 94871 transitions. [2019-12-07 17:18:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:18:07,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 17:18:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:07,088 INFO L225 Difference]: With dead ends: 32040 [2019-12-07 17:18:07,089 INFO L226 Difference]: Without dead ends: 27824 [2019-12-07 17:18:07,089 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 17:18:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27824 states. [2019-12-07 17:18:07,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27824 to 25820. [2019-12-07 17:18:07,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25820 states. [2019-12-07 17:18:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25820 states to 25820 states and 76265 transitions. [2019-12-07 17:18:07,469 INFO L78 Accepts]: Start accepts. Automaton has 25820 states and 76265 transitions. Word has length 30 [2019-12-07 17:18:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:07,469 INFO L462 AbstractCegarLoop]: Abstraction has 25820 states and 76265 transitions. [2019-12-07 17:18:07,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 25820 states and 76265 transitions. [2019-12-07 17:18:07,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:18:07,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:07,487 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 17:18:07,487 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:07,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash -809721720, now seen corresponding path program 1 times [2019-12-07 17:18:07,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:07,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827954296] [2019-12-07 17:18:07,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:07,526 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 17:18:07,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827954296] [2019-12-07 17:18:07,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:07,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:18:07,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423565052] [2019-12-07 17:18:07,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:18:07,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:07,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:18:07,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:07,527 INFO L87 Difference]: Start difference. First operand 25820 states and 76265 transitions. Second operand 6 states. [2019-12-07 17:18:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:07,934 INFO L93 Difference]: Finished difference Result 32869 states and 95951 transitions. [2019-12-07 17:18:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:18:07,934 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 17:18:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:07,968 INFO L225 Difference]: With dead ends: 32869 [2019-12-07 17:18:07,968 INFO L226 Difference]: Without dead ends: 32555 [2019-12-07 17:18:07,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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 17:18:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32555 states. [2019-12-07 17:18:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32555 to 26717. [2019-12-07 17:18:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26717 states. [2019-12-07 17:18:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26717 states to 26717 states and 78965 transitions. [2019-12-07 17:18:08,374 INFO L78 Accepts]: Start accepts. Automaton has 26717 states and 78965 transitions. Word has length 33 [2019-12-07 17:18:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:08,374 INFO L462 AbstractCegarLoop]: Abstraction has 26717 states and 78965 transitions. [2019-12-07 17:18:08,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 26717 states and 78965 transitions. [2019-12-07 17:18:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:18:08,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:08,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:08,393 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash -752360441, now seen corresponding path program 1 times [2019-12-07 17:18:08,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:08,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079391922] [2019-12-07 17:18:08,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:08,450 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 17:18:08,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079391922] [2019-12-07 17:18:08,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:08,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:18:08,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125669360] [2019-12-07 17:18:08,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:18:08,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:08,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:18:08,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:08,451 INFO L87 Difference]: Start difference. First operand 26717 states and 78965 transitions. Second operand 6 states. [2019-12-07 17:18:08,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:08,902 INFO L93 Difference]: Finished difference Result 32289 states and 94110 transitions. [2019-12-07 17:18:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:18:08,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 17:18:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:08,935 INFO L225 Difference]: With dead ends: 32289 [2019-12-07 17:18:08,936 INFO L226 Difference]: Without dead ends: 31914 [2019-12-07 17:18:08,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 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 17:18:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31914 states. [2019-12-07 17:18:09,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31914 to 24404. [2019-12-07 17:18:09,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24404 states. [2019-12-07 17:18:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24404 states to 24404 states and 72058 transitions. [2019-12-07 17:18:09,385 INFO L78 Accepts]: Start accepts. Automaton has 24404 states and 72058 transitions. Word has length 34 [2019-12-07 17:18:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:09,385 INFO L462 AbstractCegarLoop]: Abstraction has 24404 states and 72058 transitions. [2019-12-07 17:18:09,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 24404 states and 72058 transitions. [2019-12-07 17:18:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:18:09,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:09,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:09,403 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:09,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash 202654059, now seen corresponding path program 1 times [2019-12-07 17:18:09,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:09,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472660744] [2019-12-07 17:18:09,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:09,447 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 17:18:09,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472660744] [2019-12-07 17:18:09,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:09,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:18:09,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013739619] [2019-12-07 17:18:09,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:18:09,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:09,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:18:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:18:09,448 INFO L87 Difference]: Start difference. First operand 24404 states and 72058 transitions. Second operand 5 states. [2019-12-07 17:18:09,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:09,860 INFO L93 Difference]: Finished difference Result 35030 states and 102665 transitions. [2019-12-07 17:18:09,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:18:09,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 17:18:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:09,896 INFO L225 Difference]: With dead ends: 35030 [2019-12-07 17:18:09,896 INFO L226 Difference]: Without dead ends: 35030 [2019-12-07 17:18:09,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:18:10,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35030 states. [2019-12-07 17:18:10,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35030 to 28580. [2019-12-07 17:18:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28580 states. [2019-12-07 17:18:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28580 states to 28580 states and 84897 transitions. [2019-12-07 17:18:10,330 INFO L78 Accepts]: Start accepts. Automaton has 28580 states and 84897 transitions. Word has length 40 [2019-12-07 17:18:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:10,331 INFO L462 AbstractCegarLoop]: Abstraction has 28580 states and 84897 transitions. [2019-12-07 17:18:10,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:18:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28580 states and 84897 transitions. [2019-12-07 17:18:10,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:18:10,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:10,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:10,356 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1689924949, now seen corresponding path program 2 times [2019-12-07 17:18:10,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:10,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152044530] [2019-12-07 17:18:10,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:10,386 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 17:18:10,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152044530] [2019-12-07 17:18:10,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:10,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:18:10,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220470172] [2019-12-07 17:18:10,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:10,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:10,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:10,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:18:10,387 INFO L87 Difference]: Start difference. First operand 28580 states and 84897 transitions. Second operand 3 states. [2019-12-07 17:18:10,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:10,444 INFO L93 Difference]: Finished difference Result 24404 states and 71280 transitions. [2019-12-07 17:18:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:18:10,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 17:18:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:10,469 INFO L225 Difference]: With dead ends: 24404 [2019-12-07 17:18:10,469 INFO L226 Difference]: Without dead ends: 24404 [2019-12-07 17:18:10,470 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 17:18:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24404 states. [2019-12-07 17:18:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24404 to 24264. [2019-12-07 17:18:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24264 states. [2019-12-07 17:18:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24264 states to 24264 states and 70890 transitions. [2019-12-07 17:18:10,793 INFO L78 Accepts]: Start accepts. Automaton has 24264 states and 70890 transitions. Word has length 40 [2019-12-07 17:18:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:10,793 INFO L462 AbstractCegarLoop]: Abstraction has 24264 states and 70890 transitions. [2019-12-07 17:18:10,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 24264 states and 70890 transitions. [2019-12-07 17:18:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:18:10,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:10,812 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] [2019-12-07 17:18:10,812 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1073280414, now seen corresponding path program 1 times [2019-12-07 17:18:10,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:10,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879797867] [2019-12-07 17:18:10,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:10,862 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 17:18:10,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879797867] [2019-12-07 17:18:10,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:10,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:18:10,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253340515] [2019-12-07 17:18:10,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:18:10,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:18:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:10,864 INFO L87 Difference]: Start difference. First operand 24264 states and 70890 transitions. Second operand 6 states. [2019-12-07 17:18:10,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:10,953 INFO L93 Difference]: Finished difference Result 22850 states and 67697 transitions. [2019-12-07 17:18:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:18:10,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 17:18:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:10,974 INFO L225 Difference]: With dead ends: 22850 [2019-12-07 17:18:10,974 INFO L226 Difference]: Without dead ends: 22635 [2019-12-07 17:18:10,975 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 17:18:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22635 states. [2019-12-07 17:18:11,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22635 to 20056. [2019-12-07 17:18:11,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20056 states. [2019-12-07 17:18:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20056 states to 20056 states and 60023 transitions. [2019-12-07 17:18:11,266 INFO L78 Accepts]: Start accepts. Automaton has 20056 states and 60023 transitions. Word has length 41 [2019-12-07 17:18:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:11,266 INFO L462 AbstractCegarLoop]: Abstraction has 20056 states and 60023 transitions. [2019-12-07 17:18:11,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:11,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20056 states and 60023 transitions. [2019-12-07 17:18:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:18:11,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:11,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:11,284 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash -2054876907, now seen corresponding path program 1 times [2019-12-07 17:18:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:11,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144707362] [2019-12-07 17:18:11,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:11,320 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 17:18:11,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144707362] [2019-12-07 17:18:11,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:11,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:18:11,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93587442] [2019-12-07 17:18:11,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:11,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:11,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:18:11,321 INFO L87 Difference]: Start difference. First operand 20056 states and 60023 transitions. Second operand 3 states. [2019-12-07 17:18:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:11,400 INFO L93 Difference]: Finished difference Result 24660 states and 73822 transitions. [2019-12-07 17:18:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:18:11,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 17:18:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:11,429 INFO L225 Difference]: With dead ends: 24660 [2019-12-07 17:18:11,429 INFO L226 Difference]: Without dead ends: 24660 [2019-12-07 17:18:11,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 17:18:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24660 states. [2019-12-07 17:18:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24660 to 20449. [2019-12-07 17:18:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20449 states. [2019-12-07 17:18:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20449 states to 20449 states and 61546 transitions. [2019-12-07 17:18:11,741 INFO L78 Accepts]: Start accepts. Automaton has 20449 states and 61546 transitions. Word has length 65 [2019-12-07 17:18:11,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:11,742 INFO L462 AbstractCegarLoop]: Abstraction has 20449 states and 61546 transitions. [2019-12-07 17:18:11,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand 20449 states and 61546 transitions. [2019-12-07 17:18:11,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:18:11,759 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:11,759 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:11,760 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:11,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:11,760 INFO L82 PathProgramCache]: Analyzing trace with hash -165796368, now seen corresponding path program 1 times [2019-12-07 17:18:11,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:11,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763161005] [2019-12-07 17:18:11,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:11,807 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 17:18:11,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763161005] [2019-12-07 17:18:11,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:11,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:18:11,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452909944] [2019-12-07 17:18:11,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:18:11,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:18:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:18:11,809 INFO L87 Difference]: Start difference. First operand 20449 states and 61546 transitions. Second operand 4 states. [2019-12-07 17:18:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:11,896 INFO L93 Difference]: Finished difference Result 20148 states and 60468 transitions. [2019-12-07 17:18:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:18:11,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 17:18:11,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:11,916 INFO L225 Difference]: With dead ends: 20148 [2019-12-07 17:18:11,916 INFO L226 Difference]: Without dead ends: 20148 [2019-12-07 17:18:11,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:18:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20148 states. [2019-12-07 17:18:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20148 to 18915. [2019-12-07 17:18:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18915 states. [2019-12-07 17:18:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18915 states to 18915 states and 56541 transitions. [2019-12-07 17:18:12,185 INFO L78 Accepts]: Start accepts. Automaton has 18915 states and 56541 transitions. Word has length 66 [2019-12-07 17:18:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:12,185 INFO L462 AbstractCegarLoop]: Abstraction has 18915 states and 56541 transitions. [2019-12-07 17:18:12,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:18:12,185 INFO L276 IsEmpty]: Start isEmpty. Operand 18915 states and 56541 transitions. [2019-12-07 17:18:12,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:18:12,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:12,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:12,200 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2121191425, now seen corresponding path program 1 times [2019-12-07 17:18:12,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:12,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808620629] [2019-12-07 17:18:12,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:12,233 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 17:18:12,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808620629] [2019-12-07 17:18:12,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:12,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:18:12,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397542658] [2019-12-07 17:18:12,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:18:12,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:18:12,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:18:12,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:18:12,235 INFO L87 Difference]: Start difference. First operand 18915 states and 56541 transitions. Second operand 3 states. [2019-12-07 17:18:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:12,281 INFO L93 Difference]: Finished difference Result 18914 states and 56539 transitions. [2019-12-07 17:18:12,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:18:12,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 17:18:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:12,299 INFO L225 Difference]: With dead ends: 18914 [2019-12-07 17:18:12,300 INFO L226 Difference]: Without dead ends: 18914 [2019-12-07 17:18:12,300 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 17:18:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18914 states. [2019-12-07 17:18:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18914 to 14434. [2019-12-07 17:18:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14434 states. [2019-12-07 17:18:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14434 states to 14434 states and 43722 transitions. [2019-12-07 17:18:12,578 INFO L78 Accepts]: Start accepts. Automaton has 14434 states and 43722 transitions. Word has length 66 [2019-12-07 17:18:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:12,578 INFO L462 AbstractCegarLoop]: Abstraction has 14434 states and 43722 transitions. [2019-12-07 17:18:12,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:18:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 14434 states and 43722 transitions. [2019-12-07 17:18:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:18:12,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:12,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:12,590 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:12,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:12,591 INFO L82 PathProgramCache]: Analyzing trace with hash 817808390, now seen corresponding path program 1 times [2019-12-07 17:18:12,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:18:12,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844873453] [2019-12-07 17:18:12,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:18:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:18:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:18:12,675 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:18:12,675 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:18:12,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t421~0.base_44| 4)) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t421~0.base_44|) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44|) 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44| 1)) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t421~0.offset_30| 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44|) |v_ULTIMATE.start_main_~#t421~0.offset_30| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_24|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_~#t421~0.base=|v_ULTIMATE.start_main_~#t421~0.base_44|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_44|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t421~0.offset=|v_ULTIMATE.start_main_~#t421~0.offset_30|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_19|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t423~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t421~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t422~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t421~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-07 17:18:12,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff1_thd2~0_Out1550986411 ~z$r_buff0_thd2~0_In1550986411) (= ~z$r_buff1_thd3~0_Out1550986411 ~z$r_buff0_thd3~0_In1550986411) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411 0)) (= 1 ~z$r_buff0_thd1~0_Out1550986411) (= ~z$r_buff0_thd0~0_In1550986411 ~z$r_buff1_thd0~0_Out1550986411) (= ~x~0_In1550986411 ~__unbuffered_p0_EAX~0_Out1550986411) (= ~z$r_buff0_thd1~0_In1550986411 ~z$r_buff1_thd1~0_Out1550986411)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1550986411, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550986411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1550986411, ~x~0=~x~0_In1550986411, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1550986411} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1550986411, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1550986411, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1550986411, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1550986411, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1550986411, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1550986411, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550986411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1550986411, ~x~0=~x~0_In1550986411, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1550986411} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:18:12,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t422~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t422~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t422~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13|) |v_ULTIMATE.start_main_~#t422~0.offset_11| 1))) (not (= |v_ULTIMATE.start_main_~#t422~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_11|, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_~#t422~0.base] because there is no mapped edge [2019-12-07 17:18:12,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1115873471 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1115873471 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| |P1Thread1of1ForFork2_#t~ite10_Out1115873471|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| ~z$w_buff1~0_In1115873471) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| ~z~0_In1115873471) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1115873471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115873471, ~z$w_buff1~0=~z$w_buff1~0_In1115873471, ~z~0=~z~0_In1115873471} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1115873471|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1115873471|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115873471, ~z$w_buff1~0=~z$w_buff1~0_In1115873471, ~z~0=~z~0_In1115873471} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 17:18:12,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In814087180 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In814087180 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out814087180|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In814087180 |P1Thread1of1ForFork2_#t~ite11_Out814087180|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In814087180, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In814087180} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In814087180, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out814087180|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In814087180} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 17:18:12,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-288516922 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-288516922 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-288516922 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-288516922 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-288516922| 0)) (and (= ~z$w_buff1_used~0_In-288516922 |P1Thread1of1ForFork2_#t~ite12_Out-288516922|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-288516922, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288516922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288516922, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-288516922} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-288516922, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288516922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288516922, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-288516922|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 17:18:12,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t423~0.base_10|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10|) |v_ULTIMATE.start_main_~#t423~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t423~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t423~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t423~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t423~0.base, #length, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-07 17:18:12,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In639891994 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In639891994 |P2Thread1of1ForFork0_#t~ite21_Out639891994|) (= |P2Thread1of1ForFork0_#t~ite20_In639891994| |P2Thread1of1ForFork0_#t~ite20_Out639891994|)) (and (= ~z$w_buff0~0_In639891994 |P2Thread1of1ForFork0_#t~ite20_Out639891994|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In639891994 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In639891994 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In639891994 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In639891994 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out639891994| |P2Thread1of1ForFork0_#t~ite20_Out639891994|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In639891994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639891994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In639891994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639891994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In639891994, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In639891994|, ~weak$$choice2~0=~weak$$choice2~0_In639891994} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out639891994|, ~z$w_buff0~0=~z$w_buff0~0_In639891994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639891994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In639891994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639891994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In639891994, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out639891994|, ~weak$$choice2~0=~weak$$choice2~0_In639891994} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 17:18:12,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1526973204 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1526973204| |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (= ~z$w_buff1~0_In-1526973204 |P2Thread1of1ForFork0_#t~ite24_Out-1526973204|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1526973204| |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (= ~z$w_buff1~0_In-1526973204 |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1526973204 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1526973204 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1526973204 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1526973204 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1526973204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1526973204, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1526973204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526973204, ~z$w_buff1~0=~z$w_buff1~0_In-1526973204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1526973204, ~weak$$choice2~0=~weak$$choice2~0_In-1526973204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1526973204, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1526973204|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1526973204, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1526973204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526973204, ~z$w_buff1~0=~z$w_buff1~0_In-1526973204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1526973204, ~weak$$choice2~0=~weak$$choice2~0_In-1526973204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 17:18:12,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_6|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_10|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:18:12,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In985980656 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In985980656 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out985980656| ~z~0_In985980656)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out985980656| ~z$w_buff1~0_In985980656) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In985980656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985980656, ~z$w_buff1~0=~z$w_buff1~0_In985980656, ~z~0=~z~0_In985980656} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out985980656|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In985980656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985980656, ~z$w_buff1~0=~z$w_buff1~0_In985980656, ~z~0=~z~0_In985980656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 17:18:12,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1448315462 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1448315462 256)))) (or (and (= ~z$w_buff0_used~0_In1448315462 |P2Thread1of1ForFork0_#t~ite40_Out1448315462|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1448315462|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1448315462, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1448315462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1448315462, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1448315462|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1448315462} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 17:18:12,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-991978019 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-991978019 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-991978019|)) (and (= ~z$r_buff0_thd2~0_In-991978019 |P1Thread1of1ForFork2_#t~ite13_Out-991978019|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-991978019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-991978019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-991978019, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-991978019|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-991978019} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 17:18:12,686 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-343173316 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-343173316 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-343173316|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-343173316 |P0Thread1of1ForFork1_#t~ite5_Out-343173316|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-343173316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-343173316} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-343173316|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-343173316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-343173316} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 17:18:12,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-840265942 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-840265942 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-840265942 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-840265942 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-840265942 |P0Thread1of1ForFork1_#t~ite6_Out-840265942|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-840265942|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-840265942, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-840265942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840265942, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-840265942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-840265942, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-840265942|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-840265942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840265942, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-840265942} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 17:18:12,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-613356867 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-613356867 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-613356867 ~z$r_buff0_thd1~0_In-613356867))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-613356867 0)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-613356867, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-613356867} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-613356867, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-613356867|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-613356867} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:18:12,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1528009730 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1528009730 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1528009730 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1528009730 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1528009730| ~z$r_buff1_thd1~0_In-1528009730) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1528009730| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1528009730, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1528009730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1528009730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1528009730} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1528009730|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1528009730, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1528009730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1528009730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1528009730} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 17:18:12,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_22|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_21|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:18:12,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2082526240 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2082526240 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-2082526240 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2082526240 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-2082526240|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-2082526240 |P2Thread1of1ForFork0_#t~ite41_Out-2082526240|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2082526240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2082526240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2082526240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2082526240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2082526240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2082526240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2082526240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2082526240, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2082526240|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 17:18:12,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1982293883 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1982293883 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1982293883|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1982293883| ~z$r_buff0_thd3~0_In1982293883) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1982293883, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982293883} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1982293883, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982293883, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1982293883|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-575443488 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-575443488 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-575443488 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-575443488 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-575443488|)) (and (= ~z$r_buff1_thd3~0_In-575443488 |P2Thread1of1ForFork0_#t~ite43_Out-575443488|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-575443488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-575443488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575443488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-575443488} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-575443488|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-575443488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-575443488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575443488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-575443488} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_24|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-785337181 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-785337181 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-785337181 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-785337181 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-785337181| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-785337181| ~z$r_buff1_thd2~0_In-785337181) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-785337181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-785337181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785337181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-785337181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-785337181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-785337181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785337181, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-785337181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-785337181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1848309657 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1848309657 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1848309657 |ULTIMATE.start_main_#t~ite47_Out1848309657|)) (and (or .cse1 .cse0) (= ~z~0_In1848309657 |ULTIMATE.start_main_#t~ite47_Out1848309657|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1848309657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1848309657, ~z$w_buff1~0=~z$w_buff1~0_In1848309657, ~z~0=~z~0_In1848309657} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1848309657, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1848309657|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1848309657, ~z$w_buff1~0=~z$w_buff1~0_In1848309657, ~z~0=~z~0_In1848309657} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-620238207 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-620238207 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-620238207 |ULTIMATE.start_main_#t~ite49_Out-620238207|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-620238207|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-620238207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620238207} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-620238207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620238207, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-620238207|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:18:12,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1108669482 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1108669482 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1108669482 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1108669482 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1108669482|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1108669482 |ULTIMATE.start_main_#t~ite50_Out-1108669482|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108669482, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108669482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108669482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108669482} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1108669482|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108669482, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108669482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108669482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108669482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:18:12,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1984533797 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1984533797 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1984533797|)) (and (= ~z$r_buff0_thd0~0_In1984533797 |ULTIMATE.start_main_#t~ite51_Out1984533797|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1984533797, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1984533797} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1984533797, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1984533797|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1984533797} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:18:12,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1423016518 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1423016518 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1423016518 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1423016518 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1423016518| 0)) (and (= ~z$r_buff1_thd0~0_In1423016518 |ULTIMATE.start_main_#t~ite52_Out1423016518|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1423016518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1423016518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1423016518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1423016518} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1423016518|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1423016518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1423016518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1423016518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:18:12,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~__unbuffered_p2_EBX~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, 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 17:18:12,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:18:12 BasicIcfg [2019-12-07 17:18:12,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:18:12,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:18:12,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:18:12,746 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:18:12,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:16:36" (3/4) ... [2019-12-07 17:18:12,749 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:18:12,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [903] [903] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_73| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t421~0.base_44| 4)) (= v_~z$r_buff1_thd1~0_114 0) (= v_~main$tmp_guard1~0_44 0) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~z$r_buff0_thd3~0_325) (= v_~z$mem_tmp~0_16 0) (= 0 v_~z$r_buff1_thd3~0_218) (= |v_#NULL.offset_3| 0) (= v_~z$read_delayed~0_8 0) (= 0 v_~weak$$choice0~0_15) (= v_~z$w_buff1~0_167 0) (= v_~z$r_buff0_thd0~0_136 0) (= v_~x~0_84 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t421~0.base_44|) (= v_~z$r_buff0_thd1~0_185 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_46) (= 0 v_~weak$$choice2~0_93) (= 0 v_~__unbuffered_p1_EAX~0_60) (= v_~z$w_buff0~0_229 0) (= 0 v_~__unbuffered_p0_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_63) (= v_~z$r_buff0_thd2~0_132 0) (= v_~z~0_167 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44|) 0) (= v_~main$tmp_guard0~0_44 0) (= v_~y~0_39 0) (= v_~z$w_buff1_used~0_386 0) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t421~0.base_44| 1)) (= v_~__unbuffered_p2_EBX~0_54 0) (= |v_ULTIMATE.start_main_~#t421~0.offset_30| 0) (= v_~z$r_buff1_thd0~0_148 0) (= 0 |v_#NULL.base_3|) (= v_~z$w_buff0_used~0_680 0) (= v_~z$r_buff1_thd2~0_108 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t421~0.base_44|) |v_ULTIMATE.start_main_~#t421~0.offset_30| 0)) |v_#memory_int_21|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_108, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_86|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_44|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_140|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_82|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_95, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_24|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_54, ULTIMATE.start_main_~#t421~0.base=|v_ULTIMATE.start_main_~#t421~0.base_44|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_386, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_114, ~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_325, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~x~0=v_~x~0_84, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_167, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_103|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_44|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_148, ULTIMATE.start_main_~#t421~0.offset=|v_ULTIMATE.start_main_~#t421~0.offset_30|, ~y~0=v_~y~0_39, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_132, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_680, ~z$w_buff0~0=v_~z$w_buff0~0_229, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_10|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_218, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_93, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_185, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_19|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t423~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t421~0.base, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t422~0.base, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t421~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-07 17:18:12,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L4-->L748: Formula: (and (= ~z$r_buff1_thd2~0_Out1550986411 ~z$r_buff0_thd2~0_In1550986411) (= ~z$r_buff1_thd3~0_Out1550986411 ~z$r_buff0_thd3~0_In1550986411) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411 0)) (= 1 ~z$r_buff0_thd1~0_Out1550986411) (= ~z$r_buff0_thd0~0_In1550986411 ~z$r_buff1_thd0~0_Out1550986411) (= ~x~0_In1550986411 ~__unbuffered_p0_EAX~0_Out1550986411) (= ~z$r_buff0_thd1~0_In1550986411 ~z$r_buff1_thd1~0_Out1550986411)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1550986411, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550986411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1550986411, ~x~0=~x~0_In1550986411, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1550986411} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1550986411, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1550986411, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1550986411, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1550986411, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1550986411, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1550986411, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1550986411, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1550986411, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1550986411, ~x~0=~x~0_In1550986411, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1550986411} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:18:12,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t422~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t422~0.offset_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t422~0.base_13| 4) |v_#length_15|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t422~0.base_13| 1)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t422~0.base_13|) |v_ULTIMATE.start_main_~#t422~0.offset_11| 1))) (not (= |v_ULTIMATE.start_main_~#t422~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t422~0.offset=|v_ULTIMATE.start_main_~#t422~0.offset_11|, ULTIMATE.start_main_~#t422~0.base=|v_ULTIMATE.start_main_~#t422~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t422~0.offset, ULTIMATE.start_main_~#t422~0.base] because there is no mapped edge [2019-12-07 17:18:12,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1115873471 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1115873471 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| |P1Thread1of1ForFork2_#t~ite10_Out1115873471|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| ~z$w_buff1~0_In1115873471) (not .cse0) (not .cse1) .cse2) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1115873471| ~z~0_In1115873471) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1115873471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115873471, ~z$w_buff1~0=~z$w_buff1~0_In1115873471, ~z~0=~z~0_In1115873471} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1115873471|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1115873471|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1115873471, ~z$w_buff1~0=~z$w_buff1~0_In1115873471, ~z~0=~z~0_In1115873471} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 17:18:12,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In814087180 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In814087180 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out814087180|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In814087180 |P1Thread1of1ForFork2_#t~ite11_Out814087180|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In814087180, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In814087180} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In814087180, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out814087180|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In814087180} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 17:18:12,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-288516922 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-288516922 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-288516922 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-288516922 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-288516922| 0)) (and (= ~z$w_buff1_used~0_In-288516922 |P1Thread1of1ForFork2_#t~ite12_Out-288516922|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-288516922, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288516922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288516922, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-288516922} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-288516922, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-288516922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-288516922, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-288516922|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-288516922} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 17:18:12,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L829-1-->L831: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t423~0.base_10|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10| 1)) (= (select |v_#valid_33| |v_ULTIMATE.start_main_~#t423~0.base_10|) 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t423~0.base_10|) |v_ULTIMATE.start_main_~#t423~0.offset_9| 2)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t423~0.base_10| 4) |v_#length_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t423~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t423~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t423~0.base=|v_ULTIMATE.start_main_~#t423~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t423~0.offset=|v_ULTIMATE.start_main_~#t423~0.offset_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t423~0.base, #length, ULTIMATE.start_main_~#t423~0.offset] because there is no mapped edge [2019-12-07 17:18:12,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L793-->L793-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In639891994 256)))) (or (and (not .cse0) (= ~z$w_buff0~0_In639891994 |P2Thread1of1ForFork0_#t~ite21_Out639891994|) (= |P2Thread1of1ForFork0_#t~ite20_In639891994| |P2Thread1of1ForFork0_#t~ite20_Out639891994|)) (and (= ~z$w_buff0~0_In639891994 |P2Thread1of1ForFork0_#t~ite20_Out639891994|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In639891994 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In639891994 256) 0)) (and (= 0 (mod ~z$w_buff1_used~0_In639891994 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In639891994 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite21_Out639891994| |P2Thread1of1ForFork0_#t~ite20_Out639891994|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In639891994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639891994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In639891994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639891994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In639891994, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In639891994|, ~weak$$choice2~0=~weak$$choice2~0_In639891994} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out639891994|, ~z$w_buff0~0=~z$w_buff0~0_In639891994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In639891994, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In639891994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In639891994, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In639891994, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out639891994|, ~weak$$choice2~0=~weak$$choice2~0_In639891994} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 17:18:12,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L794-->L794-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1526973204 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-1526973204| |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (= ~z$w_buff1~0_In-1526973204 |P2Thread1of1ForFork0_#t~ite24_Out-1526973204|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite24_Out-1526973204| |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (= ~z$w_buff1~0_In-1526973204 |P2Thread1of1ForFork0_#t~ite23_Out-1526973204|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1526973204 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In-1526973204 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In-1526973204 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-1526973204 256))))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1526973204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1526973204, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1526973204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526973204, ~z$w_buff1~0=~z$w_buff1~0_In-1526973204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1526973204, ~weak$$choice2~0=~weak$$choice2~0_In-1526973204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1526973204, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1526973204|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1526973204, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1526973204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1526973204, ~z$w_buff1~0=~z$w_buff1~0_In-1526973204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1526973204, ~weak$$choice2~0=~weak$$choice2~0_In-1526973204} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 17:18:12,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L797-->L798: Formula: (and (not (= (mod v_~weak$$choice2~0_37 256) 0)) (= v_~z$r_buff0_thd3~0_160 v_~z$r_buff0_thd3~0_161)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_161, ~weak$$choice2~0=v_~weak$$choice2~0_37} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_6|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_160, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_10|, ~weak$$choice2~0=v_~weak$$choice2~0_37} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 17:18:12,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L800-->L804: Formula: (and (= v_~z~0_54 v_~z$mem_tmp~0_7) (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L804-2-->L804-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In985980656 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In985980656 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out985980656| ~z~0_In985980656)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out985980656| ~z$w_buff1~0_In985980656) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In985980656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985980656, ~z$w_buff1~0=~z$w_buff1~0_In985980656, ~z~0=~z~0_In985980656} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out985980656|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In985980656, ~z$w_buff1_used~0=~z$w_buff1_used~0_In985980656, ~z$w_buff1~0=~z$w_buff1~0_In985980656, ~z~0=~z~0_In985980656} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 17:18:12,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L804-4-->L805: Formula: (= v_~z~0_30 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1448315462 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1448315462 256)))) (or (and (= ~z$w_buff0_used~0_In1448315462 |P2Thread1of1ForFork0_#t~ite40_Out1448315462|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out1448315462|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1448315462, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1448315462} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1448315462, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1448315462|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1448315462} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 17:18:12,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-991978019 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-991978019 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-991978019|)) (and (= ~z$r_buff0_thd2~0_In-991978019 |P1Thread1of1ForFork2_#t~ite13_Out-991978019|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-991978019, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-991978019} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-991978019, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-991978019|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-991978019} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 17:18:12,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-343173316 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-343173316 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-343173316|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-343173316 |P0Thread1of1ForFork1_#t~ite5_Out-343173316|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-343173316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-343173316} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-343173316|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-343173316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-343173316} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 17:18:12,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-840265942 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-840265942 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-840265942 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-840265942 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-840265942 |P0Thread1of1ForFork1_#t~ite6_Out-840265942|)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-840265942|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-840265942, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-840265942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840265942, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-840265942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-840265942, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-840265942|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-840265942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-840265942, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-840265942} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 17:18:12,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-613356867 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-613356867 256))) (.cse2 (= ~z$r_buff0_thd1~0_Out-613356867 ~z$r_buff0_thd1~0_In-613356867))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-613356867 0)) (and .cse2 .cse1) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-613356867, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-613356867} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-613356867, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-613356867|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-613356867} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:18:12,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd1~0_In-1528009730 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1528009730 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1528009730 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1528009730 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1528009730| ~z$r_buff1_thd1~0_In-1528009730) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1528009730| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1528009730, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1528009730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1528009730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1528009730} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1528009730|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1528009730, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1528009730, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1528009730, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1528009730} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 17:18:12,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= v_~z$r_buff1_thd1~0_77 |v_P0Thread1of1ForFork1_#t~ite8_22|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_21|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_77, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:18:12,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-2082526240 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-2082526240 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-2082526240 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-2082526240 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-2082526240|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-2082526240 |P2Thread1of1ForFork0_#t~ite41_Out-2082526240|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2082526240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2082526240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2082526240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2082526240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2082526240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2082526240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2082526240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2082526240, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2082526240|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 17:18:12,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1982293883 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1982293883 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1982293883|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1982293883| ~z$r_buff0_thd3~0_In1982293883) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1982293883, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982293883} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1982293883, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1982293883, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1982293883|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L808-->L808-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-575443488 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-575443488 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-575443488 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-575443488 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-575443488|)) (and (= ~z$r_buff1_thd3~0_In-575443488 |P2Thread1of1ForFork0_#t~ite43_Out-575443488|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-575443488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-575443488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575443488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-575443488} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-575443488|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-575443488, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-575443488, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-575443488, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-575443488} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L808-2-->P2EXIT: Formula: (and (= v_~z$r_buff1_thd3~0_131 |v_P2Thread1of1ForFork0_#t~ite43_24|) (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L772-->L772-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In-785337181 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-785337181 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-785337181 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-785337181 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-785337181| 0)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-785337181| ~z$r_buff1_thd2~0_In-785337181) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-785337181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-785337181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785337181, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-785337181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-785337181, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-785337181, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-785337181, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-785337181|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-785337181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L835-->L837-2: Formula: (and (or (= 0 (mod v_~z$r_buff0_thd0~0_51 256)) (= 0 (mod v_~z$w_buff0_used~0_293 256))) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_51, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_293, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:18:12,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L837-2-->L837-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1848309657 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In1848309657 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1848309657 |ULTIMATE.start_main_#t~ite47_Out1848309657|)) (and (or .cse1 .cse0) (= ~z~0_In1848309657 |ULTIMATE.start_main_#t~ite47_Out1848309657|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1848309657, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1848309657, ~z$w_buff1~0=~z$w_buff1~0_In1848309657, ~z~0=~z~0_In1848309657} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1848309657, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1848309657|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1848309657, ~z$w_buff1~0=~z$w_buff1~0_In1848309657, ~z~0=~z~0_In1848309657} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:18:12,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L837-4-->L838: Formula: (= v_~z~0_20 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_14|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-07 17:18:12,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-620238207 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-620238207 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-620238207 |ULTIMATE.start_main_#t~ite49_Out-620238207|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-620238207|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-620238207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620238207} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-620238207, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-620238207, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-620238207|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:18:12,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L839-->L839-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1108669482 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1108669482 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1108669482 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1108669482 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-1108669482|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-1108669482 |ULTIMATE.start_main_#t~ite50_Out-1108669482|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108669482, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108669482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108669482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108669482} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1108669482|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1108669482, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1108669482, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1108669482, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1108669482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:18:12,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1984533797 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1984533797 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1984533797|)) (and (= ~z$r_buff0_thd0~0_In1984533797 |ULTIMATE.start_main_#t~ite51_Out1984533797|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1984533797, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1984533797} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1984533797, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1984533797|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1984533797} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:18:12,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1423016518 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1423016518 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1423016518 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1423016518 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out1423016518| 0)) (and (= ~z$r_buff1_thd0~0_In1423016518 |ULTIMATE.start_main_#t~ite52_Out1423016518|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1423016518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1423016518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1423016518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1423016518} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1423016518|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1423016518, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1423016518, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1423016518, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:18:12,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L841-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_23 256)) (= v_~z$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_72) (= v_~__unbuffered_p2_EBX~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_34) (= 1 v_~__unbuffered_p2_EAX~0_25))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_72, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, 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 17:18:12,816 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_daa695e3-0b77-42fd-958f-9b5c2eefcf8a/bin/uautomizer/witness.graphml [2019-12-07 17:18:12,817 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:18:12,818 INFO L168 Benchmark]: Toolchain (without parser) took 97635.91 ms. Allocated memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: 7.1 GB). Free memory was 943.4 MB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-12-07 17:18:12,818 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:18:12,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:12,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.02 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 17:18:12,819 INFO L168 Benchmark]: Boogie Preprocessor took 24.86 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 17:18:12,819 INFO L168 Benchmark]: RCFGBuilder took 404.57 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:12,819 INFO L168 Benchmark]: TraceAbstraction took 96712.61 ms. Allocated memory was 1.1 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:18:12,819 INFO L168 Benchmark]: Witness Printer took 70.58 ms. Allocated memory is still 8.2 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:12,821 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.02 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.86 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 404.57 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96712.61 ms. Allocated memory was 1.1 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 70.58 ms. Allocated memory is still 8.2 GB. Free memory was 5.5 GB in the beginning and 5.5 GB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7082 VarBasedMoverChecksPositive, 219 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 89688 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t421, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L829] FCALL, FORK 0 pthread_create(&t422, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L762] 2 x = 1 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L768] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L769] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L831] FCALL, FORK 0 pthread_create(&t423, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 [L785] 3 __unbuffered_p2_EAX = y [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L792] 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) [L793] 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)) [L794] 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)) [L795] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 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)) [L796] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 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)) [L798] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 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)) [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L771] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L806] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L807] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L833] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L838] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L839] 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 [L840] 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 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4084 SDtfs, 4220 SDslu, 6677 SDs, 0 SdLazy, 4098 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 34 SyntacticMatches, 16 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183252occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 64.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 259017 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 694 ConstructedInterpolants, 0 QuantifiedInterpolants, 65436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...