./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_rmo.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/rfi003_rmo.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 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:11,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:11,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:11,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:11,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:11,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:11,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:11,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:11,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:11,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:11,528 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:11,529 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:11,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:11,531 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:11,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:11,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:11,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:11,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:11,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:11,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:11,541 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:11,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:11,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:11,544 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:11,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:11,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:11,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:11,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:11,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:11,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:11,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:11,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:11,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:11,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:11,559 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:11,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:11,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:11,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:11,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:11,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:11,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:11,569 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:22:11,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:11,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:11,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:11,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:11,596 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:11,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:11,597 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:11,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:11,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:11,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:11,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:11,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:11,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:11,600 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:11,600 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:11,601 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:11,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:11,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:11,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:11,602 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:11,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:11,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:11,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:11,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:11,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:11,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:11,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:11,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:11,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:11,605 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 -> 6b55418eaa2ec3212dd6ecf5ad533b8a46d5e088 [2019-11-28 18:22:11,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:11,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:11,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:11,941 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:11,942 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:11,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-11-28 18:22:12,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7106c024d/292ccfb75e8e47f59e08b18d0303897f/FLAG057a9612a [2019-11-28 18:22:12,598 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:12,599 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_rmo.oepc.i [2019-11-28 18:22:12,613 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7106c024d/292ccfb75e8e47f59e08b18d0303897f/FLAG057a9612a [2019-11-28 18:22:12,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7106c024d/292ccfb75e8e47f59e08b18d0303897f [2019-11-28 18:22:12,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:12,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:12,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:12,864 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:12,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:12,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:12" (1/1) ... [2019-11-28 18:22:12,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:12, skipping insertion in model container [2019-11-28 18:22:12,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:12" (1/1) ... [2019-11-28 18:22:12,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:12,927 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:13,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:13,522 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:13,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:13,663 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:13,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13 WrapperNode [2019-11-28 18:22:13,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:13,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:13,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:13,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:13,673 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:22:13" (1/1) ... [2019-11-28 18:22:13,695 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:22:13" (1/1) ... [2019-11-28 18:22:13,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:13,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:13,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:13,728 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:13,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (1/1) ... [2019-11-28 18:22:13,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:13,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:13,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:13,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:13,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (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:22:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:13,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:13,834 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:13,834 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:13,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:13,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:13,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:13,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:13,838 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:22:14,538 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:14,538 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:14,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:14 BoogieIcfgContainer [2019-11-28 18:22:14,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:14,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:14,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:14,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:14,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:12" (1/3) ... [2019-11-28 18:22:14,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fdad55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:14, skipping insertion in model container [2019-11-28 18:22:14,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:13" (2/3) ... [2019-11-28 18:22:14,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fdad55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:14, skipping insertion in model container [2019-11-28 18:22:14,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:14" (3/3) ... [2019-11-28 18:22:14,555 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_rmo.oepc.i [2019-11-28 18:22:14,567 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:14,567 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:14,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:14,582 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:14,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,620 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,646 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,648 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,652 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:14,673 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:14,690 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:14,691 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:14,691 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:14,691 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:14,692 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:14,692 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:14,692 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:14,692 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:14,710 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-11-28 18:22:14,712 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:14,792 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:14,792 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:14,809 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:14,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:14,875 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:14,875 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:14,881 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:14,897 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:14,898 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:19,214 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:22:19,343 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:22:19,383 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-11-28 18:22:19,383 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-11-28 18:22:19,388 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-11-28 18:22:19,829 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-11-28 18:22:19,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-11-28 18:22:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:19,848 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:19,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:19,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:19,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-11-28 18:22:19,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:19,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588093913] [2019-11-28 18:22:19,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:20,270 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:22:20,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588093913] [2019-11-28 18:22:20,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:20,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:20,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768604347] [2019-11-28 18:22:20,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:20,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:20,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:20,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:20,306 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-11-28 18:22:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,555 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-11-28 18:22:20,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:20,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:20,675 INFO L225 Difference]: With dead ends: 5990 [2019-11-28 18:22:20,677 INFO L226 Difference]: Without dead ends: 5642 [2019-11-28 18:22:20,682 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:22:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-11-28 18:22:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-11-28 18:22:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-11-28 18:22:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-11-28 18:22:21,111 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-11-28 18:22:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,111 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-11-28 18:22:21,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-11-28 18:22:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:21,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:21,118 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-11-28 18:22:21,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183903032] [2019-11-28 18:22:21,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,257 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:22:21,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183903032] [2019-11-28 18:22:21,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:21,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225887569] [2019-11-28 18:22:21,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:21,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:21,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:21,261 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-11-28 18:22:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:21,587 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-11-28 18:22:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:21,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,655 INFO L225 Difference]: With dead ends: 8500 [2019-11-28 18:22:21,656 INFO L226 Difference]: Without dead ends: 8487 [2019-11-28 18:22:21,657 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:22:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-11-28 18:22:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-11-28 18:22:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-11-28 18:22:22,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-11-28 18:22:22,021 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-11-28 18:22:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,021 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-11-28 18:22:22,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-11-28 18:22:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:22,035 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,036 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,036 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-11-28 18:22:22,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998143543] [2019-11-28 18:22:22,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,122 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:22:22,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998143543] [2019-11-28 18:22:22,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:22,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941609368] [2019-11-28 18:22:22,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,125 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-11-28 18:22:22,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,342 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-11-28 18:22:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,412 INFO L225 Difference]: With dead ends: 10006 [2019-11-28 18:22:22,413 INFO L226 Difference]: Without dead ends: 10006 [2019-11-28 18:22:22,413 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:22:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-11-28 18:22:22,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-11-28 18:22:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-11-28 18:22:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-11-28 18:22:22,944 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-11-28 18:22:22,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,946 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-11-28 18:22:22,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-11-28 18:22:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:22,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:22,951 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:22,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,952 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-11-28 18:22:22,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956108683] [2019-11-28 18:22:22,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,041 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:22:23,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956108683] [2019-11-28 18:22:23,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687382698] [2019-11-28 18:22:23,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:23,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,044 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-11-28 18:22:23,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,275 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-11-28 18:22:23,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:23,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:23,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,324 INFO L225 Difference]: With dead ends: 10925 [2019-11-28 18:22:23,325 INFO L226 Difference]: Without dead ends: 10913 [2019-11-28 18:22:23,325 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:22:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-11-28 18:22:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-11-28 18:22:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-11-28 18:22:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-11-28 18:22:23,675 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-11-28 18:22:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,675 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-11-28 18:22:23,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-11-28 18:22:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:23,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,681 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-11-28 18:22:23,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020197162] [2019-11-28 18:22:23,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,745 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:22:23,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020197162] [2019-11-28 18:22:23,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029419331] [2019-11-28 18:22:23,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:23,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:23,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,747 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-11-28 18:22:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,014 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-11-28 18:22:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:24,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,077 INFO L225 Difference]: With dead ends: 11905 [2019-11-28 18:22:24,078 INFO L226 Difference]: Without dead ends: 11891 [2019-11-28 18:22:24,078 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:22:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-11-28 18:22:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-11-28 18:22:24,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-11-28 18:22:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-11-28 18:22:24,416 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-11-28 18:22:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,416 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-11-28 18:22:24,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-11-28 18:22:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:24,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,422 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:22:24,423 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-11-28 18:22:24,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661648401] [2019-11-28 18:22:24,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,475 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:22:24,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661648401] [2019-11-28 18:22:24,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:24,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306648568] [2019-11-28 18:22:24,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:24,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:24,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:24,478 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-11-28 18:22:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,539 INFO L93 Difference]: Finished difference Result 9230 states and 29799 transitions. [2019-11-28 18:22:24,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:24,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,578 INFO L225 Difference]: With dead ends: 9230 [2019-11-28 18:22:24,579 INFO L226 Difference]: Without dead ends: 9230 [2019-11-28 18:22:24,580 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:22:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9230 states. [2019-11-28 18:22:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9230 to 9070. [2019-11-28 18:22:24,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-11-28 18:22:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 29315 transitions. [2019-11-28 18:22:24,965 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 29315 transitions. Word has length 16 [2019-11-28 18:22:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,966 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 29315 transitions. [2019-11-28 18:22:24,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 29315 transitions. [2019-11-28 18:22:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:24,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,971 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:22:24,971 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1352148399, now seen corresponding path program 1 times [2019-11-28 18:22:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119036188] [2019-11-28 18:22:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,027 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:22:25,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119036188] [2019-11-28 18:22:25,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:25,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131622132] [2019-11-28 18:22:25,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:25,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:25,030 INFO L87 Difference]: Start difference. First operand 9070 states and 29315 transitions. Second operand 3 states. [2019-11-28 18:22:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,043 INFO L93 Difference]: Finished difference Result 1412 states and 3407 transitions. [2019-11-28 18:22:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:25,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,048 INFO L225 Difference]: With dead ends: 1412 [2019-11-28 18:22:25,049 INFO L226 Difference]: Without dead ends: 1412 [2019-11-28 18:22:25,050 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:22:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-11-28 18:22:25,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-11-28 18:22:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-11-28 18:22:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3407 transitions. [2019-11-28 18:22:25,077 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3407 transitions. Word has length 16 [2019-11-28 18:22:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,078 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3407 transitions. [2019-11-28 18:22:25,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3407 transitions. [2019-11-28 18:22:25,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:25,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,081 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:22:25,081 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:25,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-11-28 18:22:25,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945654212] [2019-11-28 18:22:25,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,215 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:22:25,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945654212] [2019-11-28 18:22:25,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101625488] [2019-11-28 18:22:25,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,218 INFO L87 Difference]: Start difference. First operand 1412 states and 3407 transitions. Second operand 5 states. [2019-11-28 18:22:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,444 INFO L93 Difference]: Finished difference Result 2044 states and 4855 transitions. [2019-11-28 18:22:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:25,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:25,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,451 INFO L225 Difference]: With dead ends: 2044 [2019-11-28 18:22:25,451 INFO L226 Difference]: Without dead ends: 2042 [2019-11-28 18:22:25,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2019-11-28 18:22:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1563. [2019-11-28 18:22:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2019-11-28 18:22:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 3756 transitions. [2019-11-28 18:22:25,484 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 3756 transitions. Word has length 26 [2019-11-28 18:22:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,485 INFO L462 AbstractCegarLoop]: Abstraction has 1563 states and 3756 transitions. [2019-11-28 18:22:25,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 3756 transitions. [2019-11-28 18:22:25,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:25,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,489 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:22:25,489 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-11-28 18:22:25,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215186940] [2019-11-28 18:22:25,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,576 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:22:25,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215186940] [2019-11-28 18:22:25,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:25,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146972623] [2019-11-28 18:22:25,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,579 INFO L87 Difference]: Start difference. First operand 1563 states and 3756 transitions. Second operand 5 states. [2019-11-28 18:22:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,748 INFO L93 Difference]: Finished difference Result 1826 states and 4331 transitions. [2019-11-28 18:22:25,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:25,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,754 INFO L225 Difference]: With dead ends: 1826 [2019-11-28 18:22:25,754 INFO L226 Difference]: Without dead ends: 1826 [2019-11-28 18:22:25,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2019-11-28 18:22:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1626. [2019-11-28 18:22:25,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2019-11-28 18:22:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 3873 transitions. [2019-11-28 18:22:25,791 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 3873 transitions. Word has length 27 [2019-11-28 18:22:25,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,791 INFO L462 AbstractCegarLoop]: Abstraction has 1626 states and 3873 transitions. [2019-11-28 18:22:25,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 3873 transitions. [2019-11-28 18:22:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:25,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,795 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:22:25,796 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:25,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,796 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-11-28 18:22:25,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788578183] [2019-11-28 18:22:25,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,869 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:22:25,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788578183] [2019-11-28 18:22:25,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734350631] [2019-11-28 18:22:25,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:25,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:25,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:25,872 INFO L87 Difference]: Start difference. First operand 1626 states and 3873 transitions. Second operand 5 states. [2019-11-28 18:22:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,089 INFO L93 Difference]: Finished difference Result 2040 states and 4821 transitions. [2019-11-28 18:22:26,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:26,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,094 INFO L225 Difference]: With dead ends: 2040 [2019-11-28 18:22:26,094 INFO L226 Difference]: Without dead ends: 2038 [2019-11-28 18:22:26,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:22:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2038 states. [2019-11-28 18:22:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2038 to 1549. [2019-11-28 18:22:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1549 states. [2019-11-28 18:22:26,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 3687 transitions. [2019-11-28 18:22:26,125 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 3687 transitions. Word has length 27 [2019-11-28 18:22:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,125 INFO L462 AbstractCegarLoop]: Abstraction has 1549 states and 3687 transitions. [2019-11-28 18:22:26,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 3687 transitions. [2019-11-28 18:22:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:26,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,128 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:22:26,129 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1137859538, now seen corresponding path program 1 times [2019-11-28 18:22:26,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663809065] [2019-11-28 18:22:26,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,221 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:22:26,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663809065] [2019-11-28 18:22:26,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:26,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084483034] [2019-11-28 18:22:26,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:26,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:26,224 INFO L87 Difference]: Start difference. First operand 1549 states and 3687 transitions. Second operand 3 states. [2019-11-28 18:22:26,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,244 INFO L93 Difference]: Finished difference Result 2509 states and 6044 transitions. [2019-11-28 18:22:26,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:26,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 18:22:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,249 INFO L225 Difference]: With dead ends: 2509 [2019-11-28 18:22:26,249 INFO L226 Difference]: Without dead ends: 2173 [2019-11-28 18:22:26,250 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:22:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-11-28 18:22:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 2147. [2019-11-28 18:22:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2147 states. [2019-11-28 18:22:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 5133 transitions. [2019-11-28 18:22:26,294 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 5133 transitions. Word has length 27 [2019-11-28 18:22:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,294 INFO L462 AbstractCegarLoop]: Abstraction has 2147 states and 5133 transitions. [2019-11-28 18:22:26,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 5133 transitions. [2019-11-28 18:22:26,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:22:26,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:26,302 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:26,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-11-28 18:22:26,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996860971] [2019-11-28 18:22:26,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,389 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:22:26,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996860971] [2019-11-28 18:22:26,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:26,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756183649] [2019-11-28 18:22:26,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:26,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:26,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:26,391 INFO L87 Difference]: Start difference. First operand 2147 states and 5133 transitions. Second operand 4 states. [2019-11-28 18:22:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,411 INFO L93 Difference]: Finished difference Result 986 states and 2306 transitions. [2019-11-28 18:22:26,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:26,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:22:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,413 INFO L225 Difference]: With dead ends: 986 [2019-11-28 18:22:26,413 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 18:22:26,414 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:22:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 18:22:26,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-11-28 18:22:26,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-28 18:22:26,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-11-28 18:22:26,428 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-11-28 18:22:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,429 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-11-28 18:22:26,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-11-28 18:22:26,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:26,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:26,432 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-11-28 18:22:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246900077] [2019-11-28 18:22:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,825 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:22:26,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246900077] [2019-11-28 18:22:26,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:22:26,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232570986] [2019-11-28 18:22:26,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 18:22:26,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 18:22:26,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:22:26,830 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 11 states. [2019-11-28 18:22:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:29,235 INFO L93 Difference]: Finished difference Result 2669 states and 5959 transitions. [2019-11-28 18:22:29,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-28 18:22:29,239 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-11-28 18:22:29,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:29,242 INFO L225 Difference]: With dead ends: 2669 [2019-11-28 18:22:29,243 INFO L226 Difference]: Without dead ends: 1496 [2019-11-28 18:22:29,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:22:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-11-28 18:22:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 747. [2019-11-28 18:22:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-11-28 18:22:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1700 transitions. [2019-11-28 18:22:29,267 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1700 transitions. Word has length 42 [2019-11-28 18:22:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:29,267 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1700 transitions. [2019-11-28 18:22:29,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 18:22:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1700 transitions. [2019-11-28 18:22:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:29,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:29,271 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] [2019-11-28 18:22:29,271 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:29,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1487589225, now seen corresponding path program 2 times [2019-11-28 18:22:29,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:29,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861541168] [2019-11-28 18:22:29,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:29,746 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:22:29,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861541168] [2019-11-28 18:22:29,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:29,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:22:29,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543854277] [2019-11-28 18:22:29,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:22:29,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:22:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:22:29,749 INFO L87 Difference]: Start difference. First operand 747 states and 1700 transitions. Second operand 10 states. [2019-11-28 18:22:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:31,845 INFO L93 Difference]: Finished difference Result 1684 states and 3844 transitions. [2019-11-28 18:22:31,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 18:22:31,846 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-11-28 18:22:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:31,848 INFO L225 Difference]: With dead ends: 1684 [2019-11-28 18:22:31,848 INFO L226 Difference]: Without dead ends: 1428 [2019-11-28 18:22:31,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-11-28 18:22:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-11-28 18:22:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 748. [2019-11-28 18:22:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-11-28 18:22:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1701 transitions. [2019-11-28 18:22:31,871 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1701 transitions. Word has length 42 [2019-11-28 18:22:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:31,872 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1701 transitions. [2019-11-28 18:22:31,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:22:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1701 transitions. [2019-11-28 18:22:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:31,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:31,875 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] [2019-11-28 18:22:31,875 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1626226089, now seen corresponding path program 3 times [2019-11-28 18:22:31,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:31,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781268532] [2019-11-28 18:22:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:31,953 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:22:31,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781268532] [2019-11-28 18:22:31,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:31,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:31,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217529227] [2019-11-28 18:22:31,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:31,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:31,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:31,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:31,955 INFO L87 Difference]: Start difference. First operand 748 states and 1701 transitions. Second operand 3 states. [2019-11-28 18:22:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:31,966 INFO L93 Difference]: Finished difference Result 1157 states and 2653 transitions. [2019-11-28 18:22:31,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:31,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 18:22:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:31,968 INFO L225 Difference]: With dead ends: 1157 [2019-11-28 18:22:31,968 INFO L226 Difference]: Without dead ends: 437 [2019-11-28 18:22:31,968 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:22:31,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-28 18:22:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-28 18:22:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-28 18:22:31,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1000 transitions. [2019-11-28 18:22:31,976 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1000 transitions. Word has length 42 [2019-11-28 18:22:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:31,977 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 1000 transitions. [2019-11-28 18:22:31,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:31,977 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1000 transitions. [2019-11-28 18:22:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:31,978 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:31,978 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] [2019-11-28 18:22:31,979 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:22:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 4 times [2019-11-28 18:22:31,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:31,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779865727] [2019-11-28 18:22:31,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:32,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:32,069 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:32,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:32,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-11-28 18:22:32,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~__unbuffered_p1_EAX~0_Out907536041 ~y~0_Out907536041) (= ~y~0_Out907536041 ~__unbuffered_p1_EBX~0_Out907536041) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041)) (= 1 ~x$r_buff0_thd2~0_Out907536041) (= ~x$r_buff0_thd2~0_In907536041 ~x$r_buff1_thd2~0_Out907536041) (= ~x$r_buff1_thd1~0_Out907536041 ~x$r_buff0_thd1~0_In907536041) (= ~x$r_buff0_thd0~0_In907536041 ~x$r_buff1_thd0~0_Out907536041) (= ~y~0_Out907536041 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In907536041, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In907536041, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In907536041} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In907536041, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In907536041, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out907536041, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out907536041, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out907536041, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out907536041, ~y~0=~y~0_Out907536041, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out907536041, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out907536041} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:32,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:32,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-660586173 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite22_In-660586173| |P0Thread1of1ForFork1_#t~ite22_Out-660586173|) (= |P0Thread1of1ForFork1_#t~ite23_In-660586173| |P0Thread1of1ForFork1_#t~ite23_Out-660586173|) (= |P0Thread1of1ForFork1_#t~ite24_Out-660586173| ~x$r_buff1_thd1~0_In-660586173)) (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In-660586173 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out-660586173| |P0Thread1of1ForFork1_#t~ite24_Out-660586173|) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In-660586173 256))) .cse1) .cse0 (not (= 0 (mod ~x$w_buff0_used~0_In-660586173 256))) (= |P0Thread1of1ForFork1_#t~ite23_Out-660586173| |P0Thread1of1ForFork1_#t~ite22_Out-660586173|) (or (not (= 0 (mod ~x$w_buff1_used~0_In-660586173 256))) .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-660586173|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-660586173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660586173, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-660586173, ~weak$$choice2~0=~weak$$choice2~0_In-660586173, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-660586173|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660586173, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-660586173|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-660586173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660586173, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-660586173, ~weak$$choice2~0=~weak$$choice2~0_In-660586173, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-660586173|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-660586173|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-660586173|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660586173} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:32,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:32,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-847952653 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-847952653 256)))) (or (and (= ~x$w_buff0_used~0_In-847952653 |P1Thread1of1ForFork0_#t~ite28_Out-847952653|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-847952653|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-847952653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-847952653} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-847952653, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-847952653|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-847952653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:32,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1055280701 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1055280701 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1055280701 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1055280701 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1055280701| ~x$w_buff1_used~0_In1055280701) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out1055280701| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1055280701, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1055280701, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1055280701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1055280701} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1055280701, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1055280701, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1055280701, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1055280701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1055280701} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:32,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1124760400 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1124760400 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out1124760400 ~x$r_buff0_thd2~0_In1124760400))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~x$r_buff0_thd2~0_Out1124760400 0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1124760400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1124760400} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1124760400|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1124760400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1124760400} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:32,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1998855619 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1998855619 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1998855619 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1998855619 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1998855619 |P1Thread1of1ForFork0_#t~ite31_Out-1998855619|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1998855619|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1998855619, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1998855619, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1998855619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1998855619} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1998855619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1998855619, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1998855619, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1998855619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1998855619} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:32,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:32,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:32,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1161434716 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1161434716 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1161434716 |ULTIMATE.start_main_#t~ite34_Out1161434716|)) (and (= ~x~0_In1161434716 |ULTIMATE.start_main_#t~ite34_Out1161434716|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1161434716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1161434716, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1161434716, ~x~0=~x~0_In1161434716} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1161434716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1161434716, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1161434716, ~x~0=~x~0_In1161434716, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1161434716|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:32,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:32,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1142703637 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1142703637 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1142703637| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1142703637| ~x$w_buff0_used~0_In1142703637)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1142703637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142703637} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1142703637, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1142703637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142703637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:32,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1294074758 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1294074758 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1294074758 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1294074758 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1294074758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1294074758 |ULTIMATE.start_main_#t~ite37_Out-1294074758|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294074758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294074758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1294074758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294074758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294074758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294074758, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1294074758|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1294074758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294074758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:32,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2138271598 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2138271598 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-2138271598| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-2138271598| ~x$r_buff0_thd0~0_In-2138271598)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2138271598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2138271598} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2138271598, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2138271598|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2138271598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:32,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1905081173 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1905081173 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1905081173 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1905081173 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1905081173| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-1905081173 |ULTIMATE.start_main_#t~ite39_Out-1905081173|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905081173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905081173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905081173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905081173} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905081173, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1905081173|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905081173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905081173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905081173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:32,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:32,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:32 BasicIcfg [2019-11-28 18:22:32,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:32,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:32,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:32,156 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:32,157 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:14" (3/4) ... [2019-11-28 18:22:32,159 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:32,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| 4)) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35|)) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1641~0.base_35|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1641~0.base_35|) |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_6|) (= (store .cse0 |v_ULTIMATE.start_main_~#t1641~0.base_35| 1) |v_#valid_59|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_ULTIMATE.start_main_~#t1641~0.offset_24| 0) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ULTIMATE.start_main_~#t1641~0.offset=|v_ULTIMATE.start_main_~#t1641~0.offset_24|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_~#t1641~0.base=|v_ULTIMATE.start_main_~#t1641~0.base_35|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1641~0.offset, ULTIMATE.start_main_~#t1642~0.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1641~0.base, ULTIMATE.start_main_~#t1642~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:32,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| 4) |v_#length_9|) (not (= |v_ULTIMATE.start_main_~#t1642~0.base_10| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1642~0.base_10|) |v_ULTIMATE.start_main_~#t1642~0.offset_9| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1642~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1642~0.base_10|) (= |v_ULTIMATE.start_main_~#t1642~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1642~0.offset=|v_ULTIMATE.start_main_~#t1642~0.offset_9|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1642~0.base=|v_ULTIMATE.start_main_~#t1642~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1642~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1642~0.base] because there is no mapped edge [2019-11-28 18:22:32,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~__unbuffered_p1_EAX~0_Out907536041 ~y~0_Out907536041) (= ~y~0_Out907536041 ~__unbuffered_p1_EBX~0_Out907536041) (not (= 0 P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041)) (= 1 ~x$r_buff0_thd2~0_Out907536041) (= ~x$r_buff0_thd2~0_In907536041 ~x$r_buff1_thd2~0_Out907536041) (= ~x$r_buff1_thd1~0_Out907536041 ~x$r_buff0_thd1~0_In907536041) (= ~x$r_buff0_thd0~0_In907536041 ~x$r_buff1_thd0~0_Out907536041) (= ~y~0_Out907536041 1)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In907536041, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In907536041, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In907536041} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In907536041, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In907536041, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out907536041, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In907536041, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out907536041, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out907536041, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out907536041, ~y~0=~y~0_Out907536041, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out907536041, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out907536041} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:22:32,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:22:32,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-660586173 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite22_In-660586173| |P0Thread1of1ForFork1_#t~ite22_Out-660586173|) (= |P0Thread1of1ForFork1_#t~ite23_In-660586173| |P0Thread1of1ForFork1_#t~ite23_Out-660586173|) (= |P0Thread1of1ForFork1_#t~ite24_Out-660586173| ~x$r_buff1_thd1~0_In-660586173)) (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In-660586173 256))))) (and (= |P0Thread1of1ForFork1_#t~ite23_Out-660586173| |P0Thread1of1ForFork1_#t~ite24_Out-660586173|) (or (not (= 0 (mod ~x$r_buff1_thd1~0_In-660586173 256))) .cse1) .cse0 (not (= 0 (mod ~x$w_buff0_used~0_In-660586173 256))) (= |P0Thread1of1ForFork1_#t~ite23_Out-660586173| |P0Thread1of1ForFork1_#t~ite22_Out-660586173|) (or (not (= 0 (mod ~x$w_buff1_used~0_In-660586173 256))) .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite22_Out-660586173|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-660586173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660586173, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-660586173, ~weak$$choice2~0=~weak$$choice2~0_In-660586173, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In-660586173|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660586173, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In-660586173|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-660586173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-660586173, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-660586173, ~weak$$choice2~0=~weak$$choice2~0_In-660586173, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out-660586173|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out-660586173|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out-660586173|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-660586173} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:32,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:32,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-847952653 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-847952653 256)))) (or (and (= ~x$w_buff0_used~0_In-847952653 |P1Thread1of1ForFork0_#t~ite28_Out-847952653|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-847952653|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-847952653, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-847952653} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-847952653, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-847952653|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-847952653} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:32,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1055280701 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1055280701 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1055280701 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1055280701 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1055280701| ~x$w_buff1_used~0_In1055280701) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork0_#t~ite29_Out1055280701| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1055280701, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1055280701, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1055280701, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1055280701} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1055280701, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1055280701, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1055280701, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1055280701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1055280701} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:32,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1124760400 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1124760400 256))) (.cse1 (= ~x$r_buff0_thd2~0_Out1124760400 ~x$r_buff0_thd2~0_In1124760400))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= ~x$r_buff0_thd2~0_Out1124760400 0)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1124760400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1124760400} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1124760400|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1124760400, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1124760400} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:32,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-1998855619 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1998855619 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1998855619 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1998855619 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1998855619 |P1Thread1of1ForFork0_#t~ite31_Out-1998855619|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1998855619|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1998855619, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1998855619, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1998855619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1998855619} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1998855619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1998855619, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1998855619, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1998855619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1998855619} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:32,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:22:32,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:32,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In1161434716 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1161434716 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1161434716 |ULTIMATE.start_main_#t~ite34_Out1161434716|)) (and (= ~x~0_In1161434716 |ULTIMATE.start_main_#t~ite34_Out1161434716|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1161434716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1161434716, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1161434716, ~x~0=~x~0_In1161434716} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1161434716, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1161434716, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1161434716, ~x~0=~x~0_In1161434716, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1161434716|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:32,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:32,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In1142703637 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1142703637 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1142703637| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite36_Out1142703637| ~x$w_buff0_used~0_In1142703637)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1142703637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142703637} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1142703637, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1142703637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1142703637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:32,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1294074758 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1294074758 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1294074758 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1294074758 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-1294074758|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-1294074758 |ULTIMATE.start_main_#t~ite37_Out-1294074758|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294074758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294074758, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1294074758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294074758} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1294074758, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1294074758, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1294074758|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1294074758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1294074758} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:32,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-2138271598 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-2138271598 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-2138271598| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-2138271598| ~x$r_buff0_thd0~0_In-2138271598)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2138271598, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2138271598} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2138271598, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2138271598|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2138271598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:32,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1905081173 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1905081173 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1905081173 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1905081173 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out-1905081173| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In-1905081173 |ULTIMATE.start_main_#t~ite39_Out-1905081173|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905081173, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905081173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905081173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905081173} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905081173, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1905081173|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905081173, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905081173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905081173} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:32,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:22:32,274 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:32,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:32,276 INFO L168 Benchmark]: Toolchain (without parser) took 19412.97 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.4 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 391.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,277 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:32,277 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,278 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.29 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:22:32,278 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,279 INFO L168 Benchmark]: RCFGBuilder took 773.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,280 INFO L168 Benchmark]: TraceAbstraction took 17612.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 384.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.2 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,280 INFO L168 Benchmark]: Witness Printer took 118.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:32,283 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 800.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.29 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. * Boogie Preprocessor took 38.61 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 773.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17612.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 384.3 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -42.2 MB). Peak memory consumption was 342.1 MB. Max. memory is 11.5 GB. * Witness Printer took 118.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] FCALL, FORK 0 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1773 SDtfs, 1753 SDslu, 3750 SDs, 0 SdLazy, 3975 SolverSat, 147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 36 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9738occurred 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: 2.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 9000 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 62764 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...