./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi008_rmo.opt.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/rfi008_rmo.opt.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 a46eb3d1e7cc43c3a429eb36fe7247888935160c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:23:45,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:45,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:45,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:45,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:45,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:45,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:45,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:45,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:45,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:45,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:45,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:45,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:45,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:45,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:45,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:45,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:45,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:45,968 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:45,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:45,978 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:45,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:45,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:45,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:45,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:45,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:45,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:45,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:45,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:45,995 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:45,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:45,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:45,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:45,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:46,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:46,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:46,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:46,003 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:46,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:46,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:46,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:46,009 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:23:46,030 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:46,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:46,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:46,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:46,033 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:46,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:46,033 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:46,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:46,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:46,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:46,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:46,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:46,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:46,035 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:46,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:46,035 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:46,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:46,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:46,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:46,036 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:46,036 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:46,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:46,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:46,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:46,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:46,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:46,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:46,038 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:46,038 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:46,038 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 -> a46eb3d1e7cc43c3a429eb36fe7247888935160c [2019-11-28 18:23:46,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:46,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:46,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:46,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:46,346 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:46,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi008_rmo.opt.i [2019-11-28 18:23:46,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9542edb24/225a7e0107c44bd59b4e71fae3df5aff/FLAG7a41e9ec1 [2019-11-28 18:23:46,989 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:46,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi008_rmo.opt.i [2019-11-28 18:23:47,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9542edb24/225a7e0107c44bd59b4e71fae3df5aff/FLAG7a41e9ec1 [2019-11-28 18:23:47,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9542edb24/225a7e0107c44bd59b4e71fae3df5aff [2019-11-28 18:23:47,250 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:47,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:47,254 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:47,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:47,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:47,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:47" (1/1) ... [2019-11-28 18:23:47,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aca8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:47, skipping insertion in model container [2019-11-28 18:23:47,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:47" (1/1) ... [2019-11-28 18:23:47,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:47,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:47,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:47,943 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:48,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:48,086 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:48,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48 WrapperNode [2019-11-28 18:23:48,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:48,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:48,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:48,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:48,098 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:23:48" (1/1) ... [2019-11-28 18:23:48,120 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:23:48" (1/1) ... [2019-11-28 18:23:48,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:48,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:48,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:48,155 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:48,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (1/1) ... [2019-11-28 18:23:48,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:48,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:48,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:48,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:48,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23: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:23:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:48,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:48,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:48,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:48,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:48,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:48,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:48,282 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:23:49,117 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:49,117 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:49,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:49 BoogieIcfgContainer [2019-11-28 18:23:49,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:49,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:49,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:49,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:49,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:47" (1/3) ... [2019-11-28 18:23:49,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:49, skipping insertion in model container [2019-11-28 18:23:49,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:48" (2/3) ... [2019-11-28 18:23:49,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133e3132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:49, skipping insertion in model container [2019-11-28 18:23:49,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:49" (3/3) ... [2019-11-28 18:23:49,134 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_rmo.opt.i [2019-11-28 18:23:49,145 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:49,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:49,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:49,158 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:49,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,264 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,265 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:49,325 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:49,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:49,350 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:49,350 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:49,350 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:49,350 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:49,351 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:49,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:49,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:49,376 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-11-28 18:23:49,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 18:23:49,482 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 18:23:49,482 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:49,506 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:23:49,544 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-11-28 18:23:49,608 INFO L134 PetriNetUnfolder]: 56/226 cut-off events. [2019-11-28 18:23:49,608 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:49,621 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 920 event pairs. 6/174 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-11-28 18:23:49,652 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-11-28 18:23:49,653 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:54,518 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 18:23:54,780 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:23:54,890 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:23:54,952 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125257 [2019-11-28 18:23:54,953 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-11-28 18:23:54,956 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 129 transitions [2019-11-28 18:23:57,366 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25272 states. [2019-11-28 18:23:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states. [2019-11-28 18:23:57,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:23:57,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:57,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:23:57,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:57,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 961433507, now seen corresponding path program 1 times [2019-11-28 18:23:57,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:57,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662990545] [2019-11-28 18:23:57,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:57,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:23:57,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662990545] [2019-11-28 18:23:57,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:57,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:57,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142089727] [2019-11-28 18:23:57,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:57,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:57,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:57,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:57,634 INFO L87 Difference]: Start difference. First operand 25272 states. Second operand 3 states. [2019-11-28 18:23:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:58,228 INFO L93 Difference]: Finished difference Result 25080 states and 89817 transitions. [2019-11-28 18:23:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:58,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:23:58,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:58,497 INFO L225 Difference]: With dead ends: 25080 [2019-11-28 18:23:58,497 INFO L226 Difference]: Without dead ends: 23470 [2019-11-28 18:23:58,505 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:23:59,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23470 states. [2019-11-28 18:23:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23470 to 23470. [2019-11-28 18:23:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23470 states. [2019-11-28 18:23:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23470 states to 23470 states and 83991 transitions. [2019-11-28 18:23:59,974 INFO L78 Accepts]: Start accepts. Automaton has 23470 states and 83991 transitions. Word has length 5 [2019-11-28 18:23:59,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:59,975 INFO L462 AbstractCegarLoop]: Abstraction has 23470 states and 83991 transitions. [2019-11-28 18:23:59,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23470 states and 83991 transitions. [2019-11-28 18:23:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:59,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:59,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:59,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:59,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:59,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1303916439, now seen corresponding path program 1 times [2019-11-28 18:23:59,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:59,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204009931] [2019-11-28 18:23:59,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:00,119 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:24:00,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204009931] [2019-11-28 18:24:00,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:00,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:00,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052838881] [2019-11-28 18:24:00,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:00,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:00,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:00,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:00,123 INFO L87 Difference]: Start difference. First operand 23470 states and 83991 transitions. Second operand 4 states. [2019-11-28 18:24:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:00,239 INFO L93 Difference]: Finished difference Result 4442 states and 12820 transitions. [2019-11-28 18:24:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:24:00,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:24:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:00,250 INFO L225 Difference]: With dead ends: 4442 [2019-11-28 18:24:00,251 INFO L226 Difference]: Without dead ends: 2832 [2019-11-28 18:24:00,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2832 states. [2019-11-28 18:24:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2832 to 2832. [2019-11-28 18:24:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-11-28 18:24:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 7079 transitions. [2019-11-28 18:24:00,335 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 7079 transitions. Word has length 11 [2019-11-28 18:24:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:00,335 INFO L462 AbstractCegarLoop]: Abstraction has 2832 states and 7079 transitions. [2019-11-28 18:24:00,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 7079 transitions. [2019-11-28 18:24:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:24:00,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:00,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:00,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:00,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash -273660052, now seen corresponding path program 1 times [2019-11-28 18:24:00,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:00,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070735739] [2019-11-28 18:24:00,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:00,456 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:24:00,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070735739] [2019-11-28 18:24:00,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:00,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:00,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740595895] [2019-11-28 18:24:00,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:00,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:00,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:00,459 INFO L87 Difference]: Start difference. First operand 2832 states and 7079 transitions. Second operand 4 states. [2019-11-28 18:24:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:00,793 INFO L93 Difference]: Finished difference Result 4003 states and 9706 transitions. [2019-11-28 18:24:00,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:00,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:24:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:00,806 INFO L225 Difference]: With dead ends: 4003 [2019-11-28 18:24:00,806 INFO L226 Difference]: Without dead ends: 3988 [2019-11-28 18:24:00,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2019-11-28 18:24:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3892. [2019-11-28 18:24:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3892 states. [2019-11-28 18:24:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 9498 transitions. [2019-11-28 18:24:00,933 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 9498 transitions. Word has length 14 [2019-11-28 18:24:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:00,934 INFO L462 AbstractCegarLoop]: Abstraction has 3892 states and 9498 transitions. [2019-11-28 18:24:00,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 9498 transitions. [2019-11-28 18:24:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:24:00,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:00,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:00,938 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 106501689, now seen corresponding path program 1 times [2019-11-28 18:24:00,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:00,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035898409] [2019-11-28 18:24:00,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:01,007 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:24:01,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035898409] [2019-11-28 18:24:01,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:01,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:01,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644738932] [2019-11-28 18:24:01,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:01,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:01,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:01,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:01,012 INFO L87 Difference]: Start difference. First operand 3892 states and 9498 transitions. Second operand 3 states. [2019-11-28 18:24:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:01,111 INFO L93 Difference]: Finished difference Result 6646 states and 15406 transitions. [2019-11-28 18:24:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:01,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 18:24:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:01,130 INFO L225 Difference]: With dead ends: 6646 [2019-11-28 18:24:01,130 INFO L226 Difference]: Without dead ends: 6642 [2019-11-28 18:24:01,131 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:24:01,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6642 states. [2019-11-28 18:24:01,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6642 to 5931. [2019-11-28 18:24:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-11-28 18:24:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13936 transitions. [2019-11-28 18:24:01,297 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13936 transitions. Word has length 15 [2019-11-28 18:24:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:01,297 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13936 transitions. [2019-11-28 18:24:01,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:01,297 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13936 transitions. [2019-11-28 18:24:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:24:01,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:01,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:01,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:01,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:01,300 INFO L82 PathProgramCache]: Analyzing trace with hash -717781961, now seen corresponding path program 1 times [2019-11-28 18:24:01,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:01,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552639444] [2019-11-28 18:24:01,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:01,391 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:24:01,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552639444] [2019-11-28 18:24:01,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:01,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:01,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543231858] [2019-11-28 18:24:01,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:24:01,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:01,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:24:01,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:24:01,393 INFO L87 Difference]: Start difference. First operand 5931 states and 13936 transitions. Second operand 4 states. [2019-11-28 18:24:01,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:01,677 INFO L93 Difference]: Finished difference Result 7446 states and 17184 transitions. [2019-11-28 18:24:01,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:01,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:24:01,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:01,708 INFO L225 Difference]: With dead ends: 7446 [2019-11-28 18:24:01,709 INFO L226 Difference]: Without dead ends: 7418 [2019-11-28 18:24:01,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7418 states. [2019-11-28 18:24:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7418 to 5909. [2019-11-28 18:24:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5909 states. [2019-11-28 18:24:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5909 states to 5909 states and 13876 transitions. [2019-11-28 18:24:01,857 INFO L78 Accepts]: Start accepts. Automaton has 5909 states and 13876 transitions. Word has length 17 [2019-11-28 18:24:01,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:01,858 INFO L462 AbstractCegarLoop]: Abstraction has 5909 states and 13876 transitions. [2019-11-28 18:24:01,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:24:01,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5909 states and 13876 transitions. [2019-11-28 18:24:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:24:01,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:01,864 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:01,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2019815131, now seen corresponding path program 1 times [2019-11-28 18:24:01,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:01,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664959938] [2019-11-28 18:24:01,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:01,937 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:24:01,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664959938] [2019-11-28 18:24:01,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:01,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:01,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641801546] [2019-11-28 18:24:01,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:01,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:01,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:01,941 INFO L87 Difference]: Start difference. First operand 5909 states and 13876 transitions. Second operand 5 states. [2019-11-28 18:24:02,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:02,436 INFO L93 Difference]: Finished difference Result 8033 states and 18356 transitions. [2019-11-28 18:24:02,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:24:02,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:24:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:02,476 INFO L225 Difference]: With dead ends: 8033 [2019-11-28 18:24:02,476 INFO L226 Difference]: Without dead ends: 8032 [2019-11-28 18:24:02,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:24:02,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-11-28 18:24:02,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7392. [2019-11-28 18:24:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7392 states. [2019-11-28 18:24:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7392 states to 7392 states and 17086 transitions. [2019-11-28 18:24:02,794 INFO L78 Accepts]: Start accepts. Automaton has 7392 states and 17086 transitions. Word has length 28 [2019-11-28 18:24:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:02,794 INFO L462 AbstractCegarLoop]: Abstraction has 7392 states and 17086 transitions. [2019-11-28 18:24:02,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 7392 states and 17086 transitions. [2019-11-28 18:24:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 18:24:02,806 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:02,806 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] [2019-11-28 18:24:02,806 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1401908326, now seen corresponding path program 1 times [2019-11-28 18:24:02,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:02,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433249280] [2019-11-28 18:24:02,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:02,864 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:24:02,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433249280] [2019-11-28 18:24:02,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:02,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:24:02,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78301838] [2019-11-28 18:24:02,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:02,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:02,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:02,867 INFO L87 Difference]: Start difference. First operand 7392 states and 17086 transitions. Second operand 3 states. [2019-11-28 18:24:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:02,943 INFO L93 Difference]: Finished difference Result 7931 states and 17358 transitions. [2019-11-28 18:24:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:02,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 18:24:02,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:02,961 INFO L225 Difference]: With dead ends: 7931 [2019-11-28 18:24:02,961 INFO L226 Difference]: Without dead ends: 7931 [2019-11-28 18:24:02,962 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:24:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7931 states. [2019-11-28 18:24:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7931 to 7375. [2019-11-28 18:24:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2019-11-28 18:24:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16200 transitions. [2019-11-28 18:24:03,111 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16200 transitions. Word has length 31 [2019-11-28 18:24:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:03,112 INFO L462 AbstractCegarLoop]: Abstraction has 7375 states and 16200 transitions. [2019-11-28 18:24:03,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16200 transitions. [2019-11-28 18:24:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:24:03,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:03,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:03,123 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:03,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:03,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1511424135, now seen corresponding path program 1 times [2019-11-28 18:24:03,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:03,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464835383] [2019-11-28 18:24:03,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:03,262 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:24:03,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464835383] [2019-11-28 18:24:03,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:03,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:03,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183012877] [2019-11-28 18:24:03,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:03,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:03,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:03,264 INFO L87 Difference]: Start difference. First operand 7375 states and 16200 transitions. Second operand 5 states. [2019-11-28 18:24:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:03,323 INFO L93 Difference]: Finished difference Result 4784 states and 10410 transitions. [2019-11-28 18:24:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:03,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-28 18:24:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:03,334 INFO L225 Difference]: With dead ends: 4784 [2019-11-28 18:24:03,335 INFO L226 Difference]: Without dead ends: 4500 [2019-11-28 18:24:03,336 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:24:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4500 states. [2019-11-28 18:24:03,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4500 to 3777. [2019-11-28 18:24:03,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3777 states. [2019-11-28 18:24:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 8426 transitions. [2019-11-28 18:24:03,423 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 8426 transitions. Word has length 33 [2019-11-28 18:24:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:03,425 INFO L462 AbstractCegarLoop]: Abstraction has 3777 states and 8426 transitions. [2019-11-28 18:24:03,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 8426 transitions. [2019-11-28 18:24:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:24:03,439 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:03,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:03,439 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:03,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1959930181, now seen corresponding path program 1 times [2019-11-28 18:24:03,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:03,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125393016] [2019-11-28 18:24:03,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:03,575 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:24:03,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125393016] [2019-11-28 18:24:03,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:03,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:24:03,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540861473] [2019-11-28 18:24:03,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:03,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:03,580 INFO L87 Difference]: Start difference. First operand 3777 states and 8426 transitions. Second operand 5 states. [2019-11-28 18:24:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:03,946 INFO L93 Difference]: Finished difference Result 4457 states and 9747 transitions. [2019-11-28 18:24:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:24:03,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-28 18:24:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:03,956 INFO L225 Difference]: With dead ends: 4457 [2019-11-28 18:24:03,957 INFO L226 Difference]: Without dead ends: 4457 [2019-11-28 18:24:03,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4457 states. [2019-11-28 18:24:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4457 to 4205. [2019-11-28 18:24:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4205 states. [2019-11-28 18:24:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4205 states to 4205 states and 9290 transitions. [2019-11-28 18:24:04,037 INFO L78 Accepts]: Start accepts. Automaton has 4205 states and 9290 transitions. Word has length 58 [2019-11-28 18:24:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:04,037 INFO L462 AbstractCegarLoop]: Abstraction has 4205 states and 9290 transitions. [2019-11-28 18:24:04,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 4205 states and 9290 transitions. [2019-11-28 18:24:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 18:24:04,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:04,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:04,050 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2128975279, now seen corresponding path program 2 times [2019-11-28 18:24:04,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:04,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057273118] [2019-11-28 18:24:04,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:04,290 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:24:04,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057273118] [2019-11-28 18:24:04,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:04,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 18:24:04,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631445564] [2019-11-28 18:24:04,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:24:04,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:04,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:24:04,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:24:04,292 INFO L87 Difference]: Start difference. First operand 4205 states and 9290 transitions. Second operand 10 states. [2019-11-28 18:24:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:05,713 INFO L93 Difference]: Finished difference Result 6601 states and 14087 transitions. [2019-11-28 18:24:05,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 18:24:05,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-11-28 18:24:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:05,724 INFO L225 Difference]: With dead ends: 6601 [2019-11-28 18:24:05,724 INFO L226 Difference]: Without dead ends: 6601 [2019-11-28 18:24:05,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:24:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2019-11-28 18:24:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 5105. [2019-11-28 18:24:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5105 states. [2019-11-28 18:24:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5105 states to 5105 states and 11029 transitions. [2019-11-28 18:24:05,830 INFO L78 Accepts]: Start accepts. Automaton has 5105 states and 11029 transitions. Word has length 58 [2019-11-28 18:24:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:05,830 INFO L462 AbstractCegarLoop]: Abstraction has 5105 states and 11029 transitions. [2019-11-28 18:24:05,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:24:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5105 states and 11029 transitions. [2019-11-28 18:24:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:24:05,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:05,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:05,844 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:05,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1338863250, now seen corresponding path program 1 times [2019-11-28 18:24:05,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:05,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781428459] [2019-11-28 18:24:05,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:24:06,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781428459] [2019-11-28 18:24:06,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:06,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:24:06,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497623055] [2019-11-28 18:24:06,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:24:06,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:24:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:24:06,127 INFO L87 Difference]: Start difference. First operand 5105 states and 11029 transitions. Second operand 3 states. [2019-11-28 18:24:06,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:06,162 INFO L93 Difference]: Finished difference Result 5104 states and 11027 transitions. [2019-11-28 18:24:06,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:24:06,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-28 18:24:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:06,173 INFO L225 Difference]: With dead ends: 5104 [2019-11-28 18:24:06,174 INFO L226 Difference]: Without dead ends: 5104 [2019-11-28 18:24:06,174 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:24:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2019-11-28 18:24:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 4887. [2019-11-28 18:24:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4887 states. [2019-11-28 18:24:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4887 states to 4887 states and 10613 transitions. [2019-11-28 18:24:06,279 INFO L78 Accepts]: Start accepts. Automaton has 4887 states and 10613 transitions. Word has length 59 [2019-11-28 18:24:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:06,280 INFO L462 AbstractCegarLoop]: Abstraction has 4887 states and 10613 transitions. [2019-11-28 18:24:06,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:24:06,280 INFO L276 IsEmpty]: Start isEmpty. Operand 4887 states and 10613 transitions. [2019-11-28 18:24:06,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-28 18:24:06,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:06,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:06,292 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:06,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1500804762, now seen corresponding path program 1 times [2019-11-28 18:24:06,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:06,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579110604] [2019-11-28 18:24:06,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:06,367 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:24:06,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579110604] [2019-11-28 18:24:06,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:06,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:06,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76138275] [2019-11-28 18:24:06,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:06,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:06,371 INFO L87 Difference]: Start difference. First operand 4887 states and 10613 transitions. Second operand 5 states. [2019-11-28 18:24:06,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:06,605 INFO L93 Difference]: Finished difference Result 5699 states and 12162 transitions. [2019-11-28 18:24:06,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:24:06,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-11-28 18:24:06,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:06,613 INFO L225 Difference]: With dead ends: 5699 [2019-11-28 18:24:06,613 INFO L226 Difference]: Without dead ends: 5699 [2019-11-28 18:24:06,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:24:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2019-11-28 18:24:06,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4999. [2019-11-28 18:24:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-11-28 18:24:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 10841 transitions. [2019-11-28 18:24:06,708 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 10841 transitions. Word has length 59 [2019-11-28 18:24:06,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:06,708 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 10841 transitions. [2019-11-28 18:24:06,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 10841 transitions. [2019-11-28 18:24:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:06,720 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:06,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:06,720 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2015434593, now seen corresponding path program 1 times [2019-11-28 18:24:06,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:06,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724485381] [2019-11-28 18:24:06,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:07,069 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:24:07,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724485381] [2019-11-28 18:24:07,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:07,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:24:07,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032568791] [2019-11-28 18:24:07,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:24:07,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:24:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:24:07,072 INFO L87 Difference]: Start difference. First operand 4999 states and 10841 transitions. Second operand 9 states. [2019-11-28 18:24:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:08,189 INFO L93 Difference]: Finished difference Result 8750 states and 18663 transitions. [2019-11-28 18:24:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 18:24:08,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2019-11-28 18:24:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:08,198 INFO L225 Difference]: With dead ends: 8750 [2019-11-28 18:24:08,198 INFO L226 Difference]: Without dead ends: 7934 [2019-11-28 18:24:08,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:24:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7934 states. [2019-11-28 18:24:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7934 to 5372. [2019-11-28 18:24:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5372 states. [2019-11-28 18:24:08,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 11805 transitions. [2019-11-28 18:24:08,306 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 11805 transitions. Word has length 60 [2019-11-28 18:24:08,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:08,307 INFO L462 AbstractCegarLoop]: Abstraction has 5372 states and 11805 transitions. [2019-11-28 18:24:08,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:24:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 11805 transitions. [2019-11-28 18:24:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:08,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:08,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:08,319 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:08,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash -348317429, now seen corresponding path program 2 times [2019-11-28 18:24:08,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:08,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148712264] [2019-11-28 18:24:08,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:08,444 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:24:08,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148712264] [2019-11-28 18:24:08,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:08,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:24:08,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322840047] [2019-11-28 18:24:08,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:24:08,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:08,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:24:08,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:24:08,446 INFO L87 Difference]: Start difference. First operand 5372 states and 11805 transitions. Second operand 5 states. [2019-11-28 18:24:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:08,493 INFO L93 Difference]: Finished difference Result 6066 states and 13256 transitions. [2019-11-28 18:24:08,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:24:08,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-11-28 18:24:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:08,495 INFO L225 Difference]: With dead ends: 6066 [2019-11-28 18:24:08,495 INFO L226 Difference]: Without dead ends: 762 [2019-11-28 18:24:08,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:24:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2019-11-28 18:24:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 762. [2019-11-28 18:24:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-11-28 18:24:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1543 transitions. [2019-11-28 18:24:08,509 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1543 transitions. Word has length 60 [2019-11-28 18:24:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:08,510 INFO L462 AbstractCegarLoop]: Abstraction has 762 states and 1543 transitions. [2019-11-28 18:24:08,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:24:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1543 transitions. [2019-11-28 18:24:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:08,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:08,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:08,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:08,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:08,513 INFO L82 PathProgramCache]: Analyzing trace with hash 256933109, now seen corresponding path program 3 times [2019-11-28 18:24:08,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:08,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070976013] [2019-11-28 18:24:08,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:24:08,683 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:24:08,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070976013] [2019-11-28 18:24:08,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:24:08,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:24:08,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180168020] [2019-11-28 18:24:08,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 18:24:08,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:24:08,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 18:24:08,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 18:24:08,685 INFO L87 Difference]: Start difference. First operand 762 states and 1543 transitions. Second operand 8 states. [2019-11-28 18:24:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:24:08,976 INFO L93 Difference]: Finished difference Result 1280 states and 2541 transitions. [2019-11-28 18:24:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:24:08,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-28 18:24:08,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:24:08,978 INFO L225 Difference]: With dead ends: 1280 [2019-11-28 18:24:08,978 INFO L226 Difference]: Without dead ends: 898 [2019-11-28 18:24:08,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:24:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2019-11-28 18:24:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 804. [2019-11-28 18:24:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-11-28 18:24:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1599 transitions. [2019-11-28 18:24:08,996 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1599 transitions. Word has length 60 [2019-11-28 18:24:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:24:08,996 INFO L462 AbstractCegarLoop]: Abstraction has 804 states and 1599 transitions. [2019-11-28 18:24:08,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 18:24:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1599 transitions. [2019-11-28 18:24:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-28 18:24:08,999 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:24:08,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:24:08,999 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:24:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:24:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1155043701, now seen corresponding path program 4 times [2019-11-28 18:24:09,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:24:09,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100954380] [2019-11-28 18:24:09,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:24:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:24:09,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:24:09,162 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:24:09,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1731~0.base_28| 4) |v_#length_15|) (= v_~main$tmp_guard0~0_27 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28| 1) |v_#valid_53|) (= 0 v_~__unbuffered_p0_EAX~0_77) (= 0 |v_ULTIMATE.start_main_~#t1731~0.offset_20|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) |v_ULTIMATE.start_main_~#t1731~0.offset_20| 0)) |v_#memory_int_13|) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) (= v_~y$r_buff0_thd1~0_295 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28|) 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_17|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1731~0.offset=|v_ULTIMATE.start_main_~#t1731~0.offset_20|, ULTIMATE.start_main_~#t1731~0.base=|v_ULTIMATE.start_main_~#t1731~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_14|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1731~0.offset, ULTIMATE.start_main_~#t1731~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1732~0.offset, ~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:24:09,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1732~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1732~0.base_13|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1732~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13|) |v_ULTIMATE.start_main_~#t1732~0.offset_11| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1732~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1732~0.offset] because there is no mapped edge [2019-11-28 18:24:09,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:09,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In275246977 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In275246977 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out275246977| ~y$w_buff0~0_In275246977) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out275246977| ~y$w_buff1~0_In275246977)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In275246977, ~y$w_buff1~0=~y$w_buff1~0_In275246977, ~y$w_buff0~0=~y$w_buff0~0_In275246977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In275246977} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In275246977, ~y$w_buff1~0=~y$w_buff1~0_In275246977, ~y$w_buff0~0=~y$w_buff0~0_In275246977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In275246977, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out275246977|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:09,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:09,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:24:09,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1512648258 256)))) (or (and (= ~y~0_In1512648258 |P1Thread1of1ForFork1_#t~ite48_Out1512648258|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1512648258| ~y$mem_tmp~0_In1512648258) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1512648258, ~y$flush_delayed~0=~y$flush_delayed~0_In1512648258, ~y~0=~y~0_In1512648258} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1512648258, ~y$flush_delayed~0=~y$flush_delayed~0_In1512648258, ~y~0=~y~0_In1512648258, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1512648258|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:24:09,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-897169017 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-897169017 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-897169017| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-897169017| ~y$w_buff0_used~0_In-897169017)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-897169017, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897169017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-897169017, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-897169017|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897169017} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:24:09,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In453299466 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In453299466 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In453299466 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In453299466 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In453299466 |P1Thread1of1ForFork1_#t~ite52_Out453299466|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out453299466|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In453299466, ~y$w_buff0_used~0=~y$w_buff0_used~0_In453299466, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In453299466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In453299466} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In453299466, ~y$w_buff0_used~0=~y$w_buff0_used~0_In453299466, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out453299466|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In453299466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In453299466} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:24:09,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1548940487 256))) (.cse1 (= ~y$r_buff0_thd2~0_In1548940487 ~y$r_buff0_thd2~0_Out1548940487)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1548940487 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1548940487 0) (not .cse0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1548940487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548940487} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1548940487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1548940487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1548940487} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:24:09,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1100429923 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1100429923 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1100429923 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1100429923 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1100429923 |P1Thread1of1ForFork1_#t~ite54_Out-1100429923|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1100429923| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100429923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100429923, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100429923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100429923} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100429923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100429923, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100429923, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1100429923|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100429923} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:24:09,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:24:09,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In488405607 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In488405607 |P0Thread1of1ForFork0_#t~ite25_Out488405607|)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out488405607| ~y~0_In488405607)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In488405607, ~y$flush_delayed~0=~y$flush_delayed~0_In488405607, ~y~0=~y~0_In488405607} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In488405607, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out488405607|, ~y$flush_delayed~0=~y$flush_delayed~0_In488405607, ~y~0=~y~0_In488405607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:24:09,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:24:09,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:09,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-513514664 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-513514664 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-513514664 |ULTIMATE.start_main_#t~ite57_Out-513514664|)) (and (or .cse0 .cse1) (= ~y~0_In-513514664 |ULTIMATE.start_main_#t~ite57_Out-513514664|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-513514664, ~y~0=~y~0_In-513514664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-513514664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-513514664} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-513514664, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-513514664|, ~y~0=~y~0_In-513514664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-513514664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-513514664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:24:09,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-11-28 18:24:09,191 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1769848490 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1769848490 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1769848490| ~y$w_buff0_used~0_In1769848490) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out1769848490|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1769848490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1769848490} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1769848490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1769848490, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1769848490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:24:09,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-445018505 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-445018505 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-445018505 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-445018505 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite60_Out-445018505| ~y$w_buff1_used~0_In-445018505)) (and (= |ULTIMATE.start_main_#t~ite60_Out-445018505| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-445018505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445018505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-445018505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-445018505} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-445018505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-445018505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445018505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-445018505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-445018505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:24:09,192 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In29363791 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In29363791 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out29363791|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out29363791| ~y$r_buff0_thd0~0_In29363791) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In29363791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29363791} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out29363791|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29363791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29363791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:24:09,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1479864430 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1479864430 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1479864430 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1479864430 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1479864430|)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1479864430| ~y$r_buff1_thd0~0_In-1479864430) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479864430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479864430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1479864430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479864430} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1479864430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479864430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479864430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1479864430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479864430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:24:09,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~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:24:09,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:24:09 BasicIcfg [2019-11-28 18:24:09,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:24:09,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:24:09,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:24:09,301 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:24:09,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:49" (3/4) ... [2019-11-28 18:24:09,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:24:09,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y~0_249 0) (= 0 v_~y$w_buff0~0_205) (= v_~y$w_buff0_used~0_843 0) (= v_~y$w_buff1_used~0_439 0) (= 0 v_~weak$$choice0~0_156) (= v_~main$tmp_guard1~0_42 0) (= |v_#NULL.offset_6| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1731~0.base_28| 4) |v_#length_15|) (= v_~main$tmp_guard0~0_27 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28| 1) |v_#valid_53|) (= 0 v_~__unbuffered_p0_EAX~0_77) (= 0 |v_ULTIMATE.start_main_~#t1731~0.offset_20|) (= v_~__unbuffered_p0_EBX~0_51 0) (= v_~y$read_delayed~0_6 0) (= v_~weak$$choice2~0_238 0) (= v_~y$r_buff0_thd0~0_100 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd2~0_306) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) |v_ULTIMATE.start_main_~#t1731~0.offset_20| 0)) |v_#memory_int_13|) (= v_~x~0_52 0) (= 0 v_~y$r_buff0_thd2~0_438) (= v_~y$r_buff1_thd1~0_261 0) (= 0 v_~__unbuffered_cnt~0_49) (= v_~__unbuffered_p1_EBX~0_47 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= v_~y$w_buff1~0_192 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$flush_delayed~0_191 0) (= v_~y$mem_tmp~0_167 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1731~0.base_28|) (= v_~y$r_buff0_thd1~0_295 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1731~0.base_28|) 0) (= v_~y$r_buff1_thd0~0_204 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_843, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_17|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_14|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_~#t1731~0.offset=|v_ULTIMATE.start_main_~#t1731~0.offset_20|, ULTIMATE.start_main_~#t1731~0.base=|v_ULTIMATE.start_main_~#t1731~0.base_28|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_261, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~y$w_buff0~0=v_~y$w_buff0~0_205, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_295, ~y$flush_delayed~0=v_~y$flush_delayed~0_191, #length=|v_#length_15|, ~y~0=v_~y~0_249, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_47, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_51, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_132|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_103|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_147|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_85|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_306, ~weak$$choice0~0=v_~weak$$choice0~0_156, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_115|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_29|, ~y$w_buff1~0=v_~y$w_buff1~0_192, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_100, #valid=|v_#valid_53|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_438, #memory_int=|v_#memory_int_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_14|, ~weak$$choice2~0=v_~weak$$choice2~0_238, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_204, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1731~0.offset, ULTIMATE.start_main_~#t1731~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1732~0.offset, ~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:24:09,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L813-1-->L815: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1732~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1732~0.base_13|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t1732~0.base_13| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1732~0.base_13|) |v_ULTIMATE.start_main_~#t1732~0.offset_11| 1))) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1732~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1732~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1732~0.base=|v_ULTIMATE.start_main_~#t1732~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1732~0.offset=|v_ULTIMATE.start_main_~#t1732~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1732~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1732~0.offset] because there is no mapped edge [2019-11-28 18:24:09,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= v_~y$w_buff0~0_39 v_~y$w_buff1~0_51) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= 1 v_~y$w_buff0~0_38) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff1_used~0_84 v_~y$w_buff0_used~0_163) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_84 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_162 256))))) 1 0)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_39, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_51, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_38, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:24:09,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In275246977 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In275246977 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_Out275246977| ~y$w_buff0~0_In275246977) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out275246977| ~y$w_buff1~0_In275246977)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In275246977, ~y$w_buff1~0=~y$w_buff1~0_In275246977, ~y$w_buff0~0=~y$w_buff0~0_In275246977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In275246977} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In275246977, ~y$w_buff1~0=~y$w_buff1~0_In275246977, ~y$w_buff0~0=~y$w_buff0~0_In275246977, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In275246977, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out275246977|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:09,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_77 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_77, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:24:09,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_44 256))) (= v_~y$r_buff0_thd2~0_85 v_~y$r_buff0_thd2~0_84)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_44} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_84, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_44} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-11-28 18:24:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1512648258 256)))) (or (and (= ~y~0_In1512648258 |P1Thread1of1ForFork1_#t~ite48_Out1512648258|) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite48_Out1512648258| ~y$mem_tmp~0_In1512648258) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1512648258, ~y$flush_delayed~0=~y$flush_delayed~0_In1512648258, ~y~0=~y~0_In1512648258} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1512648258, ~y$flush_delayed~0=~y$flush_delayed~0_In1512648258, ~y~0=~y~0_In1512648258, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out1512648258|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-11-28 18:24:09,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-897169017 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-897169017 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out-897169017| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite51_Out-897169017| ~y$w_buff0_used~0_In-897169017)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-897169017, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897169017} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-897169017, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-897169017|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-897169017} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-11-28 18:24:09,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In453299466 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In453299466 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In453299466 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In453299466 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In453299466 |P1Thread1of1ForFork1_#t~ite52_Out453299466|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite52_Out453299466|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In453299466, ~y$w_buff0_used~0=~y$w_buff0_used~0_In453299466, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In453299466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In453299466} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In453299466, ~y$w_buff0_used~0=~y$w_buff0_used~0_In453299466, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out453299466|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In453299466, ~y$w_buff1_used~0=~y$w_buff1_used~0_In453299466} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-11-28 18:24:09,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1548940487 256))) (.cse1 (= ~y$r_buff0_thd2~0_In1548940487 ~y$r_buff0_thd2~0_Out1548940487)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1548940487 256)))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd2~0_Out1548940487 0) (not .cse0)) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1548940487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1548940487} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out1548940487|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1548940487, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1548940487} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:24:09,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In-1100429923 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1100429923 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1100429923 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1100429923 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In-1100429923 |P1Thread1of1ForFork1_#t~ite54_Out-1100429923|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite54_Out-1100429923| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100429923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100429923, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100429923, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100429923} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1100429923, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100429923, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100429923, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1100429923|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100429923} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-11-28 18:24:09,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_119 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-11-28 18:24:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In488405607 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In488405607 |P0Thread1of1ForFork0_#t~ite25_Out488405607|)) (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out488405607| ~y~0_In488405607)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In488405607, ~y$flush_delayed~0=~y$flush_delayed~0_In488405607, ~y~0=~y~0_In488405607} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In488405607, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out488405607|, ~y$flush_delayed~0=~y$flush_delayed~0_In488405607, ~y~0=~y~0_In488405607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-11-28 18:24:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_26 (+ v_~__unbuffered_cnt~0_27 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y~0_124 |v_P0Thread1of1ForFork0_#t~ite25_18|) (= 0 v_~y$flush_delayed~0_78) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_78, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~y~0=v_~y~0_124} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-11-28 18:24:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= 0 (mod v_~y$w_buff0_used~0_212 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_212, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:24:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-513514664 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-513514664 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-513514664 |ULTIMATE.start_main_#t~ite57_Out-513514664|)) (and (or .cse0 .cse1) (= ~y~0_In-513514664 |ULTIMATE.start_main_#t~ite57_Out-513514664|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-513514664, ~y~0=~y~0_In-513514664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-513514664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-513514664} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-513514664, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-513514664|, ~y~0=~y~0_In-513514664, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-513514664, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-513514664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-11-28 18:24:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite57_9|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_9|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_10|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_8|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-11-28 18:24:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1769848490 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1769848490 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out1769848490| ~y$w_buff0_used~0_In1769848490) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite59_Out1769848490|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1769848490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1769848490} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1769848490, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1769848490, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1769848490|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-11-28 18:24:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-445018505 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-445018505 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-445018505 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-445018505 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite60_Out-445018505| ~y$w_buff1_used~0_In-445018505)) (and (= |ULTIMATE.start_main_#t~ite60_Out-445018505| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-445018505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445018505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-445018505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-445018505} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-445018505|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-445018505, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445018505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-445018505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-445018505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-11-28 18:24:09,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In29363791 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In29363791 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out29363791|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out29363791| ~y$r_buff0_thd0~0_In29363791) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In29363791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29363791} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out29363791|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In29363791, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29363791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-11-28 18:24:09,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1479864430 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1479864430 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1479864430 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1479864430 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-1479864430|)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1479864430| ~y$r_buff1_thd0~0_In-1479864430) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479864430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479864430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1479864430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479864430} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1479864430|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479864430, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479864430, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1479864430, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1479864430} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-11-28 18:24:09,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_175 |v_ULTIMATE.start_main_#t~ite62_45|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_25 0) (= 1 v_~__unbuffered_p0_EAX~0_55) (= v_~__unbuffered_p0_EBX~0_29 0) (= 1 v_~__unbuffered_p1_EAX~0_36))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_20 256))) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_44|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_55, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_175, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~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:24:09,458 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:24:09,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:24:09,461 INFO L168 Benchmark]: Toolchain (without parser) took 22209.20 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 826.3 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -94.7 MB). Peak memory consumption was 731.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,466 INFO L168 Benchmark]: CDTParser took 0.22 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:24:09,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 833.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.06 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,473 INFO L168 Benchmark]: Boogie Preprocessor took 40.83 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:24:09,473 INFO L168 Benchmark]: RCFGBuilder took 923.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,473 INFO L168 Benchmark]: TraceAbstraction took 20178.91 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -37.9 MB). Peak memory consumption was 650.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,474 INFO L168 Benchmark]: Witness Printer took 157.81 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:24:09,478 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.22 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 833.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -146.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.06 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.83 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 923.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20178.91 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 688.4 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -37.9 MB). Peak memory consumption was 650.5 MB. Max. memory is 11.5 GB. * Witness Printer took 157.81 ms. Allocated memory is still 1.9 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 179 ProgramPointsBefore, 105 ProgramPointsAfterwards, 228 TransitionsBefore, 129 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 28 ChoiceCompositions, 9059 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 68 SemBasedMoverChecksPositive, 299 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 125257 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1731, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1732, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 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)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 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)) [L778] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 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)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 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)) [L781] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 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)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3061 SDtfs, 3514 SDslu, 6256 SDs, 0 SdLazy, 3101 SolverSat, 191 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25272occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 9556 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 553 ConstructedInterpolants, 0 QuantifiedInterpolants, 131770 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...