./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix031_tso.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/mix031_tso.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 7b5d7369926368b2e5be55a7d8f704223c826e06 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11:39,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:11:39,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:11:39,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:11:39,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:11:39,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:11:39,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:11:39,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:11:39,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:11:39,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:11:39,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:11:39,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:11:39,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:11:39,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:11:39,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:11:39,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:11:39,414 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:11:39,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:11:39,417 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:11:39,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:11:39,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:11:39,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:11:39,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:11:39,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:11:39,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:11:39,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:11:39,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:11:39,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:11:39,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:11:39,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:11:39,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:11:39,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:11:39,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:11:39,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:11:39,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:11:39,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:11:39,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:11:39,434 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:11:39,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:11:39,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:11:39,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:11:39,437 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:11:39,457 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:11:39,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:11:39,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:11:39,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:11:39,465 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:11:39,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:11:39,465 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:11:39,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:11:39,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:11:39,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:11:39,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:11:39,468 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:11:39,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:11:39,469 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:11:39,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:11:39,469 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:11:39,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:11:39,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:11:39,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:11:39,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:11:39,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:11:39,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:11:39,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:11:39,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:11:39,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:11:39,472 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:11:39,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:11:39,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:11:39,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:11:39,474 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 -> 7b5d7369926368b2e5be55a7d8f704223c826e06 [2019-11-28 18:11:39,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:11:39,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:11:39,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:11:39,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:11:39,792 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:11:39,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-11-28 18:11:39,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad43e55/5237027ad0bd4a6281dd35a7ad61505b/FLAG998e4ceab [2019-11-28 18:11:40,466 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:11:40,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix031_tso.oepc.i [2019-11-28 18:11:40,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad43e55/5237027ad0bd4a6281dd35a7ad61505b/FLAG998e4ceab [2019-11-28 18:11:40,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fad43e55/5237027ad0bd4a6281dd35a7ad61505b [2019-11-28 18:11:40,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:11:40,698 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:11:40,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:40,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:11:40,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:11:40,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:40" (1/1) ... [2019-11-28 18:11:40,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a736f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:40, skipping insertion in model container [2019-11-28 18:11:40,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:11:40" (1/1) ... [2019-11-28 18:11:40,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:11:40,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:11:41,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:41,351 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:11:41,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:11:41,522 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:11:41,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41 WrapperNode [2019-11-28 18:11:41,523 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:11:41,524 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:41,524 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:11:41,524 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:11:41,533 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:11:41" (1/1) ... [2019-11-28 18:11:41,554 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:11:41" (1/1) ... [2019-11-28 18:11:41,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:11:41,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:11:41,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:11:41,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:11:41,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (1/1) ... [2019-11-28 18:11:41,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:11:41,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:11:41,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:11:41,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:11:41,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (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:11:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:11:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:11:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:11:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:11:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:11:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:11:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:11:41,714 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:11:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:11:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:11:41,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:11:41,717 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:11:42,443 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:11:42,444 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:11:42,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:42 BoogieIcfgContainer [2019-11-28 18:11:42,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:11:42,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:11:42,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:11:42,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:11:42,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:11:40" (1/3) ... [2019-11-28 18:11:42,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7582e57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:42, skipping insertion in model container [2019-11-28 18:11:42,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:11:41" (2/3) ... [2019-11-28 18:11:42,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7582e57b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:11:42, skipping insertion in model container [2019-11-28 18:11:42,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:42" (3/3) ... [2019-11-28 18:11:42,453 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc.i [2019-11-28 18:11:42,464 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:11:42,465 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:11:42,472 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:11:42,472 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:11:42,510 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,511 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,511 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,514 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,515 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,516 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,517 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,518 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,519 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,522 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,532 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,533 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,549 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:11:42,567 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:11:42,588 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:11:42,589 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:11:42,589 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:11:42,589 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:11:42,589 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:11:42,589 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:11:42,589 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:11:42,590 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:11:42,607 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 185 transitions [2019-11-28 18:11:42,609 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-11-28 18:11:42,694 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-11-28 18:11:42,695 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:42,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:11:42,734 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 185 transitions [2019-11-28 18:11:42,780 INFO L134 PetriNetUnfolder]: 41/183 cut-off events. [2019-11-28 18:11:42,780 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:11:42,790 INFO L76 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 183 events. 41/183 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 575 event pairs. 6/146 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:11:42,807 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:11:42,808 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:11:48,048 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-11-28 18:11:48,159 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 18:11:48,187 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55357 [2019-11-28 18:11:48,188 INFO L214 etLargeBlockEncoding]: Total number of compositions: 107 [2019-11-28 18:11:48,192 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 89 transitions [2019-11-28 18:11:48,784 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:11:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:11:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:11:48,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:48,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:11:48,801 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:11:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 801135, now seen corresponding path program 1 times [2019-11-28 18:11:48,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:48,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350037335] [2019-11-28 18:11:48,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:49,169 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:11:49,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350037335] [2019-11-28 18:11:49,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:49,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:11:49,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777072774] [2019-11-28 18:11:49,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:49,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:49,208 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:11:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:49,481 INFO L93 Difference]: Finished difference Result 8472 states and 28002 transitions. [2019-11-28 18:11:49,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:49,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:11:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:49,576 INFO L225 Difference]: With dead ends: 8472 [2019-11-28 18:11:49,577 INFO L226 Difference]: Without dead ends: 7980 [2019-11-28 18:11:49,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:11:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2019-11-28 18:11:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 7980. [2019-11-28 18:11:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7980 states. [2019-11-28 18:11:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7980 states to 7980 states and 26329 transitions. [2019-11-28 18:11:50,043 INFO L78 Accepts]: Start accepts. Automaton has 7980 states and 26329 transitions. Word has length 3 [2019-11-28 18:11:50,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:50,044 INFO L462 AbstractCegarLoop]: Abstraction has 7980 states and 26329 transitions. [2019-11-28 18:11:50,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 7980 states and 26329 transitions. [2019-11-28 18:11:50,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:11:50,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:50,052 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:50,053 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:11:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:50,054 INFO L82 PathProgramCache]: Analyzing trace with hash -337363797, now seen corresponding path program 1 times [2019-11-28 18:11:50,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:50,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490828463] [2019-11-28 18:11:50,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:50,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490828463] [2019-11-28 18:11:50,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:50,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:50,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168886081] [2019-11-28 18:11:50,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:50,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:50,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:50,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:50,210 INFO L87 Difference]: Start difference. First operand 7980 states and 26329 transitions. Second operand 4 states. [2019-11-28 18:11:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:50,842 INFO L93 Difference]: Finished difference Result 12172 states and 38421 transitions. [2019-11-28 18:11:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:50,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:11:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:50,942 INFO L225 Difference]: With dead ends: 12172 [2019-11-28 18:11:50,942 INFO L226 Difference]: Without dead ends: 12165 [2019-11-28 18:11:50,943 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:11:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-11-28 18:11:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 10976. [2019-11-28 18:11:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10976 states. [2019-11-28 18:11:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10976 states to 10976 states and 35289 transitions. [2019-11-28 18:11:51,476 INFO L78 Accepts]: Start accepts. Automaton has 10976 states and 35289 transitions. Word has length 11 [2019-11-28 18:11:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:51,476 INFO L462 AbstractCegarLoop]: Abstraction has 10976 states and 35289 transitions. [2019-11-28 18:11:51,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 10976 states and 35289 transitions. [2019-11-28 18:11:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:51,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:51,483 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:51,483 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:11:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:51,484 INFO L82 PathProgramCache]: Analyzing trace with hash 254708639, now seen corresponding path program 1 times [2019-11-28 18:11:51,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:51,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439369954] [2019-11-28 18:11:51,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:51,530 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:11:51,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439369954] [2019-11-28 18:11:51,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:51,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:51,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349058384] [2019-11-28 18:11:51,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:51,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:51,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:51,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:51,533 INFO L87 Difference]: Start difference. First operand 10976 states and 35289 transitions. Second operand 3 states. [2019-11-28 18:11:51,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:51,832 INFO L93 Difference]: Finished difference Result 16162 states and 51860 transitions. [2019-11-28 18:11:51,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:51,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:11:51,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:51,902 INFO L225 Difference]: With dead ends: 16162 [2019-11-28 18:11:51,902 INFO L226 Difference]: Without dead ends: 16162 [2019-11-28 18:11:51,903 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:11:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16162 states. [2019-11-28 18:11:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16162 to 12780. [2019-11-28 18:11:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12780 states. [2019-11-28 18:11:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12780 states to 12780 states and 41531 transitions. [2019-11-28 18:11:52,433 INFO L78 Accepts]: Start accepts. Automaton has 12780 states and 41531 transitions. Word has length 14 [2019-11-28 18:11:52,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:52,435 INFO L462 AbstractCegarLoop]: Abstraction has 12780 states and 41531 transitions. [2019-11-28 18:11:52,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:52,435 INFO L276 IsEmpty]: Start isEmpty. Operand 12780 states and 41531 transitions. [2019-11-28 18:11:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:52,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:52,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:52,439 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:11:52,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:52,440 INFO L82 PathProgramCache]: Analyzing trace with hash 254810970, now seen corresponding path program 1 times [2019-11-28 18:11:52,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:52,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660683663] [2019-11-28 18:11:52,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:52,492 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:11:52,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660683663] [2019-11-28 18:11:52,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:52,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:52,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857389094] [2019-11-28 18:11:52,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:52,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:52,495 INFO L87 Difference]: Start difference. First operand 12780 states and 41531 transitions. Second operand 4 states. [2019-11-28 18:11:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:52,756 INFO L93 Difference]: Finished difference Result 15429 states and 49294 transitions. [2019-11-28 18:11:52,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:52,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:52,816 INFO L225 Difference]: With dead ends: 15429 [2019-11-28 18:11:52,816 INFO L226 Difference]: Without dead ends: 15429 [2019-11-28 18:11:52,817 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:11:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-11-28 18:11:53,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14033. [2019-11-28 18:11:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14033 states. [2019-11-28 18:11:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14033 states to 14033 states and 45307 transitions. [2019-11-28 18:11:53,416 INFO L78 Accepts]: Start accepts. Automaton has 14033 states and 45307 transitions. Word has length 14 [2019-11-28 18:11:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:53,417 INFO L462 AbstractCegarLoop]: Abstraction has 14033 states and 45307 transitions. [2019-11-28 18:11:53,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14033 states and 45307 transitions. [2019-11-28 18:11:53,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:11:53,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:53,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:53,422 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:11:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 32652836, now seen corresponding path program 1 times [2019-11-28 18:11:53,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:53,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184359277] [2019-11-28 18:11:53,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:53,515 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:11:53,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184359277] [2019-11-28 18:11:53,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:53,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:53,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418631797] [2019-11-28 18:11:53,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:53,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:53,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:53,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:53,518 INFO L87 Difference]: Start difference. First operand 14033 states and 45307 transitions. Second operand 4 states. [2019-11-28 18:11:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:53,760 INFO L93 Difference]: Finished difference Result 16676 states and 53317 transitions. [2019-11-28 18:11:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:11:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:53,828 INFO L225 Difference]: With dead ends: 16676 [2019-11-28 18:11:53,829 INFO L226 Difference]: Without dead ends: 16676 [2019-11-28 18:11:53,829 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:11:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16676 states. [2019-11-28 18:11:54,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16676 to 14306. [2019-11-28 18:11:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14306 states. [2019-11-28 18:11:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14306 states to 14306 states and 46219 transitions. [2019-11-28 18:11:54,293 INFO L78 Accepts]: Start accepts. Automaton has 14306 states and 46219 transitions. Word has length 14 [2019-11-28 18:11:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:54,293 INFO L462 AbstractCegarLoop]: Abstraction has 14306 states and 46219 transitions. [2019-11-28 18:11:54,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:54,294 INFO L276 IsEmpty]: Start isEmpty. Operand 14306 states and 46219 transitions. [2019-11-28 18:11:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:54,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:54,298 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:11:54,299 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:11:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:54,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1305033028, now seen corresponding path program 1 times [2019-11-28 18:11:54,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:54,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130707920] [2019-11-28 18:11:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:54,373 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:11:54,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130707920] [2019-11-28 18:11:54,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:54,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682741434] [2019-11-28 18:11:54,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:54,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:54,377 INFO L87 Difference]: Start difference. First operand 14306 states and 46219 transitions. Second operand 3 states. [2019-11-28 18:11:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:54,447 INFO L93 Difference]: Finished difference Result 13528 states and 43047 transitions. [2019-11-28 18:11:54,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:54,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:54,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:54,486 INFO L225 Difference]: With dead ends: 13528 [2019-11-28 18:11:54,486 INFO L226 Difference]: Without dead ends: 13528 [2019-11-28 18:11:54,487 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:11:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13528 states. [2019-11-28 18:11:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13528 to 13448. [2019-11-28 18:11:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13448 states. [2019-11-28 18:11:54,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13448 states to 13448 states and 42815 transitions. [2019-11-28 18:11:54,920 INFO L78 Accepts]: Start accepts. Automaton has 13448 states and 42815 transitions. Word has length 16 [2019-11-28 18:11:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:54,920 INFO L462 AbstractCegarLoop]: Abstraction has 13448 states and 42815 transitions. [2019-11-28 18:11:54,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 13448 states and 42815 transitions. [2019-11-28 18:11:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:11:54,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:54,926 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:11:54,926 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:11:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:54,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1252676989, now seen corresponding path program 1 times [2019-11-28 18:11:54,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:54,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044864123] [2019-11-28 18:11:54,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:55,214 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:11:55,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044864123] [2019-11-28 18:11:55,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:55,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:55,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746660838] [2019-11-28 18:11:55,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:55,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:55,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:55,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:55,218 INFO L87 Difference]: Start difference. First operand 13448 states and 42815 transitions. Second operand 3 states. [2019-11-28 18:11:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:55,230 INFO L93 Difference]: Finished difference Result 1752 states and 4007 transitions. [2019-11-28 18:11:55,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:55,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:11:55,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:55,236 INFO L225 Difference]: With dead ends: 1752 [2019-11-28 18:11:55,236 INFO L226 Difference]: Without dead ends: 1752 [2019-11-28 18:11:55,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-11-28 18:11:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2019-11-28 18:11:55,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2019-11-28 18:11:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 4007 transitions. [2019-11-28 18:11:55,265 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 4007 transitions. Word has length 16 [2019-11-28 18:11:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:55,265 INFO L462 AbstractCegarLoop]: Abstraction has 1752 states and 4007 transitions. [2019-11-28 18:11:55,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 4007 transitions. [2019-11-28 18:11:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:11:55,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:55,268 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:11:55,268 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:11:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1595600556, now seen corresponding path program 1 times [2019-11-28 18:11:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:55,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703382200] [2019-11-28 18:11:55,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:55,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:11:55,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703382200] [2019-11-28 18:11:55,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:55,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:55,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449982408] [2019-11-28 18:11:55,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:55,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:55,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:55,374 INFO L87 Difference]: Start difference. First operand 1752 states and 4007 transitions. Second operand 5 states. [2019-11-28 18:11:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:55,605 INFO L93 Difference]: Finished difference Result 2261 states and 5020 transitions. [2019-11-28 18:11:55,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:55,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-28 18:11:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:55,611 INFO L225 Difference]: With dead ends: 2261 [2019-11-28 18:11:55,611 INFO L226 Difference]: Without dead ends: 2261 [2019-11-28 18:11:55,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2019-11-28 18:11:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 1820. [2019-11-28 18:11:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-11-28 18:11:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4147 transitions. [2019-11-28 18:11:55,642 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4147 transitions. Word has length 25 [2019-11-28 18:11:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:55,642 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4147 transitions. [2019-11-28 18:11:55,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4147 transitions. [2019-11-28 18:11:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:11:55,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:55,645 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] [2019-11-28 18:11:55,646 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:11:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 532711466, now seen corresponding path program 1 times [2019-11-28 18:11:55,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:55,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860129480] [2019-11-28 18:11:55,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:55,723 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:11:55,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860129480] [2019-11-28 18:11:55,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:55,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:55,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91936493] [2019-11-28 18:11:55,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:11:55,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:11:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:11:55,725 INFO L87 Difference]: Start difference. First operand 1820 states and 4147 transitions. Second operand 5 states. [2019-11-28 18:11:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:55,970 INFO L93 Difference]: Finished difference Result 2275 states and 5049 transitions. [2019-11-28 18:11:55,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:11:55,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:11:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:55,977 INFO L225 Difference]: With dead ends: 2275 [2019-11-28 18:11:55,977 INFO L226 Difference]: Without dead ends: 2275 [2019-11-28 18:11:55,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:11:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2019-11-28 18:11:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 1766. [2019-11-28 18:11:56,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1766 states. [2019-11-28 18:11:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 4036 transitions. [2019-11-28 18:11:56,013 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 4036 transitions. Word has length 26 [2019-11-28 18:11:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:56,014 INFO L462 AbstractCegarLoop]: Abstraction has 1766 states and 4036 transitions. [2019-11-28 18:11:56,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:11:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 4036 transitions. [2019-11-28 18:11:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:11:56,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:56,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:11:56,017 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:11:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:56,018 INFO L82 PathProgramCache]: Analyzing trace with hash 898927989, now seen corresponding path program 1 times [2019-11-28 18:11:56,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:56,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567589670] [2019-11-28 18:11:56,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:56,082 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:11:56,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567589670] [2019-11-28 18:11:56,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:56,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:11:56,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336966060] [2019-11-28 18:11:56,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:56,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:56,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:56,085 INFO L87 Difference]: Start difference. First operand 1766 states and 4036 transitions. Second operand 4 states. [2019-11-28 18:11:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:56,104 INFO L93 Difference]: Finished difference Result 859 states and 1946 transitions. [2019-11-28 18:11:56,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:11:56,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:11:56,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:56,107 INFO L225 Difference]: With dead ends: 859 [2019-11-28 18:11:56,107 INFO L226 Difference]: Without dead ends: 859 [2019-11-28 18:11:56,107 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-11-28 18:11:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2019-11-28 18:11:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-28 18:11:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1946 transitions. [2019-11-28 18:11:56,126 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1946 transitions. Word has length 27 [2019-11-28 18:11:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:56,127 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1946 transitions. [2019-11-28 18:11:56,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1946 transitions. [2019-11-28 18:11:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:11:56,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:56,133 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:11:56,133 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:11:56,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1144531918, now seen corresponding path program 1 times [2019-11-28 18:11:56,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:56,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189479147] [2019-11-28 18:11:56,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:56,271 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:11:56,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189479147] [2019-11-28 18:11:56,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:56,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:56,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677941419] [2019-11-28 18:11:56,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:11:56,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:56,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:11:56,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:56,274 INFO L87 Difference]: Start difference. First operand 859 states and 1946 transitions. Second operand 6 states. [2019-11-28 18:11:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:56,935 INFO L93 Difference]: Finished difference Result 1487 states and 3250 transitions. [2019-11-28 18:11:56,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:11:56,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-28 18:11:56,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:56,938 INFO L225 Difference]: With dead ends: 1487 [2019-11-28 18:11:56,938 INFO L226 Difference]: Without dead ends: 1487 [2019-11-28 18:11:56,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-11-28 18:11:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1149. [2019-11-28 18:11:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-11-28 18:11:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2588 transitions. [2019-11-28 18:11:56,961 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2588 transitions. Word has length 52 [2019-11-28 18:11:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:56,961 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2588 transitions. [2019-11-28 18:11:56,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:11:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2588 transitions. [2019-11-28 18:11:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:11:56,966 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:56,966 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:11:56,967 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:11:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1913367860, now seen corresponding path program 2 times [2019-11-28 18:11:56,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:56,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697822690] [2019-11-28 18:11:56,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:11:57,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697822690] [2019-11-28 18:11:57,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:11:57,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510976926] [2019-11-28 18:11:57,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:11:57,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:11:57,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:11:57,145 INFO L87 Difference]: Start difference. First operand 1149 states and 2588 transitions. Second operand 3 states. [2019-11-28 18:11:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:57,206 INFO L93 Difference]: Finished difference Result 1408 states and 3131 transitions. [2019-11-28 18:11:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:11:57,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:11:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:57,209 INFO L225 Difference]: With dead ends: 1408 [2019-11-28 18:11:57,209 INFO L226 Difference]: Without dead ends: 1408 [2019-11-28 18:11:57,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:11:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2019-11-28 18:11:57,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1153. [2019-11-28 18:11:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1153 states. [2019-11-28 18:11:57,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 2605 transitions. [2019-11-28 18:11:57,232 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 2605 transitions. Word has length 52 [2019-11-28 18:11:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,232 INFO L462 AbstractCegarLoop]: Abstraction has 1153 states and 2605 transitions. [2019-11-28 18:11:57,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:11:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 2605 transitions. [2019-11-28 18:11:57,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:57,236 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,236 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:11:57,236 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:11:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1717636000, now seen corresponding path program 1 times [2019-11-28 18:11:57,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124201877] [2019-11-28 18:11:57,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,283 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:11:57,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124201877] [2019-11-28 18:11:57,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:11:57,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778613423] [2019-11-28 18:11:57,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:11:57,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:11:57,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:11:57,285 INFO L87 Difference]: Start difference. First operand 1153 states and 2605 transitions. Second operand 4 states. [2019-11-28 18:11:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:57,503 INFO L93 Difference]: Finished difference Result 1870 states and 4212 transitions. [2019-11-28 18:11:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:11:57,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-28 18:11:57,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:57,506 INFO L225 Difference]: With dead ends: 1870 [2019-11-28 18:11:57,506 INFO L226 Difference]: Without dead ends: 1870 [2019-11-28 18:11:57,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:11:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-11-28 18:11:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1239. [2019-11-28 18:11:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2019-11-28 18:11:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2834 transitions. [2019-11-28 18:11:57,532 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2834 transitions. Word has length 53 [2019-11-28 18:11:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:57,533 INFO L462 AbstractCegarLoop]: Abstraction has 1239 states and 2834 transitions. [2019-11-28 18:11:57,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:11:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2834 transitions. [2019-11-28 18:11:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:57,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:57,536 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:11:57,536 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:11:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1264660564, now seen corresponding path program 1 times [2019-11-28 18:11:57,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:57,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010745328] [2019-11-28 18:11:57,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:57,634 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:11:57,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010745328] [2019-11-28 18:11:57,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:57,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:11:57,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048913399] [2019-11-28 18:11:57,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:11:57,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:57,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:11:57,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:11:57,636 INFO L87 Difference]: Start difference. First operand 1239 states and 2834 transitions. Second operand 6 states. [2019-11-28 18:11:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:11:58,372 INFO L93 Difference]: Finished difference Result 3269 states and 7521 transitions. [2019-11-28 18:11:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:11:58,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-28 18:11:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:11:58,378 INFO L225 Difference]: With dead ends: 3269 [2019-11-28 18:11:58,378 INFO L226 Difference]: Without dead ends: 3245 [2019-11-28 18:11:58,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:11:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-11-28 18:11:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 1725. [2019-11-28 18:11:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-11-28 18:11:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3985 transitions. [2019-11-28 18:11:58,425 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3985 transitions. Word has length 53 [2019-11-28 18:11:58,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:11:58,425 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3985 transitions. [2019-11-28 18:11:58,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:11:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3985 transitions. [2019-11-28 18:11:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:11:58,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:11:58,430 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:11:58,430 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:11:58,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:11:58,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1633231102, now seen corresponding path program 1 times [2019-11-28 18:11:58,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:11:58,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736904315] [2019-11-28 18:11:58,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:11:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:11:58,838 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:11:58,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736904315] [2019-11-28 18:11:58,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:11:58,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:11:58,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443826183] [2019-11-28 18:11:58,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:11:58,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:11:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:11:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:11:58,840 INFO L87 Difference]: Start difference. First operand 1725 states and 3985 transitions. Second operand 11 states. [2019-11-28 18:12:00,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:00,191 INFO L93 Difference]: Finished difference Result 3843 states and 8521 transitions. [2019-11-28 18:12:00,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:00,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-11-28 18:12:00,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:00,196 INFO L225 Difference]: With dead ends: 3843 [2019-11-28 18:12:00,196 INFO L226 Difference]: Without dead ends: 2625 [2019-11-28 18:12:00,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:12:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2019-11-28 18:12:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2211. [2019-11-28 18:12:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-11-28 18:12:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 4981 transitions. [2019-11-28 18:12:00,235 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 4981 transitions. Word has length 53 [2019-11-28 18:12:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:00,236 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 4981 transitions. [2019-11-28 18:12:00,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:12:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 4981 transitions. [2019-11-28 18:12:00,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:00,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:00,242 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:12:00,242 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:12:00,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:00,243 INFO L82 PathProgramCache]: Analyzing trace with hash -517102320, now seen corresponding path program 1 times [2019-11-28 18:12:00,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:00,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146619343] [2019-11-28 18:12:00,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:00,297 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:12:00,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146619343] [2019-11-28 18:12:00,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:00,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:00,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701869765] [2019-11-28 18:12:00,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:00,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:00,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:00,299 INFO L87 Difference]: Start difference. First operand 2211 states and 4981 transitions. Second operand 3 states. [2019-11-28 18:12:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:00,422 INFO L93 Difference]: Finished difference Result 2999 states and 6688 transitions. [2019-11-28 18:12:00,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:00,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-28 18:12:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:00,427 INFO L225 Difference]: With dead ends: 2999 [2019-11-28 18:12:00,428 INFO L226 Difference]: Without dead ends: 2999 [2019-11-28 18:12:00,428 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:12:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-28 18:12:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2178. [2019-11-28 18:12:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2019-11-28 18:12:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 4908 transitions. [2019-11-28 18:12:00,480 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 4908 transitions. Word has length 53 [2019-11-28 18:12:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:00,481 INFO L462 AbstractCegarLoop]: Abstraction has 2178 states and 4908 transitions. [2019-11-28 18:12:00,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 4908 transitions. [2019-11-28 18:12:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:00,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:00,488 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:12:00,488 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:00,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:00,489 INFO L82 PathProgramCache]: Analyzing trace with hash 300048924, now seen corresponding path program 2 times [2019-11-28 18:12:00,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:00,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546920650] [2019-11-28 18:12:00,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:00,618 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:12:00,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546920650] [2019-11-28 18:12:00,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:00,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:00,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454911950] [2019-11-28 18:12:00,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:00,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:00,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:00,621 INFO L87 Difference]: Start difference. First operand 2178 states and 4908 transitions. Second operand 5 states. [2019-11-28 18:12:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:00,654 INFO L93 Difference]: Finished difference Result 2486 states and 5522 transitions. [2019-11-28 18:12:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:00,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-11-28 18:12:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:00,657 INFO L225 Difference]: With dead ends: 2486 [2019-11-28 18:12:00,657 INFO L226 Difference]: Without dead ends: 1275 [2019-11-28 18:12:00,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:00,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-28 18:12:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2019-11-28 18:12:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-28 18:12:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 2901 transitions. [2019-11-28 18:12:00,686 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 2901 transitions. Word has length 53 [2019-11-28 18:12:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:00,686 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 2901 transitions. [2019-11-28 18:12:00,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 2901 transitions. [2019-11-28 18:12:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:00,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:00,690 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:12:00,690 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:00,690 INFO L82 PathProgramCache]: Analyzing trace with hash 821991690, now seen corresponding path program 3 times [2019-11-28 18:12:00,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:00,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515803151] [2019-11-28 18:12:00,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:01,185 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:12:01,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515803151] [2019-11-28 18:12:01,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:01,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 18:12:01,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147685009] [2019-11-28 18:12:01,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 18:12:01,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:01,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 18:12:01,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:12:01,194 INFO L87 Difference]: Start difference. First operand 1275 states and 2901 transitions. Second operand 13 states. [2019-11-28 18:12:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:03,292 INFO L93 Difference]: Finished difference Result 2497 states and 5375 transitions. [2019-11-28 18:12:03,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:12:03,293 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-11-28 18:12:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:03,295 INFO L225 Difference]: With dead ends: 2497 [2019-11-28 18:12:03,296 INFO L226 Difference]: Without dead ends: 2071 [2019-11-28 18:12:03,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 18:12:03,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-11-28 18:12:03,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1391. [2019-11-28 18:12:03,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1391 states. [2019-11-28 18:12:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1391 states to 1391 states and 3196 transitions. [2019-11-28 18:12:03,325 INFO L78 Accepts]: Start accepts. Automaton has 1391 states and 3196 transitions. Word has length 53 [2019-11-28 18:12:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:03,325 INFO L462 AbstractCegarLoop]: Abstraction has 1391 states and 3196 transitions. [2019-11-28 18:12:03,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 18:12:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1391 states and 3196 transitions. [2019-11-28 18:12:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:03,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:03,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:03,330 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 813658986, now seen corresponding path program 4 times [2019-11-28 18:12:03,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:03,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890258034] [2019-11-28 18:12:03,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:03,464 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:12:03,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890258034] [2019-11-28 18:12:03,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:03,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:12:03,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815903988] [2019-11-28 18:12:03,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:12:03,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:12:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:12:03,466 INFO L87 Difference]: Start difference. First operand 1391 states and 3196 transitions. Second operand 6 states. [2019-11-28 18:12:03,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:03,538 INFO L93 Difference]: Finished difference Result 1391 states and 3182 transitions. [2019-11-28 18:12:03,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:03,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-28 18:12:03,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:03,540 INFO L225 Difference]: With dead ends: 1391 [2019-11-28 18:12:03,540 INFO L226 Difference]: Without dead ends: 1391 [2019-11-28 18:12:03,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2019-11-28 18:12:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1296. [2019-11-28 18:12:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1296 states. [2019-11-28 18:12:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 2959 transitions. [2019-11-28 18:12:03,560 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 2959 transitions. Word has length 53 [2019-11-28 18:12:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:03,561 INFO L462 AbstractCegarLoop]: Abstraction has 1296 states and 2959 transitions. [2019-11-28 18:12:03,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:12:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 2959 transitions. [2019-11-28 18:12:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:03,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:03,565 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:12:03,565 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:03,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash -779576130, now seen corresponding path program 1 times [2019-11-28 18:12:03,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:03,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841293551] [2019-11-28 18:12:03,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:03,843 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:12:03,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841293551] [2019-11-28 18:12:03,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:03,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:12:03,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656813060] [2019-11-28 18:12:03,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:12:03,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:03,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:12:03,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:12:03,847 INFO L87 Difference]: Start difference. First operand 1296 states and 2959 transitions. Second operand 12 states. [2019-11-28 18:12:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:06,297 INFO L93 Difference]: Finished difference Result 3408 states and 7230 transitions. [2019-11-28 18:12:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-28 18:12:06,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 18:12:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:06,302 INFO L225 Difference]: With dead ends: 3408 [2019-11-28 18:12:06,302 INFO L226 Difference]: Without dead ends: 2256 [2019-11-28 18:12:06,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 18:12:06,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2019-11-28 18:12:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 1282. [2019-11-28 18:12:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2019-11-28 18:12:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 2882 transitions. [2019-11-28 18:12:06,328 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 2882 transitions. Word has length 53 [2019-11-28 18:12:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:06,328 INFO L462 AbstractCegarLoop]: Abstraction has 1282 states and 2882 transitions. [2019-11-28 18:12:06,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:12:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 2882 transitions. [2019-11-28 18:12:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:06,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:06,332 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:12:06,332 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:06,333 INFO L82 PathProgramCache]: Analyzing trace with hash 811680600, now seen corresponding path program 2 times [2019-11-28 18:12:06,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:06,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038753358] [2019-11-28 18:12:06,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:06,675 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:12:06,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038753358] [2019-11-28 18:12:06,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:06,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 18:12:06,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891003834] [2019-11-28 18:12:06,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 18:12:06,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:06,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 18:12:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:12:06,680 INFO L87 Difference]: Start difference. First operand 1282 states and 2882 transitions. Second operand 12 states. [2019-11-28 18:12:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:08,382 INFO L93 Difference]: Finished difference Result 1765 states and 3804 transitions. [2019-11-28 18:12:08,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:12:08,390 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 18:12:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:08,392 INFO L225 Difference]: With dead ends: 1765 [2019-11-28 18:12:08,392 INFO L226 Difference]: Without dead ends: 1469 [2019-11-28 18:12:08,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-28 18:12:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-11-28 18:12:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1283. [2019-11-28 18:12:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-11-28 18:12:08,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2883 transitions. [2019-11-28 18:12:08,411 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2883 transitions. Word has length 53 [2019-11-28 18:12:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:08,411 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2883 transitions. [2019-11-28 18:12:08,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 18:12:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2883 transitions. [2019-11-28 18:12:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:12:08,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:08,415 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:12:08,415 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1691396374, now seen corresponding path program 3 times [2019-11-28 18:12:08,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:08,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132059970] [2019-11-28 18:12:08,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:08,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:08,530 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:08,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_23|) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35|) |v_ULTIMATE.start_main_~#t845~0.offset_23| 0)) |v_#memory_int_13|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t845~0.base_35| 4) |v_#length_15|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t845~0.base_35|) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_23|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_35|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-11-28 18:12:08,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881| (ite (not (and (not (= 0 (mod ~a$w_buff0_used~0_Out855553881 256))) (not (= (mod ~a$w_buff1_used~0_Out855553881 256) 0)))) 1 0)) (= ~a$w_buff0~0_In855553881 ~a$w_buff1~0_Out855553881) (= 1 ~a$w_buff0~0_Out855553881) (= |P0Thread1of1ForFork0_#in~arg.offset_In855553881| P0Thread1of1ForFork0_~arg.offset_Out855553881) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881) (= 1 ~a$w_buff0_used~0_Out855553881) (= ~a$w_buff0_used~0_In855553881 ~a$w_buff1_used~0_Out855553881) (= P0Thread1of1ForFork0_~arg.base_Out855553881 |P0Thread1of1ForFork0_#in~arg.base_In855553881|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In855553881|, ~a$w_buff0~0=~a$w_buff0~0_In855553881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In855553881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In855553881} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In855553881|, ~a$w_buff1~0=~a$w_buff1~0_Out855553881, ~a$w_buff0~0=~a$w_buff0~0_Out855553881, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In855553881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out855553881, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out855553881, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out855553881, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out855553881} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:08,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-11-28 18:12:08,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1334414883 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1334414883 |P1Thread1of1ForFork1_#t~ite24_Out-1334414883|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-1334414883| |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|)) (and (= ~a$w_buff1_used~0_In-1334414883 |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1334414883 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-1334414883 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1334414883 256)) (and (= 0 (mod ~a$r_buff1_thd2~0_In-1334414883 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1334414883| |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1334414883, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1334414883|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334414883, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1334414883, ~weak$$choice2~0=~weak$$choice2~0_In-1334414883} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1334414883|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1334414883|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334414883, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1334414883, ~weak$$choice2~0=~weak$$choice2~0_In-1334414883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:08,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:08,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In335153497 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In335153497 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out335153497|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In335153497 |P0Thread1of1ForFork0_#t~ite5_Out335153497|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In335153497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In335153497} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out335153497|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In335153497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In335153497} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:08,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-8527264 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-8527264 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-8527264 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-8527264 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-8527264| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-8527264 |P0Thread1of1ForFork0_#t~ite6_Out-8527264|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8527264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8527264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8527264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8527264} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-8527264|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8527264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8527264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8527264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8527264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:08,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= ~a$r_buff0_thd1~0_Out570866133 ~a$r_buff0_thd1~0_In570866133)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In570866133 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In570866133 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out570866133 0) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In570866133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In570866133} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out570866133|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In570866133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out570866133} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:08,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-949797929 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-949797929 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-949797929 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-949797929 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-949797929 |P0Thread1of1ForFork0_#t~ite8_Out-949797929|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-949797929| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-949797929, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-949797929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-949797929, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-949797929} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-949797929, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-949797929|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-949797929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-949797929, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-949797929} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:08,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:08,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:12:08,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1069744519 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1069744519 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1069744519| |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|))) (or (and .cse0 (or .cse1 .cse2) (= ~a~0_In-1069744519 |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|)) (and (not .cse1) (not .cse2) .cse0 (= ~a$w_buff1~0_In-1069744519 |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|)))) InVars {~a~0=~a~0_In-1069744519, ~a$w_buff1~0=~a$w_buff1~0_In-1069744519, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1069744519, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1069744519} OutVars{~a~0=~a~0_In-1069744519, ~a$w_buff1~0=~a$w_buff1~0_In-1069744519, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1069744519, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1069744519|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1069744519|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1069744519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:08,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2057146385 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2057146385 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2057146385 |P1Thread1of1ForFork1_#t~ite34_Out-2057146385|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2057146385|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2057146385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057146385} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2057146385|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2057146385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057146385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:08,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-595276356 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-595276356 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-595276356 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-595276356 256)))) (or (and (= ~a$w_buff1_used~0_In-595276356 |P1Thread1of1ForFork1_#t~ite35_Out-595276356|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-595276356|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595276356, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595276356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595276356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595276356} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595276356, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595276356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595276356, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-595276356|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595276356} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:08,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1201433159 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1201433159 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1201433159| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1201433159 |P1Thread1of1ForFork1_#t~ite36_Out-1201433159|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1201433159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201433159} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1201433159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201433159, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1201433159|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:08,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1488716314 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1488716314 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1488716314 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1488716314 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-1488716314| ~a$r_buff1_thd2~0_In-1488716314)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1488716314| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1488716314, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1488716314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488716314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1488716314} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1488716314, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1488716314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488716314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1488716314, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1488716314|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:08,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:08,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:08,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-770350377 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-770350377 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-770350377| ~a~0_In-770350377)) (and (= |ULTIMATE.start_main_#t~ite40_Out-770350377| ~a$w_buff1~0_In-770350377) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-770350377, ~a$w_buff1~0=~a$w_buff1~0_In-770350377, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-770350377, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-770350377} OutVars{~a~0=~a~0_In-770350377, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-770350377|, ~a$w_buff1~0=~a$w_buff1~0_In-770350377, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-770350377, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-770350377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:08,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:08,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In401589625 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In401589625 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In401589625 |ULTIMATE.start_main_#t~ite42_Out401589625|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out401589625|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In401589625, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In401589625} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In401589625, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In401589625, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out401589625|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:08,552 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In2124597693 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In2124597693 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In2124597693 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In2124597693 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2124597693| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out2124597693| ~a$w_buff1_used~0_In2124597693)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2124597693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124597693, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124597693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124597693} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2124597693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124597693, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124597693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124597693, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2124597693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:08,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1705005990 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1705005990 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1705005990|)) (and (= ~a$r_buff0_thd0~0_In-1705005990 |ULTIMATE.start_main_#t~ite44_Out-1705005990|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1705005990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1705005990} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1705005990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1705005990, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1705005990|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:08,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1066434255 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1066434255 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1066434255 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1066434255 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1066434255| ~a$r_buff1_thd0~0_In-1066434255) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1066434255| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1066434255, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066434255, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1066434255, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1066434255} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1066434255, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066434255, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1066434255, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1066434255, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1066434255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:08,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:08,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:08 BasicIcfg [2019-11-28 18:12:08,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:08,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:08,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:08,626 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:08,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:11:42" (3/4) ... [2019-11-28 18:12:08,630 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:08,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_316) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_cnt~0_62) (= 0 |v_ULTIMATE.start_main_~#t845~0.offset_23|) (= v_~z~0_11 0) (= 0 v_~a$read_delayed~0_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t845~0.base_35|) |v_ULTIMATE.start_main_~#t845~0.offset_23| 0)) |v_#memory_int_13|) (= v_~y~0_90 0) (= 0 v_~a$r_buff1_thd2~0_271) (= v_~__unbuffered_p1_EBX~0_60 0) (= v_~a$flush_delayed~0_23 0) (= v_~main$tmp_guard1~0_43 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~a$w_buff0_used~0_830) (= 0 v_~a$w_buff1_used~0_501) (= 0 |v_#NULL.base_4|) (= v_~x~0_85 0) (= 0 v_~a$r_buff1_thd1~0_132) (= 0 v_~weak$$choice0~0_11) (= 0 v_~a$r_buff0_thd1~0_236) (= v_~main$tmp_guard0~0_21 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t845~0.base_35| 1) |v_#valid_63|) (= 0 v_~a$r_buff0_thd2~0_373) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t845~0.base_35| 4) |v_#length_15|) (= |v_#NULL.offset_4| 0) (= v_~__unbuffered_p0_EBX~0_115 0) (= v_~a$mem_tmp~0_14 0) (= v_~weak$$choice2~0_107 0) (= v_~a~0_150 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~a$r_buff1_thd0~0_178 0) (= v_~a$r_buff0_thd0~0_163 0) (= v_~a$w_buff0~0_518 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t845~0.base_35|) (= 0 v_~__unbuffered_p1_EAX~0_46) (= 0 v_~__unbuffered_p0_EAX~0_117))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_271, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_373, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_163, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~a~0=v_~a~0_150, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_117, ~a$w_buff1~0=v_~a$w_buff1~0_316, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t845~0.offset=|v_ULTIMATE.start_main_~#t845~0.offset_23|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_27|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_60, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_115, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_132, ULTIMATE.start_main_~#t845~0.base=|v_ULTIMATE.start_main_~#t845~0.base_35|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_830, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_236, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_16|, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_95|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_87|, ~a$w_buff0~0=v_~a$w_buff0~0_518, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_178, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_11, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_501, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~x~0=v_~x~0_85, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[~a$read_delayed~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, #NULL.offset, ~main$tmp_guard1~0, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~a$mem_tmp~0, ~a~0, ~__unbuffered_p0_EAX~0, ~a$w_buff1~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t845~0.offset, ULTIMATE.start_main_~#t846~0.base, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~a$r_buff1_thd1~0, ULTIMATE.start_main_~#t845~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t846~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~a$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite40, ~a$w_buff0~0, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~x~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-11-28 18:12:08,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] P0ENTRY-->L4-3: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881)) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881| (ite (not (and (not (= 0 (mod ~a$w_buff0_used~0_Out855553881 256))) (not (= (mod ~a$w_buff1_used~0_Out855553881 256) 0)))) 1 0)) (= ~a$w_buff0~0_In855553881 ~a$w_buff1~0_Out855553881) (= 1 ~a$w_buff0~0_Out855553881) (= |P0Thread1of1ForFork0_#in~arg.offset_In855553881| P0Thread1of1ForFork0_~arg.offset_Out855553881) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881) (= 1 ~a$w_buff0_used~0_Out855553881) (= ~a$w_buff0_used~0_In855553881 ~a$w_buff1_used~0_Out855553881) (= P0Thread1of1ForFork0_~arg.base_Out855553881 |P0Thread1of1ForFork0_#in~arg.base_In855553881|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In855553881|, ~a$w_buff0~0=~a$w_buff0~0_In855553881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In855553881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In855553881} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In855553881|, ~a$w_buff1~0=~a$w_buff1~0_Out855553881, ~a$w_buff0~0=~a$w_buff0~0_Out855553881, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out855553881, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In855553881|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out855553881, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out855553881, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out855553881, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out855553881|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out855553881} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~a$w_buff0_used~0, ~a$w_buff1_used~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:12:08,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L814-1-->L816: Formula: (and (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t846~0.base_10|) |v_ULTIMATE.start_main_~#t846~0.offset_9| 1)) |v_#memory_int_7|) (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t846~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t846~0.offset_9| 0) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t846~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t846~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t846~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t846~0.offset=|v_ULTIMATE.start_main_~#t846~0.offset_9|, ULTIMATE.start_main_~#t846~0.base=|v_ULTIMATE.start_main_~#t846~0.base_10|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t846~0.offset, ULTIMATE.start_main_~#t846~0.base] because there is no mapped edge [2019-11-28 18:12:08,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L783-->L783-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1334414883 256) 0))) (or (and (= ~a$w_buff1_used~0_In-1334414883 |P1Thread1of1ForFork1_#t~ite24_Out-1334414883|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-1334414883| |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|)) (and (= ~a$w_buff1_used~0_In-1334414883 |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1334414883 256)))) (or (and (= (mod ~a$w_buff1_used~0_In-1334414883 256) 0) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-1334414883 256)) (and (= 0 (mod ~a$r_buff1_thd2~0_In-1334414883 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite24_Out-1334414883| |P1Thread1of1ForFork1_#t~ite23_Out-1334414883|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1334414883, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1334414883|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334414883, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1334414883, ~weak$$choice2~0=~weak$$choice2~0_In-1334414883} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1334414883|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1334414883, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1334414883|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1334414883, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1334414883, ~weak$$choice2~0=~weak$$choice2~0_In-1334414883} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24] because there is no mapped edge [2019-11-28 18:12:08,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L784-->L785: Formula: (and (not (= (mod v_~weak$$choice2~0_38 256) 0)) (= v_~a$r_buff0_thd2~0_146 v_~a$r_buff0_thd2~0_147)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_147, ~weak$$choice2~0=v_~weak$$choice2~0_38} OutVars{~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_6|, ~weak$$choice2~0=v_~weak$$choice2~0_38, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_13|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~a$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:12:08,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In335153497 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In335153497 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out335153497|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In335153497 |P0Thread1of1ForFork0_#t~ite5_Out335153497|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In335153497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In335153497} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out335153497|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In335153497, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In335153497} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:12:08,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-8527264 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-8527264 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd1~0_In-8527264 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In-8527264 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-8527264| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-8527264 |P0Thread1of1ForFork0_#t~ite6_Out-8527264|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8527264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8527264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8527264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8527264} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-8527264|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-8527264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-8527264, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-8527264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-8527264} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:12:08,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L755-->L756: Formula: (let ((.cse1 (= ~a$r_buff0_thd1~0_Out570866133 ~a$r_buff0_thd1~0_In570866133)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In570866133 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In570866133 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~a$r_buff0_thd1~0_Out570866133 0) (not .cse2)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In570866133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In570866133} OutVars{P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out570866133|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In570866133, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out570866133} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:12:08,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L756-->L756-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-949797929 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd1~0_In-949797929 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-949797929 256))) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-949797929 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd1~0_In-949797929 |P0Thread1of1ForFork0_#t~ite8_Out-949797929|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-949797929| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-949797929, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-949797929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-949797929, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-949797929} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-949797929, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-949797929|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-949797929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-949797929, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-949797929} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:12:08,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L756-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~a$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:12:08,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L787-->L791: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_14 256))) (= v_~a~0_48 v_~a$mem_tmp~0_7) (= v_~a$flush_delayed~0_13 0)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_14} OutVars{~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_7, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_11|} AuxVars[] AssignedVars[~a~0, ~a$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:12:08,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L791-2-->L791-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1069744519 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In-1069744519 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1069744519| |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|))) (or (and .cse0 (or .cse1 .cse2) (= ~a~0_In-1069744519 |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|)) (and (not .cse1) (not .cse2) .cse0 (= ~a$w_buff1~0_In-1069744519 |P1Thread1of1ForFork1_#t~ite32_Out-1069744519|)))) InVars {~a~0=~a~0_In-1069744519, ~a$w_buff1~0=~a$w_buff1~0_In-1069744519, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1069744519, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1069744519} OutVars{~a~0=~a~0_In-1069744519, ~a$w_buff1~0=~a$w_buff1~0_In-1069744519, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1069744519, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1069744519|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1069744519|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1069744519} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:12:08,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L792-->L792-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2057146385 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-2057146385 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2057146385 |P1Thread1of1ForFork1_#t~ite34_Out-2057146385|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2057146385|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2057146385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057146385} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2057146385|, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-2057146385, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2057146385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:12:08,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-595276356 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-595276356 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-595276356 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-595276356 256)))) (or (and (= ~a$w_buff1_used~0_In-595276356 |P1Thread1of1ForFork1_#t~ite35_Out-595276356|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-595276356|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595276356, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595276356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595276356, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595276356} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-595276356, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-595276356, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-595276356, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-595276356|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-595276356} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:12:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd2~0_In-1201433159 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1201433159 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1201433159| 0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-1201433159 |P1Thread1of1ForFork1_#t~ite36_Out-1201433159|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1201433159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201433159} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1201433159, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1201433159, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1201433159|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:12:08,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1488716314 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-1488716314 256) 0)) (.cse3 (= (mod ~a$r_buff1_thd2~0_In-1488716314 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1488716314 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-1488716314| ~a$r_buff1_thd2~0_In-1488716314)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out-1488716314| 0)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1488716314, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1488716314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488716314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1488716314} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1488716314, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1488716314, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1488716314, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1488716314, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1488716314|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:08,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L795-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#t~ite37_22| v_~a$r_buff1_thd2~0_110) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_110, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:12:08,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L816-1-->L822: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:12:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L822-2-->L822-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd0~0_In-770350377 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-770350377 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-770350377| ~a~0_In-770350377)) (and (= |ULTIMATE.start_main_#t~ite40_Out-770350377| ~a$w_buff1~0_In-770350377) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In-770350377, ~a$w_buff1~0=~a$w_buff1~0_In-770350377, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-770350377, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-770350377} OutVars{~a~0=~a~0_In-770350377, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-770350377|, ~a$w_buff1~0=~a$w_buff1~0_In-770350377, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-770350377, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-770350377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L822-4-->L823: Formula: (= v_~a~0_26 |v_ULTIMATE.start_main_#t~ite40_17|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_17|} OutVars{~a~0=v_~a~0_26, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:12:08,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In401589625 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In401589625 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In401589625 |ULTIMATE.start_main_#t~ite42_Out401589625|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out401589625|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In401589625, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In401589625} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In401589625, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In401589625, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out401589625|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:12:08,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L824-->L824-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In2124597693 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In2124597693 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In2124597693 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In2124597693 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out2124597693| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out2124597693| ~a$w_buff1_used~0_In2124597693)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2124597693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124597693, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124597693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124597693} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2124597693, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2124597693, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2124597693, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2124597693, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2124597693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:12:08,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In-1705005990 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1705005990 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1705005990|)) (and (= ~a$r_buff0_thd0~0_In-1705005990 |ULTIMATE.start_main_#t~ite44_Out-1705005990|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1705005990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1705005990} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1705005990, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1705005990, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1705005990|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:12:08,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L826-->L826-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1066434255 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-1066434255 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1066434255 256))) (.cse3 (= (mod ~a$r_buff1_thd0~0_In-1066434255 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1066434255| ~a$r_buff1_thd0~0_In-1066434255) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1066434255| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1066434255, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066434255, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1066434255, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1066434255} OutVars{~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1066434255, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1066434255, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1066434255, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1066434255, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1066434255|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:12:08,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L826-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~a$r_buff1_thd0~0_147 |v_ULTIMATE.start_main_#t~ite45_39|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_86 0) (= 1 v_~__unbuffered_p1_EAX~0_18) (= 1 v_~__unbuffered_p0_EAX~0_88))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_88, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_86, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_147, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:08,729 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:08,730 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:08,732 INFO L168 Benchmark]: Toolchain (without parser) took 28033.63 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 903.3 MB). Free memory was 949.6 MB in the beginning and 1.4 GB in the end (delta: -474.1 MB). Peak memory consumption was 429.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,732 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:08,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,734 INFO L168 Benchmark]: Boogie Preprocessor took 37.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:08,734 INFO L168 Benchmark]: RCFGBuilder took 813.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,734 INFO L168 Benchmark]: TraceAbstraction took 26178.73 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 753.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -382.5 MB). Peak memory consumption was 370.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,735 INFO L168 Benchmark]: Witness Printer took 104.19 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:08,737 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 824.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 813.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26178.73 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 753.4 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -382.5 MB). Peak memory consumption was 370.9 MB. Max. memory is 11.5 GB. * Witness Printer took 104.19 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 151 ProgramPointsBefore, 77 ProgramPointsAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 25 ChoiceCompositions, 5174 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 55357 CheckedPairsTotal, 107 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t845, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t846, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L822] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 25.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2748 SDtfs, 3700 SDslu, 7222 SDs, 0 SdLazy, 7832 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 37 SyntacticMatches, 12 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14306occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 15281 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 234968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...