./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 73d062f571b15de43af4978f822ef6801d9be335 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-28 18:19:18,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:19:18,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:19:18,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:19:18,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:19:18,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:19:18,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:19:18,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:19:18,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:19:18,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:19:18,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:19:18,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:19:18,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:19:18,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:19:18,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:19:18,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:19:18,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:19:18,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:19:18,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:19:18,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:19:18,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:19:18,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:19:18,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:19:18,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:19:18,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:19:18,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:19:18,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:19:18,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:19:18,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:19:18,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:19:18,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:19:18,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:19:18,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:19:18,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:19:18,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:19:18,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:19:18,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:19:18,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:19:18,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:19:18,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:19:18,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:19:18,421 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:19:18,436 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:19:18,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:19:18,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:19:18,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:19:18,439 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:19:18,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:19:18,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:19:18,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:19:18,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:19:18,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:19:18,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:19:18,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:19:18,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:19:18,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:19:18,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:19:18,443 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:19:18,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:19:18,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:19:18,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:19:18,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:19:18,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:19:18,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:19:18,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:19:18,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:19:18,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:19:18,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:19:18,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:19:18,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:19:18,448 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:19:18,448 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 73d062f571b15de43af4978f822ef6801d9be335 [2019-11-28 18:19:18,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:19:18,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:19:18,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:19:18,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:19:18,850 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:19:18,851 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-11-28 18:19:18,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6148d3d3/f7a6374e58e04123bd6e18d29d9fda43/FLAG30017dd7e [2019-11-28 18:19:19,549 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:19:19,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-11-28 18:19:19,564 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6148d3d3/f7a6374e58e04123bd6e18d29d9fda43/FLAG30017dd7e [2019-11-28 18:19:19,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6148d3d3/f7a6374e58e04123bd6e18d29d9fda43 [2019-11-28 18:19:19,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:19:19,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:19:19,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:19,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:19:19,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:19:19,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:19" (1/1) ... [2019-11-28 18:19:19,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697dc3f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:19, skipping insertion in model container [2019-11-28 18:19:19,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:19:19" (1/1) ... [2019-11-28 18:19:19,820 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:19:19,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:19:20,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:20,461 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:19:20,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:19:20,602 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:19:20,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20 WrapperNode [2019-11-28 18:19:20,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:19:20,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:20,604 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:19:20,604 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:19:20,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:19:20,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:19:20,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:19:20,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:19:20,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... [2019-11-28 18:19:20,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:19:20,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:19:20,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:19:20,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:19:20,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:19:20,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:19:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:19:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:19:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:19:20,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:19:20,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:19:20,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:19:20,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:19:20,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:19:20,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:19:20,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:19:20,795 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:19:21,446 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:19:21,447 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:19:21,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:21 BoogieIcfgContainer [2019-11-28 18:19:21,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:19:21,450 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:19:21,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:19:21,453 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:19:21,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:19:19" (1/3) ... [2019-11-28 18:19:21,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64212606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:21, skipping insertion in model container [2019-11-28 18:19:21,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:19:20" (2/3) ... [2019-11-28 18:19:21,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64212606 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:19:21, skipping insertion in model container [2019-11-28 18:19:21,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:21" (3/3) ... [2019-11-28 18:19:21,458 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-11-28 18:19:21,469 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:19:21,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:19:21,483 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:19:21,484 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:19:21,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,545 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,552 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,553 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,557 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,558 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,559 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,602 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,603 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,604 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,605 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,609 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,610 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:19:21,633 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:19:21,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:19:21,657 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:19:21,658 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:19:21,658 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:19:21,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:19:21,658 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:19:21,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:19:21,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:19:21,682 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-11-28 18:19:21,685 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:21,800 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:21,800 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:21,817 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:21,839 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-11-28 18:19:21,885 INFO L134 PetriNetUnfolder]: 41/178 cut-off events. [2019-11-28 18:19:21,886 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:19:21,893 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 577 event pairs. 6/141 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:19:21,910 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:19:21,912 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:19:26,814 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:19:26,923 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:19:27,281 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74785 [2019-11-28 18:19:27,281 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-11-28 18:19:27,286 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 85 transitions [2019-11-28 18:19:27,889 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8582 states. [2019-11-28 18:19:27,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8582 states. [2019-11-28 18:19:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:19:27,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:27,905 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:19:27,905 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:27,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash 791214, now seen corresponding path program 1 times [2019-11-28 18:19:27,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:27,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968376968] [2019-11-28 18:19:27,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:28,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968376968] [2019-11-28 18:19:28,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:28,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:19:28,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694350313] [2019-11-28 18:19:28,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:28,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:28,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:28,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:28,166 INFO L87 Difference]: Start difference. First operand 8582 states. Second operand 3 states. [2019-11-28 18:19:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:28,471 INFO L93 Difference]: Finished difference Result 8460 states and 27514 transitions. [2019-11-28 18:19:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:28,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:19:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:28,576 INFO L225 Difference]: With dead ends: 8460 [2019-11-28 18:19:28,576 INFO L226 Difference]: Without dead ends: 7472 [2019-11-28 18:19:28,579 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-11-28 18:19:28,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-11-28 18:19:28,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-11-28 18:19:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-11-28 18:19:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 24214 transitions. [2019-11-28 18:19:29,015 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 24214 transitions. Word has length 3 [2019-11-28 18:19:29,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:29,016 INFO L462 AbstractCegarLoop]: Abstraction has 7472 states and 24214 transitions. [2019-11-28 18:19:29,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 24214 transitions. [2019-11-28 18:19:29,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:19:29,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:29,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:29,021 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:29,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:29,022 INFO L82 PathProgramCache]: Analyzing trace with hash 743461303, now seen corresponding path program 1 times [2019-11-28 18:19:29,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:29,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058357697] [2019-11-28 18:19:29,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:29,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058357697] [2019-11-28 18:19:29,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:29,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:29,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561545161] [2019-11-28 18:19:29,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:29,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:29,128 INFO L87 Difference]: Start difference. First operand 7472 states and 24214 transitions. Second operand 4 states. [2019-11-28 18:19:29,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:29,594 INFO L93 Difference]: Finished difference Result 11704 states and 36249 transitions. [2019-11-28 18:19:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:29,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:19:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:29,796 INFO L225 Difference]: With dead ends: 11704 [2019-11-28 18:19:29,797 INFO L226 Difference]: Without dead ends: 11690 [2019-11-28 18:19:29,798 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-11-28 18:19:29,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11690 states. [2019-11-28 18:19:30,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11690 to 10458. [2019-11-28 18:19:30,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10458 states. [2019-11-28 18:19:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10458 states to 10458 states and 32991 transitions. [2019-11-28 18:19:30,183 INFO L78 Accepts]: Start accepts. Automaton has 10458 states and 32991 transitions. Word has length 11 [2019-11-28 18:19:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:30,184 INFO L462 AbstractCegarLoop]: Abstraction has 10458 states and 32991 transitions. [2019-11-28 18:19:30,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 10458 states and 32991 transitions. [2019-11-28 18:19:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:19:30,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:30,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:30,190 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:30,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:30,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1209900993, now seen corresponding path program 1 times [2019-11-28 18:19:30,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:30,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524919365] [2019-11-28 18:19:30,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:30,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524919365] [2019-11-28 18:19:30,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:30,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:30,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472012840] [2019-11-28 18:19:30,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:30,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:30,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:30,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:30,319 INFO L87 Difference]: Start difference. First operand 10458 states and 32991 transitions. Second operand 5 states. [2019-11-28 18:19:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:30,787 INFO L93 Difference]: Finished difference Result 15000 states and 46671 transitions. [2019-11-28 18:19:30,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:19:30,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:19:30,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:30,843 INFO L225 Difference]: With dead ends: 15000 [2019-11-28 18:19:30,843 INFO L226 Difference]: Without dead ends: 15000 [2019-11-28 18:19:30,844 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-11-28 18:19:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15000 states. [2019-11-28 18:19:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15000 to 11886. [2019-11-28 18:19:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11886 states. [2019-11-28 18:19:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11886 states to 11886 states and 37489 transitions. [2019-11-28 18:19:31,297 INFO L78 Accepts]: Start accepts. Automaton has 11886 states and 37489 transitions. Word has length 14 [2019-11-28 18:19:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:31,299 INFO L462 AbstractCegarLoop]: Abstraction has 11886 states and 37489 transitions. [2019-11-28 18:19:31,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11886 states and 37489 transitions. [2019-11-28 18:19:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:31,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:31,304 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:31,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash 529414606, now seen corresponding path program 1 times [2019-11-28 18:19:31,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:31,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52939349] [2019-11-28 18:19:31,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:31,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52939349] [2019-11-28 18:19:31,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:31,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:31,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697417045] [2019-11-28 18:19:31,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:31,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:31,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:31,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:31,374 INFO L87 Difference]: Start difference. First operand 11886 states and 37489 transitions. Second operand 3 states. [2019-11-28 18:19:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:31,443 INFO L93 Difference]: Finished difference Result 11886 states and 36968 transitions. [2019-11-28 18:19:31,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:31,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:19:31,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:31,482 INFO L225 Difference]: With dead ends: 11886 [2019-11-28 18:19:31,483 INFO L226 Difference]: Without dead ends: 11886 [2019-11-28 18:19:31,483 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-11-28 18:19:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11886 states. [2019-11-28 18:19:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11886 to 11798. [2019-11-28 18:19:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11798 states. [2019-11-28 18:19:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11798 states to 11798 states and 36712 transitions. [2019-11-28 18:19:31,948 INFO L78 Accepts]: Start accepts. Automaton has 11798 states and 36712 transitions. Word has length 16 [2019-11-28 18:19:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:31,948 INFO L462 AbstractCegarLoop]: Abstraction has 11798 states and 36712 transitions. [2019-11-28 18:19:31,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11798 states and 36712 transitions. [2019-11-28 18:19:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:19:31,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:31,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:31,952 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1560475965, now seen corresponding path program 1 times [2019-11-28 18:19:31,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:31,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475024922] [2019-11-28 18:19:31,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475024922] [2019-11-28 18:19:32,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:32,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:32,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088583914] [2019-11-28 18:19:32,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:32,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:32,065 INFO L87 Difference]: Start difference. First operand 11798 states and 36712 transitions. Second operand 4 states. [2019-11-28 18:19:32,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:32,146 INFO L93 Difference]: Finished difference Result 12368 states and 37906 transitions. [2019-11-28 18:19:32,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:32,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:19:32,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:32,174 INFO L225 Difference]: With dead ends: 12368 [2019-11-28 18:19:32,175 INFO L226 Difference]: Without dead ends: 11710 [2019-11-28 18:19:32,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11710 states. [2019-11-28 18:19:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11710 to 11710. [2019-11-28 18:19:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11710 states. [2019-11-28 18:19:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11710 states to 11710 states and 36396 transitions. [2019-11-28 18:19:32,490 INFO L78 Accepts]: Start accepts. Automaton has 11710 states and 36396 transitions. Word has length 16 [2019-11-28 18:19:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:32,490 INFO L462 AbstractCegarLoop]: Abstraction has 11710 states and 36396 transitions. [2019-11-28 18:19:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 11710 states and 36396 transitions. [2019-11-28 18:19:32,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:19:32,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:32,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:32,496 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash -629755283, now seen corresponding path program 1 times [2019-11-28 18:19:32,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:32,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961837403] [2019-11-28 18:19:32,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:32,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961837403] [2019-11-28 18:19:32,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:32,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:32,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992153316] [2019-11-28 18:19:32,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:19:32,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:19:32,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:19:32,606 INFO L87 Difference]: Start difference. First operand 11710 states and 36396 transitions. Second operand 4 states. [2019-11-28 18:19:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:32,642 INFO L93 Difference]: Finished difference Result 2242 states and 5570 transitions. [2019-11-28 18:19:32,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:19:32,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:19:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:32,647 INFO L225 Difference]: With dead ends: 2242 [2019-11-28 18:19:32,647 INFO L226 Difference]: Without dead ends: 1585 [2019-11-28 18:19:32,648 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-11-28 18:19:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2019-11-28 18:19:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1544. [2019-11-28 18:19:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-28 18:19:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 3419 transitions. [2019-11-28 18:19:32,677 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 3419 transitions. Word has length 17 [2019-11-28 18:19:32,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:32,678 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 3419 transitions. [2019-11-28 18:19:32,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:19:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 3419 transitions. [2019-11-28 18:19:32,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:19:32,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:32,681 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:19:32,681 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:32,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:32,682 INFO L82 PathProgramCache]: Analyzing trace with hash 702739982, now seen corresponding path program 1 times [2019-11-28 18:19:32,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:32,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433475505] [2019-11-28 18:19:32,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:32,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433475505] [2019-11-28 18:19:32,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:32,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:32,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125242905] [2019-11-28 18:19:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:19:32,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:19:32,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:19:32,794 INFO L87 Difference]: Start difference. First operand 1544 states and 3419 transitions. Second operand 6 states. [2019-11-28 18:19:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:33,152 INFO L93 Difference]: Finished difference Result 2374 states and 5046 transitions. [2019-11-28 18:19:33,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:19:33,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:19:33,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:33,157 INFO L225 Difference]: With dead ends: 2374 [2019-11-28 18:19:33,157 INFO L226 Difference]: Without dead ends: 2323 [2019-11-28 18:19:33,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:19:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-11-28 18:19:33,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1516. [2019-11-28 18:19:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-11-28 18:19:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 3357 transitions. [2019-11-28 18:19:33,204 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 3357 transitions. Word has length 25 [2019-11-28 18:19:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:33,205 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 3357 transitions. [2019-11-28 18:19:33,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:19:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 3357 transitions. [2019-11-28 18:19:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:19:33,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:33,210 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-11-28 18:19:33,210 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2030434196, now seen corresponding path program 1 times [2019-11-28 18:19:33,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:33,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100133656] [2019-11-28 18:19:33,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:33,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100133656] [2019-11-28 18:19:33,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:33,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:19:33,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710051785] [2019-11-28 18:19:33,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:19:33,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:19:33,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:19:33,365 INFO L87 Difference]: Start difference. First operand 1516 states and 3357 transitions. Second operand 5 states. [2019-11-28 18:19:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:33,408 INFO L93 Difference]: Finished difference Result 816 states and 1791 transitions. [2019-11-28 18:19:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:19:33,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:19:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:33,410 INFO L225 Difference]: With dead ends: 816 [2019-11-28 18:19:33,410 INFO L226 Difference]: Without dead ends: 751 [2019-11-28 18:19:33,411 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-11-28 18:19:33,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-11-28 18:19:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 751. [2019-11-28 18:19:33,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 751 states. [2019-11-28 18:19:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1648 transitions. [2019-11-28 18:19:33,424 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1648 transitions. Word has length 27 [2019-11-28 18:19:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:33,425 INFO L462 AbstractCegarLoop]: Abstraction has 751 states and 1648 transitions. [2019-11-28 18:19:33,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:19:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1648 transitions. [2019-11-28 18:19:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:33,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:33,432 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] [2019-11-28 18:19:33,432 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:33,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:33,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2108814601, now seen corresponding path program 1 times [2019-11-28 18:19:33,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:33,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208544587] [2019-11-28 18:19:33,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:33,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208544587] [2019-11-28 18:19:33,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:33,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:19:33,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859973419] [2019-11-28 18:19:33,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:33,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:33,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:33,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:33,502 INFO L87 Difference]: Start difference. First operand 751 states and 1648 transitions. Second operand 3 states. [2019-11-28 18:19:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:33,538 INFO L93 Difference]: Finished difference Result 1154 states and 2461 transitions. [2019-11-28 18:19:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:33,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:19:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:33,541 INFO L225 Difference]: With dead ends: 1154 [2019-11-28 18:19:33,541 INFO L226 Difference]: Without dead ends: 1154 [2019-11-28 18:19:33,541 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-11-28 18:19:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-11-28 18:19:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 850. [2019-11-28 18:19:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2019-11-28 18:19:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1845 transitions. [2019-11-28 18:19:33,560 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1845 transitions. Word has length 52 [2019-11-28 18:19:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:33,562 INFO L462 AbstractCegarLoop]: Abstraction has 850 states and 1845 transitions. [2019-11-28 18:19:33,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1845 transitions. [2019-11-28 18:19:33,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:19:33,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:33,566 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] [2019-11-28 18:19:33,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:33,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:33,567 INFO L82 PathProgramCache]: Analyzing trace with hash -525709791, now seen corresponding path program 1 times [2019-11-28 18:19:33,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:33,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293312158] [2019-11-28 18:19:33,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:33,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:33,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293312158] [2019-11-28 18:19:33,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:33,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:19:33,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638001925] [2019-11-28 18:19:33,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:19:33,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:19:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:33,662 INFO L87 Difference]: Start difference. First operand 850 states and 1845 transitions. Second operand 3 states. [2019-11-28 18:19:33,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:33,725 INFO L93 Difference]: Finished difference Result 1094 states and 2356 transitions. [2019-11-28 18:19:33,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:19:33,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:19:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:33,727 INFO L225 Difference]: With dead ends: 1094 [2019-11-28 18:19:33,727 INFO L226 Difference]: Without dead ends: 1094 [2019-11-28 18:19:33,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:19:33,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2019-11-28 18:19:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 835. [2019-11-28 18:19:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-11-28 18:19:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1834 transitions. [2019-11-28 18:19:33,742 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1834 transitions. Word has length 52 [2019-11-28 18:19:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:33,743 INFO L462 AbstractCegarLoop]: Abstraction has 835 states and 1834 transitions. [2019-11-28 18:19:33,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:19:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1834 transitions. [2019-11-28 18:19:33,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:33,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:33,746 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] [2019-11-28 18:19:33,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:33,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:33,746 INFO L82 PathProgramCache]: Analyzing trace with hash -802094331, now seen corresponding path program 1 times [2019-11-28 18:19:33,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:33,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321430985] [2019-11-28 18:19:33,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:34,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321430985] [2019-11-28 18:19:34,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:34,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:19:34,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712058922] [2019-11-28 18:19:34,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:19:34,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:34,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:19:34,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:19:34,073 INFO L87 Difference]: Start difference. First operand 835 states and 1834 transitions. Second operand 12 states. [2019-11-28 18:19:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:37,217 INFO L93 Difference]: Finished difference Result 4097 states and 8610 transitions. [2019-11-28 18:19:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-28 18:19:37,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 18:19:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:37,221 INFO L225 Difference]: With dead ends: 4097 [2019-11-28 18:19:37,221 INFO L226 Difference]: Without dead ends: 2036 [2019-11-28 18:19:37,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=304, Invalid=1256, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 18:19:37,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-11-28 18:19:37,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 864. [2019-11-28 18:19:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-28 18:19:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1901 transitions. [2019-11-28 18:19:37,242 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1901 transitions. Word has length 53 [2019-11-28 18:19:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:37,242 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1901 transitions. [2019-11-28 18:19:37,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:19:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1901 transitions. [2019-11-28 18:19:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:37,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:37,245 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] [2019-11-28 18:19:37,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:37,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2018843623, now seen corresponding path program 2 times [2019-11-28 18:19:37,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:37,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630995407] [2019-11-28 18:19:37,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:37,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630995407] [2019-11-28 18:19:37,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:37,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 18:19:37,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72125754] [2019-11-28 18:19:37,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 18:19:37,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:37,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 18:19:37,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:19:37,767 INFO L87 Difference]: Start difference. First operand 864 states and 1901 transitions. Second operand 16 states. [2019-11-28 18:19:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:42,484 INFO L93 Difference]: Finished difference Result 2699 states and 5649 transitions. [2019-11-28 18:19:42,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-28 18:19:42,485 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-28 18:19:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:42,488 INFO L225 Difference]: With dead ends: 2699 [2019-11-28 18:19:42,488 INFO L226 Difference]: Without dead ends: 2152 [2019-11-28 18:19:42,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=266, Invalid=1714, Unknown=0, NotChecked=0, Total=1980 [2019-11-28 18:19:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-11-28 18:19:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 1013. [2019-11-28 18:19:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1013 states. [2019-11-28 18:19:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 2212 transitions. [2019-11-28 18:19:42,510 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 2212 transitions. Word has length 53 [2019-11-28 18:19:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:42,511 INFO L462 AbstractCegarLoop]: Abstraction has 1013 states and 2212 transitions. [2019-11-28 18:19:42,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 18:19:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 2212 transitions. [2019-11-28 18:19:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:42,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:42,515 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] [2019-11-28 18:19:42,515 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:42,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1009016267, now seen corresponding path program 3 times [2019-11-28 18:19:42,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:42,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801875530] [2019-11-28 18:19:42,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:42,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801875530] [2019-11-28 18:19:42,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:42,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:19:42,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77950702] [2019-11-28 18:19:42,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:19:42,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:42,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:19:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:19:42,774 INFO L87 Difference]: Start difference. First operand 1013 states and 2212 transitions. Second operand 10 states. [2019-11-28 18:19:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:45,306 INFO L93 Difference]: Finished difference Result 2468 states and 5374 transitions. [2019-11-28 18:19:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:19:45,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-11-28 18:19:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:45,310 INFO L225 Difference]: With dead ends: 2468 [2019-11-28 18:19:45,311 INFO L226 Difference]: Without dead ends: 2041 [2019-11-28 18:19:45,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:19:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2019-11-28 18:19:45,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1078. [2019-11-28 18:19:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1078 states. [2019-11-28 18:19:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2358 transitions. [2019-11-28 18:19:45,341 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 2358 transitions. Word has length 53 [2019-11-28 18:19:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:45,341 INFO L462 AbstractCegarLoop]: Abstraction has 1078 states and 2358 transitions. [2019-11-28 18:19:45,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:19:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 2358 transitions. [2019-11-28 18:19:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:45,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:45,346 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] [2019-11-28 18:19:45,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:45,347 INFO L82 PathProgramCache]: Analyzing trace with hash -908091791, now seen corresponding path program 4 times [2019-11-28 18:19:45,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:45,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651007377] [2019-11-28 18:19:45,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:45,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651007377] [2019-11-28 18:19:45,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:45,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-28 18:19:45,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041181187] [2019-11-28 18:19:45,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 18:19:45,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:45,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 18:19:45,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:19:45,802 INFO L87 Difference]: Start difference. First operand 1078 states and 2358 transitions. Second operand 16 states. [2019-11-28 18:19:47,905 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-11-28 18:19:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:49,799 INFO L93 Difference]: Finished difference Result 2586 states and 5438 transitions. [2019-11-28 18:19:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 18:19:49,800 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2019-11-28 18:19:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:49,803 INFO L225 Difference]: With dead ends: 2586 [2019-11-28 18:19:49,803 INFO L226 Difference]: Without dead ends: 2220 [2019-11-28 18:19:49,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 18:19:49,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2019-11-28 18:19:49,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 1077. [2019-11-28 18:19:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1077 states. [2019-11-28 18:19:49,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 2355 transitions. [2019-11-28 18:19:49,826 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 2355 transitions. Word has length 53 [2019-11-28 18:19:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:49,827 INFO L462 AbstractCegarLoop]: Abstraction has 1077 states and 2355 transitions. [2019-11-28 18:19:49,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 18:19:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 2355 transitions. [2019-11-28 18:19:49,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:49,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:49,831 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] [2019-11-28 18:19:49,831 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:49,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1164344675, now seen corresponding path program 5 times [2019-11-28 18:19:49,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:49,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949760892] [2019-11-28 18:19:49,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:19:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:19:49,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949760892] [2019-11-28 18:19:49,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:19:49,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:19:49,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586441450] [2019-11-28 18:19:49,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:19:49,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:19:49,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:19:49,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:19:49,943 INFO L87 Difference]: Start difference. First operand 1077 states and 2355 transitions. Second operand 7 states. [2019-11-28 18:19:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:19:50,344 INFO L93 Difference]: Finished difference Result 3051 states and 6496 transitions. [2019-11-28 18:19:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:19:50,344 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:19:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:19:50,348 INFO L225 Difference]: With dead ends: 3051 [2019-11-28 18:19:50,348 INFO L226 Difference]: Without dead ends: 2125 [2019-11-28 18:19:50,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:19:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2019-11-28 18:19:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1007. [2019-11-28 18:19:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-11-28 18:19:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 2194 transitions. [2019-11-28 18:19:50,371 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 2194 transitions. Word has length 53 [2019-11-28 18:19:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:19:50,371 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 2194 transitions. [2019-11-28 18:19:50,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:19:50,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 2194 transitions. [2019-11-28 18:19:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:19:50,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:19:50,375 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] [2019-11-28 18:19:50,375 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:19:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:19:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash -288059161, now seen corresponding path program 6 times [2019-11-28 18:19:50,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:19:50,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263492784] [2019-11-28 18:19:50,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:19:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:19:50,478 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:19:50,479 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:19:50,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1445~0.base_35|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35|) 0) (= v_~y~0_135 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1445~0.base_35| 4)) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35|) |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0))) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35| 1)) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_17|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:50,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_Out-243861391 1) (= ~y$r_buff0_thd1~0_In-243861391 ~y$r_buff1_thd1~0_Out-243861391) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391 0)) (= ~y$r_buff1_thd0~0_Out-243861391 ~y$r_buff0_thd0~0_In-243861391) (= ~y$r_buff1_thd2~0_Out-243861391 ~y$r_buff0_thd2~0_In-243861391) (= ~x~0_Out-243861391 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243861391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-243861391, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-243861391, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243861391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391, ~x~0=~x~0_Out-243861391, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-243861391} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:50,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-11-28 18:19:50,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-826277999 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-826277999 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-826277999| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-826277999| ~y$w_buff0_used~0_In-826277999) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826277999} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-826277999|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826277999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:50,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1728887399 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1728887399| ~y$w_buff0~0_In1728887399) (= |P1Thread1of1ForFork1_#t~ite14_Out1728887399| |P1Thread1of1ForFork1_#t~ite15_Out1728887399|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1728887399 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1728887399 256)) (and (= (mod ~y$r_buff1_thd2~0_In1728887399 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1728887399 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1728887399| ~y$w_buff0~0_In1728887399) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1728887399| |P1Thread1of1ForFork1_#t~ite14_Out1728887399|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1728887399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1728887399, ~y$w_buff0~0=~y$w_buff0~0_In1728887399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1728887399, ~weak$$choice2~0=~weak$$choice2~0_In1728887399, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1728887399|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1728887399} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1728887399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1728887399, ~y$w_buff0~0=~y$w_buff0~0_In1728887399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1728887399, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1728887399|, ~weak$$choice2~0=~weak$$choice2~0_In1728887399, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1728887399|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1728887399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:50,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1570171374 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1570171374| ~y$w_buff0_used~0_In-1570171374) (= |P1Thread1of1ForFork1_#t~ite20_Out-1570171374| |P1Thread1of1ForFork1_#t~ite21_Out-1570171374|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1570171374 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1570171374 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1570171374 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1570171374 256) 0) .cse1)))) (and (not .cse0) (= ~y$w_buff0_used~0_In-1570171374 |P1Thread1of1ForFork1_#t~ite21_Out-1570171374|) (= |P1Thread1of1ForFork1_#t~ite20_In-1570171374| |P1Thread1of1ForFork1_#t~ite20_Out-1570171374|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1570171374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1570171374, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1570171374|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1570171374, ~weak$$choice2~0=~weak$$choice2~0_In-1570171374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1570171374} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1570171374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1570171374, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1570171374|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1570171374, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1570171374|, ~weak$$choice2~0=~weak$$choice2~0_In-1570171374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1570171374} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:50,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:50,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1322696034 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1322696034| ~y$r_buff1_thd2~0_In1322696034) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1322696034 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1322696034 256))) (= 0 (mod ~y$w_buff0_used~0_In1322696034 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1322696034 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite30_Out1322696034| |P1Thread1of1ForFork1_#t~ite29_Out1322696034|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In1322696034| |P1Thread1of1ForFork1_#t~ite29_Out1322696034|) (= |P1Thread1of1ForFork1_#t~ite30_Out1322696034| ~y$r_buff1_thd2~0_In1322696034) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322696034, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1322696034, ~weak$$choice2~0=~weak$$choice2~0_In1322696034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322696034} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322696034, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1322696034|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1322696034, ~weak$$choice2~0=~weak$$choice2~0_In1322696034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322696034} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:50,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:50,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In39746591 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out39746591| |P1Thread1of1ForFork1_#t~ite32_Out39746591|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In39746591 256)))) (or (and (= ~y~0_In39746591 |P1Thread1of1ForFork1_#t~ite32_Out39746591|) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= ~y$w_buff1~0_In39746591 |P1Thread1of1ForFork1_#t~ite32_Out39746591|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In39746591, ~y$w_buff1~0=~y$w_buff1~0_In39746591, ~y~0=~y~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In39746591, ~y$w_buff1~0=~y$w_buff1~0_In39746591, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out39746591|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out39746591|, ~y~0=~y~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:50,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1716712056 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1716712056 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1716712056 |P1Thread1of1ForFork1_#t~ite34_Out-1716712056|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1716712056|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716712056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1716712056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716712056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1716712056, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1716712056|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:50,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1161940770 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1161940770 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1161940770 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1161940770 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1161940770| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1161940770| ~y$w_buff1_used~0_In1161940770) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1161940770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1161940770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1161940770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1161940770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1161940770, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1161940770|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:50,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1084712709 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1084712709 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1084712709| ~y$r_buff0_thd2~0_In-1084712709)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1084712709| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084712709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084712709, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1084712709|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1253032305 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1253032305 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1253032305 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1253032305 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1253032305|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1253032305 |P1Thread1of1ForFork1_#t~ite37_Out-1253032305|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1253032305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1253032305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253032305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1253032305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1253032305, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1253032305|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253032305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:50,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:50,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2040403554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2040403554 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2040403554 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In2040403554 256)))) (or (and (= ~y$w_buff1_used~0_In2040403554 |P0Thread1of1ForFork0_#t~ite6_Out2040403554|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2040403554| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2040403554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2040403554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040403554} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2040403554|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2040403554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2040403554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040403554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:50,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-27908725 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out-27908725 ~y$r_buff0_thd1~0_In-27908725)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-27908725 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-27908725)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-27908725} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-27908725|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-27908725} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:50,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-527558954 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-527558954 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-527558954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-527558954 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-527558954 |P0Thread1of1ForFork0_#t~ite8_Out-527558954|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-527558954|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-527558954|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:50,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:50,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:50,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1845557652 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1845557652 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite40_Out1845557652| |ULTIMATE.start_main_#t~ite41_Out1845557652|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1845557652| ~y$w_buff1~0_In1845557652) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out1845557652| ~y~0_In1845557652) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1845557652, ~y~0=~y~0_In1845557652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1845557652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845557652} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1845557652|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1845557652|, ~y$w_buff1~0=~y$w_buff1~0_In1845557652, ~y~0=~y~0_In1845557652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1845557652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845557652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:50,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In128300786 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In128300786 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out128300786| 0)) (and (= ~y$w_buff0_used~0_In128300786 |ULTIMATE.start_main_#t~ite42_Out128300786|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out128300786|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:50,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1185359778 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1185359778 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1185359778 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1185359778 256)))) (or (and (= ~y$w_buff1_used~0_In-1185359778 |ULTIMATE.start_main_#t~ite43_Out-1185359778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1185359778|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1185359778, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1185359778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185359778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1185359778, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1185359778|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1185359778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185359778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In302910712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In302910712 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out302910712| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In302910712 |ULTIMATE.start_main_#t~ite44_Out302910712|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In302910712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In302910712, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out302910712|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:50,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In423785213 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In423785213 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In423785213 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In423785213 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In423785213 |ULTIMATE.start_main_#t~ite45_Out423785213|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out423785213|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out423785213|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:50,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:50,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:19:50 BasicIcfg [2019-11-28 18:19:50,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:19:50,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:19:50,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:19:50,564 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:19:50,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:19:21" (3/4) ... [2019-11-28 18:19:50,568 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:19:50,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff1_thd2~0_239) (= 0 v_~y$flush_delayed~0_31) (= v_~main$tmp_guard0~0_30 0) (= v_~x~0_98 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1445~0.base_35|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35|) 0) (= v_~y~0_135 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1445~0.base_35| 4)) (= |v_#NULL.offset_3| 0) (= v_~y$mem_tmp~0_22 0) (= v_~y$r_buff1_thd1~0_110 0) (= v_~y$r_buff0_thd1~0_187 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~y$w_buff0_used~0_704 0) (= v_~main$tmp_guard1~0_45 0) (= v_~y$r_buff0_thd0~0_135 0) (= v_~y$r_buff1_thd0~0_153 0) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1445~0.base_35|) |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0))) (= 0 v_~__unbuffered_cnt~0_51) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~y$r_buff0_thd2~0_327) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t1445~0.base_35| 1)) (= 0 v_~weak$$choice0~0_20) (= v_~y$w_buff1_used~0_445 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_107 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$w_buff1~0_286 0) (= |v_ULTIMATE.start_main_~#t1445~0.offset_27| 0) (= 0 v_~y$w_buff0~0_484))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_704, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_78|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_47|, ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_17|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_110, ~y$mem_tmp~0=v_~y$mem_tmp~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ~y$w_buff0~0=v_~y$w_buff0~0_484, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_187, ~y$flush_delayed~0=v_~y$flush_delayed~0_31, #length=|v_#length_17|, ~y~0=v_~y~0_135, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_15|, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_239, ~weak$$choice0~0=v_~weak$$choice0~0_20, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_102|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_77|, ~y$w_buff1~0=v_~y$w_buff1~0_286, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #valid=|v_#valid_57|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_327, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t1445~0.base=|v_ULTIMATE.start_main_~#t1445~0.base_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ULTIMATE.start_main_~#t1445~0.offset=|v_ULTIMATE.start_main_~#t1445~0.offset_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~x~0=v_~x~0_98, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_445} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1446~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1446~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1445~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1445~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:19:50,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L4-->L736: Formula: (and (= ~y$r_buff0_thd1~0_Out-243861391 1) (= ~y$r_buff0_thd1~0_In-243861391 ~y$r_buff1_thd1~0_Out-243861391) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391 0)) (= ~y$r_buff1_thd0~0_Out-243861391 ~y$r_buff0_thd0~0_In-243861391) (= ~y$r_buff1_thd2~0_Out-243861391 ~y$r_buff0_thd2~0_In-243861391) (= ~x~0_Out-243861391 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243861391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-243861391, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-243861391, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-243861391, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-243861391, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-243861391, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-243861391, ~x~0=~x~0_Out-243861391, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-243861391} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:19:50,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L792-1-->L794: Formula: (and (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11| 1) |v_#valid_23|) (= |v_ULTIMATE.start_main_~#t1446~0.offset_10| 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1446~0.base_11| 4) |v_#length_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) |v_ULTIMATE.start_main_~#t1446~0.offset_10| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t1446~0.base_11|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1446~0.base_11|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1446~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1446~0.base=|v_ULTIMATE.start_main_~#t1446~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1446~0.offset=|v_ULTIMATE.start_main_~#t1446~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1446~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1446~0.offset] because there is no mapped edge [2019-11-28 18:19:50,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-826277999 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-826277999 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-826277999| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-826277999| ~y$w_buff0_used~0_In-826277999) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826277999} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-826277999|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-826277999, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-826277999} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:19:50,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1728887399 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1728887399| ~y$w_buff0~0_In1728887399) (= |P1Thread1of1ForFork1_#t~ite14_Out1728887399| |P1Thread1of1ForFork1_#t~ite15_Out1728887399|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1728887399 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1728887399 256)) (and (= (mod ~y$r_buff1_thd2~0_In1728887399 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1728887399 256) 0))))) (and (= |P1Thread1of1ForFork1_#t~ite15_Out1728887399| ~y$w_buff0~0_In1728887399) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1728887399| |P1Thread1of1ForFork1_#t~ite14_Out1728887399|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1728887399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1728887399, ~y$w_buff0~0=~y$w_buff0~0_In1728887399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1728887399, ~weak$$choice2~0=~weak$$choice2~0_In1728887399, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1728887399|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1728887399} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1728887399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1728887399, ~y$w_buff0~0=~y$w_buff0~0_In1728887399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1728887399, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1728887399|, ~weak$$choice2~0=~weak$$choice2~0_In1728887399, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1728887399|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1728887399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:19:50,575 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L760-->L760-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1570171374 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1570171374| ~y$w_buff0_used~0_In-1570171374) (= |P1Thread1of1ForFork1_#t~ite20_Out-1570171374| |P1Thread1of1ForFork1_#t~ite21_Out-1570171374|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1570171374 256) 0))) (or (= (mod ~y$w_buff0_used~0_In-1570171374 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-1570171374 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-1570171374 256) 0) .cse1)))) (and (not .cse0) (= ~y$w_buff0_used~0_In-1570171374 |P1Thread1of1ForFork1_#t~ite21_Out-1570171374|) (= |P1Thread1of1ForFork1_#t~ite20_In-1570171374| |P1Thread1of1ForFork1_#t~ite20_Out-1570171374|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1570171374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1570171374, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1570171374|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1570171374, ~weak$$choice2~0=~weak$$choice2~0_In-1570171374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1570171374} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1570171374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1570171374, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1570171374|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1570171374, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1570171374|, ~weak$$choice2~0=~weak$$choice2~0_In-1570171374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1570171374} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:19:50,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff0_thd2~0_67)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_67, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_5|, ~weak$$choice2~0=v_~weak$$choice2~0_18, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_11|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_5|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:19:50,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1322696034 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out1322696034| ~y$r_buff1_thd2~0_In1322696034) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1322696034 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1322696034 256))) (= 0 (mod ~y$w_buff0_used~0_In1322696034 256)) (and (= 0 (mod ~y$w_buff1_used~0_In1322696034 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite30_Out1322696034| |P1Thread1of1ForFork1_#t~ite29_Out1322696034|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In1322696034| |P1Thread1of1ForFork1_#t~ite29_Out1322696034|) (= |P1Thread1of1ForFork1_#t~ite30_Out1322696034| ~y$r_buff1_thd2~0_In1322696034) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322696034, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1322696034, ~weak$$choice2~0=~weak$$choice2~0_In1322696034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322696034} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1322696034, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1322696034|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1322696034|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1322696034, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1322696034, ~weak$$choice2~0=~weak$$choice2~0_In1322696034, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1322696034} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:19:50,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_24 v_~y$mem_tmp~0_6) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~y~0=v_~y~0_24} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:19:50,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In39746591 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out39746591| |P1Thread1of1ForFork1_#t~ite32_Out39746591|)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In39746591 256)))) (or (and (= ~y~0_In39746591 |P1Thread1of1ForFork1_#t~ite32_Out39746591|) (or .cse0 .cse1) .cse2) (and (not .cse1) .cse2 (= ~y$w_buff1~0_In39746591 |P1Thread1of1ForFork1_#t~ite32_Out39746591|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In39746591, ~y$w_buff1~0=~y$w_buff1~0_In39746591, ~y~0=~y~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In39746591, ~y$w_buff1~0=~y$w_buff1~0_In39746591, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out39746591|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out39746591|, ~y~0=~y~0_In39746591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In39746591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:19:50,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1716712056 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1716712056 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1716712056 |P1Thread1of1ForFork1_#t~ite34_Out-1716712056|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1716712056|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716712056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1716712056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1716712056, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1716712056, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1716712056|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:19:50,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1161940770 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1161940770 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1161940770 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1161940770 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1161940770| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out1161940770| ~y$w_buff1_used~0_In1161940770) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1161940770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1161940770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1161940770, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1161940770, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1161940770, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1161940770, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1161940770|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1161940770} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:19:50,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1084712709 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1084712709 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1084712709| ~y$r_buff0_thd2~0_In-1084712709)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1084712709| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084712709} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084712709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1084712709, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1084712709|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:19:50,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1253032305 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1253032305 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1253032305 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1253032305 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1253032305|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1253032305 |P1Thread1of1ForFork1_#t~ite37_Out-1253032305|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1253032305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1253032305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253032305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1253032305, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1253032305, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1253032305, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1253032305|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1253032305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:50,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~y$r_buff1_thd2~0_151 |v_P1Thread1of1ForFork1_#t~ite37_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_151, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_29|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:19:50,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2040403554 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2040403554 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2040403554 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In2040403554 256)))) (or (and (= ~y$w_buff1_used~0_In2040403554 |P0Thread1of1ForFork0_#t~ite6_Out2040403554|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2040403554| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2040403554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2040403554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040403554} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2040403554|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2040403554, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2040403554, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2040403554, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2040403554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:19:50,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-27908725 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out-27908725 ~y$r_buff0_thd1~0_In-27908725)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-27908725 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-27908725)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-27908725} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-27908725, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-27908725|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-27908725} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:19:50,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-527558954 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-527558954 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-527558954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-527558954 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-527558954 |P0Thread1of1ForFork0_#t~ite8_Out-527558954|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-527558954|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-527558954, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-527558954, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-527558954|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-527558954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-527558954} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:19:50,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_32 (+ v_~__unbuffered_cnt~0_33 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_26|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:19:50,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$w_buff0_used~0_276 256)) (= (mod v_~y$r_buff0_thd0~0_50 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_276, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:19:50,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1845557652 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1845557652 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite40_Out1845557652| |ULTIMATE.start_main_#t~ite41_Out1845557652|))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1845557652| ~y$w_buff1~0_In1845557652) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite40_Out1845557652| ~y~0_In1845557652) (or .cse0 .cse2) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1845557652, ~y~0=~y~0_In1845557652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1845557652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845557652} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1845557652|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1845557652|, ~y$w_buff1~0=~y$w_buff1~0_In1845557652, ~y~0=~y~0_In1845557652, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1845557652, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1845557652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:19:50,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In128300786 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In128300786 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out128300786| 0)) (and (= ~y$w_buff0_used~0_In128300786 |ULTIMATE.start_main_#t~ite42_Out128300786|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In128300786, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In128300786, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out128300786|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:19:50,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1185359778 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1185359778 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1185359778 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1185359778 256)))) (or (and (= ~y$w_buff1_used~0_In-1185359778 |ULTIMATE.start_main_#t~ite43_Out-1185359778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1185359778|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1185359778, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1185359778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185359778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1185359778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1185359778, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1185359778|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1185359778, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1185359778} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:19:50,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In302910712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In302910712 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out302910712| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In302910712 |ULTIMATE.start_main_#t~ite44_Out302910712|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In302910712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In302910712, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In302910712, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out302910712|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:19:50,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In423785213 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In423785213 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In423785213 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In423785213 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In423785213 |ULTIMATE.start_main_#t~ite45_Out423785213|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out423785213|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In423785213, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In423785213, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In423785213, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out423785213|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In423785213} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:19:50,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~x~0_61 2))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~y$r_buff1_thd0~0_104 |v_ULTIMATE.start_main_#t~ite45_33|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~x~0=v_~x~0_61, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x~0=v_~x~0_61, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_104, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:19:50,661 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:19:50,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:19:50,666 INFO L168 Benchmark]: Toolchain (without parser) took 30864.23 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 759.2 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -312.0 MB). Peak memory consumption was 447.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,667 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:19:50,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,669 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.50 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,671 INFO L168 Benchmark]: Boogie Preprocessor took 48.80 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-11-28 18:19:50,672 INFO L168 Benchmark]: RCFGBuilder took 734.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,672 INFO L168 Benchmark]: TraceAbstraction took 29113.77 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 652.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.2 MB). Peak memory consumption was 394.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,674 INFO L168 Benchmark]: Witness Printer took 100.58 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:19:50,682 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.82 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 800.12 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -122.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.50 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.80 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 734.00 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29113.77 ms. Allocated memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: 652.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -258.2 MB). Peak memory consumption was 394.0 MB. Max. memory is 11.5 GB. * Witness Printer took 100.58 ms. Allocated memory is still 1.8 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 146 ProgramPointsBefore, 75 ProgramPointsAfterwards, 180 TransitionsBefore, 85 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 28 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4902 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 236 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74785 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2815 SDtfs, 3354 SDslu, 11045 SDs, 0 SdLazy, 12517 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11886occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 11380 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 551 NumberOfCodeBlocks, 551 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 483 ConstructedInterpolants, 0 QuantifiedInterpolants, 154166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...