./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe034_power.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/safe034_power.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 94c30b03abcf537a9921859f2e2c5b65ca6ab6e8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:33:45,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:45,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:45,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:45,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:45,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:45,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:45,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:45,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:46,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:46,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:46,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:46,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:46,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:46,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:46,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:46,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:46,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:46,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:46,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:46,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:46,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:46,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:46,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:46,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:46,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:46,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:46,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:46,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:46,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:46,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:46,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:46,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:46,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:46,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:46,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:46,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:46,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:46,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:46,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:46,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:46,056 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:33:46,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:46,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:46,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:46,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:46,076 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:46,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:46,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:46,077 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:46,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:46,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:46,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:46,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:46,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:46,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:46,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:46,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:46,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:46,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:46,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:46,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:46,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:46,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:46,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:46,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:46,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:46,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:46,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:46,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:46,083 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:46,083 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 -> 94c30b03abcf537a9921859f2e2c5b65ca6ab6e8 [2019-11-28 18:33:46,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:46,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:46,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:46,415 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:46,415 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:46,416 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe034_power.oepc.i [2019-11-28 18:33:46,486 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ed0a9df/8fa437e6a6994330807f87f53a89302c/FLAGa3ac10c69 [2019-11-28 18:33:47,004 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:47,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe034_power.oepc.i [2019-11-28 18:33:47,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ed0a9df/8fa437e6a6994330807f87f53a89302c/FLAGa3ac10c69 [2019-11-28 18:33:47,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64ed0a9df/8fa437e6a6994330807f87f53a89302c [2019-11-28 18:33:47,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:47,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:47,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:47,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:47,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:47,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:47" (1/1) ... [2019-11-28 18:33:47,375 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:33:47, skipping insertion in model container [2019-11-28 18:33:47,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:47" (1/1) ... [2019-11-28 18:33:47,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:47,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:48,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:48,049 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:48,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:48,189 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:48,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48 WrapperNode [2019-11-28 18:33:48,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:48,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:48,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:48,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:48,202 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:33:48" (1/1) ... [2019-11-28 18:33:48,221 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:33:48" (1/1) ... [2019-11-28 18:33:48,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:48,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:48,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:48,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:48,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (1/1) ... [2019-11-28 18:33:48,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:48,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:48,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:48,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:48,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (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:33:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:48,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:48,370 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:48,370 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:33:48,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:33:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:48,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:48,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:48,374 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:33:49,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:49,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:49,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49 BoogieIcfgContainer [2019-11-28 18:33:49,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:49,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:49,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:49,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:49,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:47" (1/3) ... [2019-11-28 18:33:49,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721bb9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:49, skipping insertion in model container [2019-11-28 18:33:49,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:48" (2/3) ... [2019-11-28 18:33:49,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721bb9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:49, skipping insertion in model container [2019-11-28 18:33:49,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49" (3/3) ... [2019-11-28 18:33:49,161 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-11-28 18:33:49,172 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:49,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:49,182 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:49,183 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:49,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,222 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,227 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,227 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,273 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,280 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:49,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-28 18:33:49,337 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:49,338 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:49,338 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:49,338 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:49,338 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:49,339 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:49,339 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:49,339 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:49,365 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-11-28 18:33:49,367 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:49,488 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:49,488 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:49,509 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:49,535 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-11-28 18:33:49,583 INFO L134 PetriNetUnfolder]: 35/173 cut-off events. [2019-11-28 18:33:49,583 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:49,592 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 560 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-11-28 18:33:49,612 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-11-28 18:33:49,614 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:54,052 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:33:54,201 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:33:54,383 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-11-28 18:33:54,383 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-11-28 18:33:54,387 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-11-28 18:33:56,108 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-11-28 18:33:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-11-28 18:33:56,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 18:33:56,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:56,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:56,119 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-11-28 18:33:56,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:56,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148905421] [2019-11-28 18:33:56,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:56,495 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:33:56,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148905421] [2019-11-28 18:33:56,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:56,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:56,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156781740] [2019-11-28 18:33:56,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:56,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:56,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:56,537 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-11-28 18:33:56,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:56,926 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-11-28 18:33:56,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:56,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-28 18:33:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:57,075 INFO L225 Difference]: With dead ends: 13722 [2019-11-28 18:33:57,075 INFO L226 Difference]: Without dead ends: 12214 [2019-11-28 18:33:57,077 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:33:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-11-28 18:33:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-11-28 18:33:58,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-11-28 18:33:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-11-28 18:33:58,143 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-11-28 18:33:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:58,144 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-11-28 18:33:58,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-11-28 18:33:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 18:33:58,157 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:58,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:58,158 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-11-28 18:33:58,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:58,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856251456] [2019-11-28 18:33:58,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:58,346 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:33:58,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856251456] [2019-11-28 18:33:58,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:58,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:58,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394406885] [2019-11-28 18:33:58,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:58,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:58,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:58,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:58,350 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-11-28 18:33:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:58,798 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-11-28 18:33:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:58,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-28 18:33:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:58,906 INFO L225 Difference]: With dead ends: 18446 [2019-11-28 18:33:58,906 INFO L226 Difference]: Without dead ends: 18390 [2019-11-28 18:33:58,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-11-28 18:33:59,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-11-28 18:33:59,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-11-28 18:33:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-11-28 18:33:59,937 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-11-28 18:33:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:59,938 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-11-28 18:33:59,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-11-28 18:33:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:33:59,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:59,948 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:33:59,948 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-11-28 18:33:59,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:59,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529637489] [2019-11-28 18:33:59,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:00,084 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:34:00,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529637489] [2019-11-28 18:34:00,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:00,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:00,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953653293] [2019-11-28 18:34:00,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:34:00,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:34:00,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:00,086 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-11-28 18:34:00,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:00,498 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-11-28 18:34:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:34:00,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 18:34:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:00,621 INFO L225 Difference]: With dead ends: 24000 [2019-11-28 18:34:00,622 INFO L226 Difference]: Without dead ends: 23924 [2019-11-28 18:34:00,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-11-28 18:34:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-11-28 18:34:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-11-28 18:34:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-11-28 18:34:01,483 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-11-28 18:34:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:01,484 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-11-28 18:34:01,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:01,484 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-11-28 18:34:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:34:01,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:01,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:01,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:01,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-11-28 18:34:01,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:01,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212077829] [2019-11-28 18:34:01,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:01,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:01,567 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:34:01,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212077829] [2019-11-28 18:34:01,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:01,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:34:01,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051472118] [2019-11-28 18:34:01,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:01,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:01,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:01,570 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-11-28 18:34:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:01,717 INFO L93 Difference]: Finished difference Result 19280 states and 70741 transitions. [2019-11-28 18:34:01,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:01,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:34:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:01,786 INFO L225 Difference]: With dead ends: 19280 [2019-11-28 18:34:01,786 INFO L226 Difference]: Without dead ends: 19280 [2019-11-28 18:34:01,787 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:34:02,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19280 states. [2019-11-28 18:34:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19280 to 19016. [2019-11-28 18:34:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19016 states. [2019-11-28 18:34:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19016 states to 19016 states and 69841 transitions. [2019-11-28 18:34:02,801 INFO L78 Accepts]: Start accepts. Automaton has 19016 states and 69841 transitions. Word has length 18 [2019-11-28 18:34:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:02,802 INFO L462 AbstractCegarLoop]: Abstraction has 19016 states and 69841 transitions. [2019-11-28 18:34:02,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 19016 states and 69841 transitions. [2019-11-28 18:34:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:34:02,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:02,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:02,812 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:02,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:02,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2086322840, now seen corresponding path program 1 times [2019-11-28 18:34:02,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:02,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355246514] [2019-11-28 18:34:02,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:02,934 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:34:02,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355246514] [2019-11-28 18:34:02,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:02,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:34:02,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708641120] [2019-11-28 18:34:02,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:02,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:02,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:02,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:02,937 INFO L87 Difference]: Start difference. First operand 19016 states and 69841 transitions. Second operand 3 states. [2019-11-28 18:34:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:03,086 INFO L93 Difference]: Finished difference Result 26927 states and 94091 transitions. [2019-11-28 18:34:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:03,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:34:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:03,146 INFO L225 Difference]: With dead ends: 26927 [2019-11-28 18:34:03,146 INFO L226 Difference]: Without dead ends: 26295 [2019-11-28 18:34:03,146 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:34:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26295 states. [2019-11-28 18:34:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26295 to 25562. [2019-11-28 18:34:04,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2019-11-28 18:34:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 90430 transitions. [2019-11-28 18:34:04,397 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 90430 transitions. Word has length 18 [2019-11-28 18:34:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:04,397 INFO L462 AbstractCegarLoop]: Abstraction has 25562 states and 90430 transitions. [2019-11-28 18:34:04,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 90430 transitions. [2019-11-28 18:34:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:34:04,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:04,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:04,409 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:04,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:04,409 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-11-28 18:34:04,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:04,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702175872] [2019-11-28 18:34:04,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:04,471 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:34:04,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702175872] [2019-11-28 18:34:04,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:04,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:34:04,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314237765] [2019-11-28 18:34:04,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:34:04,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:04,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:34:04,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:34:04,473 INFO L87 Difference]: Start difference. First operand 25562 states and 90430 transitions. Second operand 5 states. [2019-11-28 18:34:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:04,548 INFO L93 Difference]: Finished difference Result 4382 states and 12860 transitions. [2019-11-28 18:34:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:04,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 18:34:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:04,556 INFO L225 Difference]: With dead ends: 4382 [2019-11-28 18:34:04,556 INFO L226 Difference]: Without dead ends: 2858 [2019-11-28 18:34:04,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-11-28 18:34:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2858. [2019-11-28 18:34:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2019-11-28 18:34:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 7333 transitions. [2019-11-28 18:34:04,612 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 7333 transitions. Word has length 19 [2019-11-28 18:34:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:04,613 INFO L462 AbstractCegarLoop]: Abstraction has 2858 states and 7333 transitions. [2019-11-28 18:34:04,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:34:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 7333 transitions. [2019-11-28 18:34:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:04,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:04,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:04,619 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:04,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:04,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-11-28 18:34:04,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:04,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531965964] [2019-11-28 18:34:04,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:04,663 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:34:04,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531965964] [2019-11-28 18:34:04,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:04,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:04,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027741590] [2019-11-28 18:34:04,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:04,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:04,666 INFO L87 Difference]: Start difference. First operand 2858 states and 7333 transitions. Second operand 3 states. [2019-11-28 18:34:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:04,735 INFO L93 Difference]: Finished difference Result 3915 states and 9708 transitions. [2019-11-28 18:34:04,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:04,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 18:34:04,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:04,745 INFO L225 Difference]: With dead ends: 3915 [2019-11-28 18:34:04,745 INFO L226 Difference]: Without dead ends: 3915 [2019-11-28 18:34:04,747 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:34:04,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2019-11-28 18:34:04,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3005. [2019-11-28 18:34:04,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3005 states. [2019-11-28 18:34:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3005 states to 3005 states and 7535 transitions. [2019-11-28 18:34:04,809 INFO L78 Accepts]: Start accepts. Automaton has 3005 states and 7535 transitions. Word has length 29 [2019-11-28 18:34:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:04,810 INFO L462 AbstractCegarLoop]: Abstraction has 3005 states and 7535 transitions. [2019-11-28 18:34:04,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3005 states and 7535 transitions. [2019-11-28 18:34:04,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 18:34:04,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:04,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:04,816 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-11-28 18:34:04,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:04,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141013486] [2019-11-28 18:34:04,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:04,934 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:34:04,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141013486] [2019-11-28 18:34:04,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:04,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:34:04,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059538412] [2019-11-28 18:34:04,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:34:04,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:34:04,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:34:04,943 INFO L87 Difference]: Start difference. First operand 3005 states and 7535 transitions. Second operand 6 states. [2019-11-28 18:34:05,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,032 INFO L93 Difference]: Finished difference Result 1871 states and 4845 transitions. [2019-11-28 18:34:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:34:05,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-11-28 18:34:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,036 INFO L225 Difference]: With dead ends: 1871 [2019-11-28 18:34:05,036 INFO L226 Difference]: Without dead ends: 1747 [2019-11-28 18:34:05,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:34:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2019-11-28 18:34:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1256. [2019-11-28 18:34:05,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1256 states. [2019-11-28 18:34:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 3372 transitions. [2019-11-28 18:34:05,055 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 3372 transitions. Word has length 29 [2019-11-28 18:34:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,055 INFO L462 AbstractCegarLoop]: Abstraction has 1256 states and 3372 transitions. [2019-11-28 18:34:05,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:34:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 3372 transitions. [2019-11-28 18:34:05,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:05,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:05,060 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-11-28 18:34:05,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822747990] [2019-11-28 18:34:05,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,102 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:34:05,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822747990] [2019-11-28 18:34:05,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:05,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899759692] [2019-11-28 18:34:05,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:34:05,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:34:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:34:05,108 INFO L87 Difference]: Start difference. First operand 1256 states and 3372 transitions. Second operand 3 states. [2019-11-28 18:34:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,150 INFO L93 Difference]: Finished difference Result 1456 states and 3760 transitions. [2019-11-28 18:34:05,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:34:05,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-28 18:34:05,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,153 INFO L225 Difference]: With dead ends: 1456 [2019-11-28 18:34:05,153 INFO L226 Difference]: Without dead ends: 1456 [2019-11-28 18:34:05,154 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:34:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2019-11-28 18:34:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1308. [2019-11-28 18:34:05,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-11-28 18:34:05,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 3424 transitions. [2019-11-28 18:34:05,176 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 3424 transitions. Word has length 45 [2019-11-28 18:34:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,177 INFO L462 AbstractCegarLoop]: Abstraction has 1308 states and 3424 transitions. [2019-11-28 18:34:05,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:34:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 3424 transitions. [2019-11-28 18:34:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:05,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,181 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:05,181 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-11-28 18:34:05,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060926596] [2019-11-28 18:34:05,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,282 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:34:05,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060926596] [2019-11-28 18:34:05,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:05,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792298636] [2019-11-28 18:34:05,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:05,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:05,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:05,285 INFO L87 Difference]: Start difference. First operand 1308 states and 3424 transitions. Second operand 4 states. [2019-11-28 18:34:05,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:05,307 INFO L93 Difference]: Finished difference Result 1845 states and 4579 transitions. [2019-11-28 18:34:05,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:34:05,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:05,310 INFO L225 Difference]: With dead ends: 1845 [2019-11-28 18:34:05,310 INFO L226 Difference]: Without dead ends: 1192 [2019-11-28 18:34:05,311 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:34:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-11-28 18:34:05,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-11-28 18:34:05,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-11-28 18:34:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-11-28 18:34:05,335 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-11-28 18:34:05,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:05,335 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-11-28 18:34:05,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-11-28 18:34:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:05,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:05,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:05,342 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:05,343 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 2 times [2019-11-28 18:34:05,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:05,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977687375] [2019-11-28 18:34:05,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:05,609 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:34:05,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977687375] [2019-11-28 18:34:05,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:05,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:34:05,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626840294] [2019-11-28 18:34:05,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:34:05,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:34:05,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:34:05,615 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-11-28 18:34:06,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,053 INFO L93 Difference]: Finished difference Result 3292 states and 8482 transitions. [2019-11-28 18:34:06,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 18:34:06,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 18:34:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,061 INFO L225 Difference]: With dead ends: 3292 [2019-11-28 18:34:06,061 INFO L226 Difference]: Without dead ends: 2736 [2019-11-28 18:34:06,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-28 18:34:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-11-28 18:34:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1608. [2019-11-28 18:34:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-11-28 18:34:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 4035 transitions. [2019-11-28 18:34:06,102 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 4035 transitions. Word has length 45 [2019-11-28 18:34:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,102 INFO L462 AbstractCegarLoop]: Abstraction has 1608 states and 4035 transitions. [2019-11-28 18:34:06,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:34:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 4035 transitions. [2019-11-28 18:34:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:06,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,107 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:06,108 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -228434578, now seen corresponding path program 3 times [2019-11-28 18:34:06,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976552782] [2019-11-28 18:34:06,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:34:06,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:34:06,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976552782] [2019-11-28 18:34:06,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:34:06,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:34:06,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410532102] [2019-11-28 18:34:06,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:34:06,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:34:06,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:34:06,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:34:06,273 INFO L87 Difference]: Start difference. First operand 1608 states and 4035 transitions. Second operand 4 states. [2019-11-28 18:34:06,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:34:06,307 INFO L93 Difference]: Finished difference Result 2137 states and 5208 transitions. [2019-11-28 18:34:06,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:34:06,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-28 18:34:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:34:06,311 INFO L225 Difference]: With dead ends: 2137 [2019-11-28 18:34:06,311 INFO L226 Difference]: Without dead ends: 1667 [2019-11-28 18:34:06,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34:06,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2019-11-28 18:34:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1264. [2019-11-28 18:34:06,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1264 states. [2019-11-28 18:34:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 3174 transitions. [2019-11-28 18:34:06,334 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 3174 transitions. Word has length 45 [2019-11-28 18:34:06,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:34:06,334 INFO L462 AbstractCegarLoop]: Abstraction has 1264 states and 3174 transitions. [2019-11-28 18:34:06,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:34:06,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 3174 transitions. [2019-11-28 18:34:06,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 18:34:06,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:34:06,339 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:34:06,339 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:34:06,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:34:06,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 4 times [2019-11-28 18:34:06,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:34:06,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016552687] [2019-11-28 18:34:06,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:34:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:34:06,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:34:06,531 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:34:06,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31| 1) |v_#valid_66|) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31|) |v_ULTIMATE.start_main_~#t2577~0.offset_22| 0)) |v_#memory_int_23|) (= v_~z~0_143 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31|) 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2577~0.base_31|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_31| 4)) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_22|) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_22|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_31|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_31|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:06,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-11-28 18:34:06,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:34:06,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:06,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:06,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1404050155 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1404050155 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1404050155 256))) (= (mod ~y$w_buff0_used~0_In1404050155 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1404050155 256)) .cse0))) (= ~y$w_buff0~0_In1404050155 |P1Thread1of1ForFork1_#t~ite8_Out1404050155|) .cse1 (= |P1Thread1of1ForFork1_#t~ite8_Out1404050155| |P1Thread1of1ForFork1_#t~ite9_Out1404050155|)) (and (= |P1Thread1of1ForFork1_#t~ite8_In1404050155| |P1Thread1of1ForFork1_#t~ite8_Out1404050155|) (= ~y$w_buff0~0_In1404050155 |P1Thread1of1ForFork1_#t~ite9_Out1404050155|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1404050155, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$w_buff0~0=~y$w_buff0~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1404050155|, ~weak$$choice2~0=~weak$$choice2~0_In1404050155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404050155} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1404050155, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1404050155|, ~y$w_buff0~0=~y$w_buff0~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1404050155|, ~weak$$choice2~0=~weak$$choice2~0_In1404050155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404050155} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:06,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In223657384 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In223657384| |P1Thread1of1ForFork1_#t~ite14_Out223657384|) (= |P1Thread1of1ForFork1_#t~ite15_Out223657384| ~y$w_buff0_used~0_In223657384) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out223657384| |P1Thread1of1ForFork1_#t~ite14_Out223657384|) .cse0 (= ~y$w_buff0_used~0_In223657384 |P1Thread1of1ForFork1_#t~ite14_Out223657384|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In223657384 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In223657384 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In223657384 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In223657384 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223657384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223657384, ~weak$$choice2~0=~weak$$choice2~0_In223657384, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In223657384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223657384} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223657384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223657384, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out223657384|, ~weak$$choice2~0=~weak$$choice2~0_In223657384, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out223657384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223657384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:06,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:34:06,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In667092816 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In667092816 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out667092816| ~y$w_buff0_used~0_In667092816)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out667092816| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In667092816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In667092816} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In667092816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In667092816, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out667092816|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:06,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:06,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-969218201 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-969218201 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-969218201 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-969218201 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-969218201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out-969218201| ~y$w_buff1_used~0_In-969218201)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-969218201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969218201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-969218201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969218201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-969218201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969218201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-969218201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-969218201|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969218201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:06,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-1507379609 ~y$r_buff0_thd3~0_Out-1507379609)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1507379609 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1507379609 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out-1507379609) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507379609, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1507379609} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507379609, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1507379609|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1507379609} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:06,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-844393242 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-844393242 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-844393242 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-844393242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-844393242|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-844393242 |P2Thread1of1ForFork2_#t~ite31_Out-844393242|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-844393242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-844393242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-844393242} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-844393242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-844393242|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-844393242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-844393242} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:06,554 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:34:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In45929107 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In45929107 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In45929107 |ULTIMATE.start_main_#t~ite35_Out45929107|)) (and (= ~y~0_In45929107 |ULTIMATE.start_main_#t~ite35_Out45929107|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In45929107, ~y~0=~y~0_In45929107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} OutVars{~y$w_buff1~0=~y$w_buff1~0_In45929107, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out45929107|, ~y~0=~y~0_In45929107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1331106573 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1331106573 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out1331106573|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1331106573 |ULTIMATE.start_main_#t~ite37_Out1331106573|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331106573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331106573, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1331106573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:06,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1580840660 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1580840660 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1580840660 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1580840660 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1580840660| ~y$w_buff1_used~0_In1580840660) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out1580840660| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580840660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580840660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580840660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580840660} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580840660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580840660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1580840660|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580840660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580840660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1679647422 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1679647422 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out1679647422|)) (and (= ~y$r_buff0_thd0~0_In1679647422 |ULTIMATE.start_main_#t~ite39_Out1679647422|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679647422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1679647422|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679647422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:06,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1071163343 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1071163343 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1071163343 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1071163343 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1071163343| ~y$r_buff1_thd0~0_In1071163343)) (and (= |ULTIMATE.start_main_#t~ite40_Out1071163343| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1071163343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1071163343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1071163343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071163343} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1071163343|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1071163343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1071163343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1071163343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071163343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:06,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:34:06,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:34:06 BasicIcfg [2019-11-28 18:34:06,671 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:34:06,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:34:06,672 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:34:06,672 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:34:06,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:49" (3/4) ... [2019-11-28 18:34:06,675 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:34:06,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31| 1) |v_#valid_66|) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31|) |v_ULTIMATE.start_main_~#t2577~0.offset_22| 0)) |v_#memory_int_23|) (= v_~z~0_143 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31|) 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2577~0.base_31|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_31| 4)) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_22|) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_22|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_31|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_31|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:06,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-11-28 18:34:06,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-11-28 18:34:06,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= v_P2Thread1of1ForFork2_~arg.offset_14 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_113 256) 0)) (not (= 0 (mod v_~y$w_buff1_used~0_71 256))))) 1 0)) (not (= 0 v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16)) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_14) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_14, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_14, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_14|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_16, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:34:06,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-11-28 18:34:06,681 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1404050155 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1404050155 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1404050155 256))) (= (mod ~y$w_buff0_used~0_In1404050155 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In1404050155 256)) .cse0))) (= ~y$w_buff0~0_In1404050155 |P1Thread1of1ForFork1_#t~ite8_Out1404050155|) .cse1 (= |P1Thread1of1ForFork1_#t~ite8_Out1404050155| |P1Thread1of1ForFork1_#t~ite9_Out1404050155|)) (and (= |P1Thread1of1ForFork1_#t~ite8_In1404050155| |P1Thread1of1ForFork1_#t~ite8_Out1404050155|) (= ~y$w_buff0~0_In1404050155 |P1Thread1of1ForFork1_#t~ite9_Out1404050155|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1404050155, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, ~y$w_buff0~0=~y$w_buff0~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In1404050155|, ~weak$$choice2~0=~weak$$choice2~0_In1404050155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404050155} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1404050155, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1404050155, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1404050155|, ~y$w_buff0~0=~y$w_buff0~0_In1404050155, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1404050155, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1404050155|, ~weak$$choice2~0=~weak$$choice2~0_In1404050155, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1404050155} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-11-28 18:34:06,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In223657384 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In223657384| |P1Thread1of1ForFork1_#t~ite14_Out223657384|) (= |P1Thread1of1ForFork1_#t~ite15_Out223657384| ~y$w_buff0_used~0_In223657384) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out223657384| |P1Thread1of1ForFork1_#t~ite14_Out223657384|) .cse0 (= ~y$w_buff0_used~0_In223657384 |P1Thread1of1ForFork1_#t~ite14_Out223657384|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In223657384 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In223657384 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In223657384 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In223657384 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223657384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223657384, ~weak$$choice2~0=~weak$$choice2~0_In223657384, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In223657384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223657384} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In223657384, ~y$w_buff0_used~0=~y$w_buff0_used~0_In223657384, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In223657384, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out223657384|, ~weak$$choice2~0=~weak$$choice2~0_In223657384, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out223657384|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In223657384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:34:06,685 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_14|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:34:06,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In667092816 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In667092816 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out667092816| ~y$w_buff0_used~0_In667092816)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite28_Out667092816| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In667092816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In667092816} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In667092816, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In667092816, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out667092816|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-11-28 18:34:06,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-11-28 18:34:06,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-969218201 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-969218201 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-969218201 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-969218201 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_Out-969218201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite29_Out-969218201| ~y$w_buff1_used~0_In-969218201)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-969218201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969218201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-969218201, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969218201} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-969218201, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-969218201, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-969218201, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-969218201|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-969218201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-11-28 18:34:06,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_In-1507379609 ~y$r_buff0_thd3~0_Out-1507379609)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1507379609 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1507379609 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= 0 ~y$r_buff0_thd3~0_Out-1507379609) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507379609, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1507379609} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1507379609, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1507379609|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1507379609} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-11-28 18:34:06,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-844393242 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-844393242 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-844393242 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-844393242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite31_Out-844393242|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd3~0_In-844393242 |P2Thread1of1ForFork2_#t~ite31_Out-844393242|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-844393242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-844393242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-844393242} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-844393242, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-844393242, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out-844393242|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-844393242, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-844393242} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-11-28 18:34:06,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite31_36| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-11-28 18:34:06,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:34:06,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In45929107 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In45929107 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In45929107 |ULTIMATE.start_main_#t~ite35_Out45929107|)) (and (= ~y~0_In45929107 |ULTIMATE.start_main_#t~ite35_Out45929107|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In45929107, ~y~0=~y~0_In45929107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} OutVars{~y$w_buff1~0=~y$w_buff1~0_In45929107, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out45929107|, ~y~0=~y~0_In45929107, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In45929107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In45929107} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-11-28 18:34:06,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-11-28 18:34:06,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1331106573 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1331106573 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite37_Out1331106573|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1331106573 |ULTIMATE.start_main_#t~ite37_Out1331106573|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331106573} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1331106573, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1331106573, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1331106573|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:34:06,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1580840660 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1580840660 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1580840660 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In1580840660 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out1580840660| ~y$w_buff1_used~0_In1580840660) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite38_Out1580840660| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1580840660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580840660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580840660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580840660} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1580840660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1580840660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1580840660|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1580840660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1580840660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:34:06,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1679647422 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1679647422 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite39_Out1679647422|)) (and (= ~y$r_buff0_thd0~0_In1679647422 |ULTIMATE.start_main_#t~ite39_Out1679647422|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679647422} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1679647422, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1679647422|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1679647422} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:34:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd0~0_In1071163343 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1071163343 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1071163343 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1071163343 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite40_Out1071163343| ~y$r_buff1_thd0~0_In1071163343)) (and (= |ULTIMATE.start_main_#t~ite40_Out1071163343| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1071163343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1071163343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1071163343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071163343} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1071163343|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1071163343, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1071163343, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1071163343, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1071163343} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:34:06,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:34:06,801 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:34:06,801 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:34:06,803 INFO L168 Benchmark]: Toolchain (without parser) took 19439.72 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 925.4 MB). Free memory was 946.9 MB in the beginning and 974.4 MB in the end (delta: -27.4 MB). Peak memory consumption was 897.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,805 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:34:06,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.33 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,813 INFO L168 Benchmark]: Boogie Preprocessor took 42.14 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:34:06,814 INFO L168 Benchmark]: RCFGBuilder took 853.79 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,814 INFO L168 Benchmark]: TraceAbstraction took 17519.74 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 777.5 MB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 73.8 MB). Peak memory consumption was 851.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,817 INFO L168 Benchmark]: Witness Printer took 129.69 ms. Allocated memory is still 2.0 GB. Free memory was 992.7 MB in the beginning and 974.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:34:06,822 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 826.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.33 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 853.79 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17519.74 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 777.5 MB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 73.8 MB). Peak memory consumption was 851.3 MB. Max. memory is 11.5 GB. * Witness Printer took 129.69 ms. Allocated memory is still 2.0 GB. Free memory was 992.7 MB in the beginning and 974.4 MB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 17.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1276 SDtfs, 1750 SDslu, 2038 SDs, 0 SdLazy, 584 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25562occurred 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: 5.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 9389 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 374 NumberOfCodeBlocks, 374 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 58027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...