./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix040_pso.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/mix040_pso.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 7f3ff5692b4857f658742378dd54561dcde78e34 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:23,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:14:23,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:14:23,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:14:23,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:14:23,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:14:23,854 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:14:23,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:14:23,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:14:23,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:14:23,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:14:23,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:14:23,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:14:23,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:14:23,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:14:23,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:14:23,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:14:23,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:14:23,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:14:23,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:14:23,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:14:23,906 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:14:23,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:14:23,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:14:23,913 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:14:23,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:14:23,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:14:23,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:14:23,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:14:23,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:14:23,919 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:14:23,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:14:23,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:14:23,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:14:23,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:14:23,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:14:23,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:14:23,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:14:23,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:14:23,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:14:23,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:14:23,929 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:14:23,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:14:23,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:14:23,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:14:23,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:14:23,955 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:14:23,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:14:23,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:14:23,956 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:14:23,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:14:23,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:14:23,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:14:23,957 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:14:23,957 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:14:23,957 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:14:23,957 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:14:23,958 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:14:23,958 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:14:23,958 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:14:23,959 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:14:23,959 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:14:23,959 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:14:23,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:14:23,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:14:23,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:14:23,960 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:14:23,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:14:23,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:14:23,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:14:23,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:14:23,962 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 -> 7f3ff5692b4857f658742378dd54561dcde78e34 [2019-11-28 18:14:24,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:14:24,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:14:24,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:14:24,322 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:14:24,323 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:14:24,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2019-11-28 18:14:24,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed65960d6/c2ae7569254b4ec0909976c27609206a/FLAG0bf59015a [2019-11-28 18:14:24,970 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:14:24,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040_pso.opt.i [2019-11-28 18:14:24,987 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed65960d6/c2ae7569254b4ec0909976c27609206a/FLAG0bf59015a [2019-11-28 18:14:25,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed65960d6/c2ae7569254b4ec0909976c27609206a [2019-11-28 18:14:25,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:14:25,209 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:14:25,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:25,210 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:14:25,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:14:25,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:25" (1/1) ... [2019-11-28 18:14:25,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76576ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:25, skipping insertion in model container [2019-11-28 18:14:25,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:14:25" (1/1) ... [2019-11-28 18:14:25,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:14:25,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:14:25,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:25,851 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:14:25,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:14:26,035 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:14:26,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26 WrapperNode [2019-11-28 18:14:26,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:14:26,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:26,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:14:26,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:14:26,047 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:14:26" (1/1) ... [2019-11-28 18:14:26,085 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:14:26" (1/1) ... [2019-11-28 18:14:26,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:14:26,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:14:26,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:14:26,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:14:26,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (1/1) ... [2019-11-28 18:14:26,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:14:26,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:14:26,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:14:26,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:14:26,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (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:14:26,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:14:26,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:14:26,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:14:26,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:14:26,264 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:14:26,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:14:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:14:26,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:14:26,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-11-28 18:14:26,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-11-28 18:14:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-11-28 18:14:26,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-11-28 18:14:26,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:14:26,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:14:26,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:14:26,270 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:14:27,156 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:14:27,156 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:14:27,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:27 BoogieIcfgContainer [2019-11-28 18:14:27,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:14:27,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:14:27,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:14:27,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:14:27,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:14:25" (1/3) ... [2019-11-28 18:14:27,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f2d72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:27, skipping insertion in model container [2019-11-28 18:14:27,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:14:26" (2/3) ... [2019-11-28 18:14:27,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f2d72c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:14:27, skipping insertion in model container [2019-11-28 18:14:27,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:27" (3/3) ... [2019-11-28 18:14:27,167 INFO L109 eAbstractionObserver]: Analyzing ICFG mix040_pso.opt.i [2019-11-28 18:14:27,185 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:14:27,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:14:27,193 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:14:27,194 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:14:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,235 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,251 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,253 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,254 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,255 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,256 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,260 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,261 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,262 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,263 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,264 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,265 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,268 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,275 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,276 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,276 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,276 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,276 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,277 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,280 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,280 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,281 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,282 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,283 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,284 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,286 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:14:27,313 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 18:14:27,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:14:27,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:14:27,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:14:27,334 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:14:27,334 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:14:27,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:14:27,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:14:27,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:14:27,353 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 191 transitions [2019-11-28 18:14:27,355 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-11-28 18:14:27,446 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-11-28 18:14:27,447 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:27,465 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:27,489 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 169 places, 191 transitions [2019-11-28 18:14:27,538 INFO L134 PetriNetUnfolder]: 35/187 cut-off events. [2019-11-28 18:14:27,539 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:14:27,548 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 35/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 576 event pairs. 12/162 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2019-11-28 18:14:27,570 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12650 [2019-11-28 18:14:27,571 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:14:32,184 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 18:14:32,519 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-28 18:14:32,851 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-11-28 18:14:32,988 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-28 18:14:33,005 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46301 [2019-11-28 18:14:33,006 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-11-28 18:14:33,009 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 83 transitions [2019-11-28 18:14:36,349 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27254 states. [2019-11-28 18:14:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 27254 states. [2019-11-28 18:14:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 18:14:36,359 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:36,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:36,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2114616633, now seen corresponding path program 1 times [2019-11-28 18:14:36,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:36,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124247140] [2019-11-28 18:14:36,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:36,694 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:14:36,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124247140] [2019-11-28 18:14:36,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:36,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:14:36,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983162551] [2019-11-28 18:14:36,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:36,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:36,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:36,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:36,725 INFO L87 Difference]: Start difference. First operand 27254 states. Second operand 3 states. [2019-11-28 18:14:37,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:37,255 INFO L93 Difference]: Finished difference Result 26518 states and 112736 transitions. [2019-11-28 18:14:37,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:37,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-28 18:14:37,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:37,507 INFO L225 Difference]: With dead ends: 26518 [2019-11-28 18:14:37,507 INFO L226 Difference]: Without dead ends: 24958 [2019-11-28 18:14:37,509 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:14:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24958 states. [2019-11-28 18:14:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24958 to 24958. [2019-11-28 18:14:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24958 states. [2019-11-28 18:14:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24958 states to 24958 states and 105960 transitions. [2019-11-28 18:14:39,109 INFO L78 Accepts]: Start accepts. Automaton has 24958 states and 105960 transitions. Word has length 9 [2019-11-28 18:14:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:39,110 INFO L462 AbstractCegarLoop]: Abstraction has 24958 states and 105960 transitions. [2019-11-28 18:14:39,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 24958 states and 105960 transitions. [2019-11-28 18:14:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 18:14:39,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:39,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:39,120 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:39,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:39,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1982620494, now seen corresponding path program 1 times [2019-11-28 18:14:39,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:39,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057495790] [2019-11-28 18:14:39,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:39,281 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:14:39,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057495790] [2019-11-28 18:14:39,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:39,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:39,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703302236] [2019-11-28 18:14:39,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:39,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:39,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:39,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:39,286 INFO L87 Difference]: Start difference. First operand 24958 states and 105960 transitions. Second operand 4 states. [2019-11-28 18:14:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:39,747 INFO L93 Difference]: Finished difference Result 37710 states and 155548 transitions. [2019-11-28 18:14:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:39,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 18:14:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:39,915 INFO L225 Difference]: With dead ends: 37710 [2019-11-28 18:14:39,915 INFO L226 Difference]: Without dead ends: 37654 [2019-11-28 18:14:39,916 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:14:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37654 states. [2019-11-28 18:14:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37654 to 32850. [2019-11-28 18:14:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32850 states. [2019-11-28 18:14:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32850 states to 32850 states and 137140 transitions. [2019-11-28 18:14:41,736 INFO L78 Accepts]: Start accepts. Automaton has 32850 states and 137140 transitions. Word has length 15 [2019-11-28 18:14:41,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:41,737 INFO L462 AbstractCegarLoop]: Abstraction has 32850 states and 137140 transitions. [2019-11-28 18:14:41,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:41,738 INFO L276 IsEmpty]: Start isEmpty. Operand 32850 states and 137140 transitions. [2019-11-28 18:14:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:14:41,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:41,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:14:41,748 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:41,748 INFO L82 PathProgramCache]: Analyzing trace with hash 965433528, now seen corresponding path program 1 times [2019-11-28 18:14:41,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:41,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654086978] [2019-11-28 18:14:41,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:41,871 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:14:41,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654086978] [2019-11-28 18:14:41,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:41,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:41,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150725153] [2019-11-28 18:14:41,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:41,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:41,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:41,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:41,873 INFO L87 Difference]: Start difference. First operand 32850 states and 137140 transitions. Second operand 4 states. [2019-11-28 18:14:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:42,768 INFO L93 Difference]: Finished difference Result 42390 states and 176044 transitions. [2019-11-28 18:14:42,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:42,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:14:42,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:42,906 INFO L225 Difference]: With dead ends: 42390 [2019-11-28 18:14:42,907 INFO L226 Difference]: Without dead ends: 42338 [2019-11-28 18:14:42,908 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:14:43,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42338 states. [2019-11-28 18:14:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42338 to 35874. [2019-11-28 18:14:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35874 states. [2019-11-28 18:14:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35874 states to 35874 states and 149792 transitions. [2019-11-28 18:14:44,203 INFO L78 Accepts]: Start accepts. Automaton has 35874 states and 149792 transitions. Word has length 18 [2019-11-28 18:14:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:44,204 INFO L462 AbstractCegarLoop]: Abstraction has 35874 states and 149792 transitions. [2019-11-28 18:14:44,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35874 states and 149792 transitions. [2019-11-28 18:14:44,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:14:44,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:44,220 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] [2019-11-28 18:14:44,220 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1915727965, now seen corresponding path program 1 times [2019-11-28 18:14:44,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:44,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870009455] [2019-11-28 18:14:44,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:44,326 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:14:44,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870009455] [2019-11-28 18:14:44,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:44,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:44,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430727359] [2019-11-28 18:14:44,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:44,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:44,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:44,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:44,329 INFO L87 Difference]: Start difference. First operand 35874 states and 149792 transitions. Second operand 3 states. [2019-11-28 18:14:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:44,535 INFO L93 Difference]: Finished difference Result 33990 states and 140132 transitions. [2019-11-28 18:14:44,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:44,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:14:44,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:44,663 INFO L225 Difference]: With dead ends: 33990 [2019-11-28 18:14:44,663 INFO L226 Difference]: Without dead ends: 33990 [2019-11-28 18:14:44,663 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:14:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33990 states. [2019-11-28 18:14:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33990 to 33286. [2019-11-28 18:14:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33286 states. [2019-11-28 18:14:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33286 states to 33286 states and 137292 transitions. [2019-11-28 18:14:46,179 INFO L78 Accepts]: Start accepts. Automaton has 33286 states and 137292 transitions. Word has length 20 [2019-11-28 18:14:46,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:46,180 INFO L462 AbstractCegarLoop]: Abstraction has 33286 states and 137292 transitions. [2019-11-28 18:14:46,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 33286 states and 137292 transitions. [2019-11-28 18:14:46,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 18:14:46,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:46,190 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] [2019-11-28 18:14:46,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -480610237, now seen corresponding path program 1 times [2019-11-28 18:14:46,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:46,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456936776] [2019-11-28 18:14:46,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:46,236 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:14:46,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456936776] [2019-11-28 18:14:46,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:46,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:14:46,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190768765] [2019-11-28 18:14:46,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:46,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:46,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:46,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:46,238 INFO L87 Difference]: Start difference. First operand 33286 states and 137292 transitions. Second operand 3 states. [2019-11-28 18:14:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:46,357 INFO L93 Difference]: Finished difference Result 26272 states and 100329 transitions. [2019-11-28 18:14:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:46,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-28 18:14:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:46,442 INFO L225 Difference]: With dead ends: 26272 [2019-11-28 18:14:46,442 INFO L226 Difference]: Without dead ends: 26272 [2019-11-28 18:14:46,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26272 states. [2019-11-28 18:14:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26272 to 26272. [2019-11-28 18:14:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26272 states. [2019-11-28 18:14:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26272 states to 26272 states and 100329 transitions. [2019-11-28 18:14:47,752 INFO L78 Accepts]: Start accepts. Automaton has 26272 states and 100329 transitions. Word has length 20 [2019-11-28 18:14:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:47,753 INFO L462 AbstractCegarLoop]: Abstraction has 26272 states and 100329 transitions. [2019-11-28 18:14:47,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26272 states and 100329 transitions. [2019-11-28 18:14:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 18:14:47,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:47,762 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] [2019-11-28 18:14:47,763 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1106654559, now seen corresponding path program 1 times [2019-11-28 18:14:47,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:47,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601480937] [2019-11-28 18:14:47,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:47,812 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:14:47,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601480937] [2019-11-28 18:14:47,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:47,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:47,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765420107] [2019-11-28 18:14:47,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:47,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:47,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:47,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:47,814 INFO L87 Difference]: Start difference. First operand 26272 states and 100329 transitions. Second operand 4 states. [2019-11-28 18:14:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:47,878 INFO L93 Difference]: Finished difference Result 11498 states and 37116 transitions. [2019-11-28 18:14:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:47,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-28 18:14:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:47,899 INFO L225 Difference]: With dead ends: 11498 [2019-11-28 18:14:47,899 INFO L226 Difference]: Without dead ends: 11498 [2019-11-28 18:14:47,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:47,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11498 states. [2019-11-28 18:14:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11498 to 11498. [2019-11-28 18:14:48,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11498 states. [2019-11-28 18:14:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11498 states to 11498 states and 37116 transitions. [2019-11-28 18:14:48,117 INFO L78 Accepts]: Start accepts. Automaton has 11498 states and 37116 transitions. Word has length 21 [2019-11-28 18:14:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:48,118 INFO L462 AbstractCegarLoop]: Abstraction has 11498 states and 37116 transitions. [2019-11-28 18:14:48,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11498 states and 37116 transitions. [2019-11-28 18:14:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 18:14:48,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:48,121 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] [2019-11-28 18:14:48,121 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:48,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1057487317, now seen corresponding path program 1 times [2019-11-28 18:14:48,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:48,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861927407] [2019-11-28 18:14:48,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:48,180 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:14:48,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861927407] [2019-11-28 18:14:48,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:48,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460399250] [2019-11-28 18:14:48,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:14:48,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:14:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:48,183 INFO L87 Difference]: Start difference. First operand 11498 states and 37116 transitions. Second operand 5 states. [2019-11-28 18:14:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:48,235 INFO L93 Difference]: Finished difference Result 2968 states and 8959 transitions. [2019-11-28 18:14:48,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:14:48,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 18:14:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:48,241 INFO L225 Difference]: With dead ends: 2968 [2019-11-28 18:14:48,241 INFO L226 Difference]: Without dead ends: 2968 [2019-11-28 18:14:48,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:14:48,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-11-28 18:14:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2019-11-28 18:14:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-11-28 18:14:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 8959 transitions. [2019-11-28 18:14:48,295 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 8959 transitions. Word has length 22 [2019-11-28 18:14:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 8959 transitions. [2019-11-28 18:14:48,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:14:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 8959 transitions. [2019-11-28 18:14:48,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:48,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:48,300 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] [2019-11-28 18:14:48,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:48,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:48,300 INFO L82 PathProgramCache]: Analyzing trace with hash -617388800, now seen corresponding path program 1 times [2019-11-28 18:14:48,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:48,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404959585] [2019-11-28 18:14:48,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:48,343 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:14:48,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404959585] [2019-11-28 18:14:48,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:48,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242599432] [2019-11-28 18:14:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:48,346 INFO L87 Difference]: Start difference. First operand 2968 states and 8959 transitions. Second operand 3 states. [2019-11-28 18:14:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:48,412 INFO L93 Difference]: Finished difference Result 4310 states and 12842 transitions. [2019-11-28 18:14:48,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:48,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 18:14:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:48,422 INFO L225 Difference]: With dead ends: 4310 [2019-11-28 18:14:48,423 INFO L226 Difference]: Without dead ends: 4310 [2019-11-28 18:14:48,423 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:14:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2019-11-28 18:14:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3576. [2019-11-28 18:14:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3576 states. [2019-11-28 18:14:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3576 states to 3576 states and 10863 transitions. [2019-11-28 18:14:48,507 INFO L78 Accepts]: Start accepts. Automaton has 3576 states and 10863 transitions. Word has length 32 [2019-11-28 18:14:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:48,509 INFO L462 AbstractCegarLoop]: Abstraction has 3576 states and 10863 transitions. [2019-11-28 18:14:48,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3576 states and 10863 transitions. [2019-11-28 18:14:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:48,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:48,519 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] [2019-11-28 18:14:48,520 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:48,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:48,520 INFO L82 PathProgramCache]: Analyzing trace with hash 937445460, now seen corresponding path program 1 times [2019-11-28 18:14:48,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:48,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383668974] [2019-11-28 18:14:48,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:48,574 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:14:48,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383668974] [2019-11-28 18:14:48,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:48,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:48,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22911664] [2019-11-28 18:14:48,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:14:48,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:48,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:14:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:14:48,577 INFO L87 Difference]: Start difference. First operand 3576 states and 10863 transitions. Second operand 3 states. [2019-11-28 18:14:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:48,624 INFO L93 Difference]: Finished difference Result 4310 states and 12554 transitions. [2019-11-28 18:14:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:14:48,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 18:14:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:48,633 INFO L225 Difference]: With dead ends: 4310 [2019-11-28 18:14:48,634 INFO L226 Difference]: Without dead ends: 4310 [2019-11-28 18:14:48,634 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:14:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2019-11-28 18:14:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3464. [2019-11-28 18:14:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-11-28 18:14:48,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10271 transitions. [2019-11-28 18:14:48,706 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10271 transitions. Word has length 32 [2019-11-28 18:14:48,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:48,707 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10271 transitions. [2019-11-28 18:14:48,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:14:48,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10271 transitions. [2019-11-28 18:14:48,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 18:14:48,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:48,713 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] [2019-11-28 18:14:48,713 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:48,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:48,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1469218903, now seen corresponding path program 1 times [2019-11-28 18:14:48,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:48,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373802868] [2019-11-28 18:14:48,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:48,817 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:14:48,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373802868] [2019-11-28 18:14:48,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:48,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:48,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670562984] [2019-11-28 18:14:48,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:48,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:48,819 INFO L87 Difference]: Start difference. First operand 3464 states and 10271 transitions. Second operand 6 states. [2019-11-28 18:14:49,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:49,186 INFO L93 Difference]: Finished difference Result 6276 states and 17943 transitions. [2019-11-28 18:14:49,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:14:49,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 18:14:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:49,198 INFO L225 Difference]: With dead ends: 6276 [2019-11-28 18:14:49,199 INFO L226 Difference]: Without dead ends: 6274 [2019-11-28 18:14:49,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:14:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6274 states. [2019-11-28 18:14:49,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6274 to 3620. [2019-11-28 18:14:49,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3620 states. [2019-11-28 18:14:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 10703 transitions. [2019-11-28 18:14:49,276 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 10703 transitions. Word has length 32 [2019-11-28 18:14:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:49,277 INFO L462 AbstractCegarLoop]: Abstraction has 3620 states and 10703 transitions. [2019-11-28 18:14:49,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 10703 transitions. [2019-11-28 18:14:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:49,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:49,284 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:14:49,284 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:49,284 INFO L82 PathProgramCache]: Analyzing trace with hash -351630546, now seen corresponding path program 1 times [2019-11-28 18:14:49,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:49,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619870951] [2019-11-28 18:14:49,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:49,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:14:49,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619870951] [2019-11-28 18:14:49,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:49,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:49,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094895258] [2019-11-28 18:14:49,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:49,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:49,394 INFO L87 Difference]: Start difference. First operand 3620 states and 10703 transitions. Second operand 4 states. [2019-11-28 18:14:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:49,452 INFO L93 Difference]: Finished difference Result 7923 states and 21726 transitions. [2019-11-28 18:14:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:49,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-28 18:14:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:49,464 INFO L225 Difference]: With dead ends: 7923 [2019-11-28 18:14:49,464 INFO L226 Difference]: Without dead ends: 5414 [2019-11-28 18:14:49,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5414 states. [2019-11-28 18:14:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5414 to 4683. [2019-11-28 18:14:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2019-11-28 18:14:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 11746 transitions. [2019-11-28 18:14:49,571 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 11746 transitions. Word has length 33 [2019-11-28 18:14:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:49,572 INFO L462 AbstractCegarLoop]: Abstraction has 4683 states and 11746 transitions. [2019-11-28 18:14:49,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:49,572 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 11746 transitions. [2019-11-28 18:14:49,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 18:14:49,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:49,584 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:14:49,584 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1277869158, now seen corresponding path program 1 times [2019-11-28 18:14:49,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:49,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862902149] [2019-11-28 18:14:49,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:49,757 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:14:49,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862902149] [2019-11-28 18:14:49,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:49,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:14:49,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964167008] [2019-11-28 18:14:49,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:49,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:49,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:49,763 INFO L87 Difference]: Start difference. First operand 4683 states and 11746 transitions. Second operand 6 states. [2019-11-28 18:14:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:50,172 INFO L93 Difference]: Finished difference Result 6761 states and 16384 transitions. [2019-11-28 18:14:50,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 18:14:50,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-11-28 18:14:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:50,184 INFO L225 Difference]: With dead ends: 6761 [2019-11-28 18:14:50,184 INFO L226 Difference]: Without dead ends: 6629 [2019-11-28 18:14:50,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:14:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6629 states. [2019-11-28 18:14:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6629 to 4375. [2019-11-28 18:14:50,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2019-11-28 18:14:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 10916 transitions. [2019-11-28 18:14:50,258 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 10916 transitions. Word has length 33 [2019-11-28 18:14:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:50,259 INFO L462 AbstractCegarLoop]: Abstraction has 4375 states and 10916 transitions. [2019-11-28 18:14:50,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 10916 transitions. [2019-11-28 18:14:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 18:14:50,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:50,264 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] [2019-11-28 18:14:50,265 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:50,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:50,265 INFO L82 PathProgramCache]: Analyzing trace with hash 435791124, now seen corresponding path program 1 times [2019-11-28 18:14:50,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:50,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754015015] [2019-11-28 18:14:50,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:50,342 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:14:50,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754015015] [2019-11-28 18:14:50,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:50,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771028202] [2019-11-28 18:14:50,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:50,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:50,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:50,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:50,344 INFO L87 Difference]: Start difference. First operand 4375 states and 10916 transitions. Second operand 4 states. [2019-11-28 18:14:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:50,380 INFO L93 Difference]: Finished difference Result 5847 states and 14273 transitions. [2019-11-28 18:14:50,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:50,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-11-28 18:14:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:50,385 INFO L225 Difference]: With dead ends: 5847 [2019-11-28 18:14:50,385 INFO L226 Difference]: Without dead ends: 2250 [2019-11-28 18:14:50,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:50,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-11-28 18:14:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2213. [2019-11-28 18:14:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2019-11-28 18:14:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 4976 transitions. [2019-11-28 18:14:50,415 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 4976 transitions. Word has length 34 [2019-11-28 18:14:50,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:50,416 INFO L462 AbstractCegarLoop]: Abstraction has 2213 states and 4976 transitions. [2019-11-28 18:14:50,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:50,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 4976 transitions. [2019-11-28 18:14:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 18:14:50,418 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:50,418 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] [2019-11-28 18:14:50,418 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:50,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1312613516, now seen corresponding path program 2 times [2019-11-28 18:14:50,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:50,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860858646] [2019-11-28 18:14:50,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:50,482 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:14:50,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860858646] [2019-11-28 18:14:50,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:50,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:14:50,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070456945] [2019-11-28 18:14:50,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:14:50,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:50,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:14:50,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:50,484 INFO L87 Difference]: Start difference. First operand 2213 states and 4976 transitions. Second operand 6 states. [2019-11-28 18:14:50,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:50,527 INFO L93 Difference]: Finished difference Result 1344 states and 2920 transitions. [2019-11-28 18:14:50,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:14:50,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 18:14:50,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:50,529 INFO L225 Difference]: With dead ends: 1344 [2019-11-28 18:14:50,529 INFO L226 Difference]: Without dead ends: 705 [2019-11-28 18:14:50,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:14:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-11-28 18:14:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2019-11-28 18:14:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2019-11-28 18:14:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1509 transitions. [2019-11-28 18:14:50,539 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1509 transitions. Word has length 34 [2019-11-28 18:14:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:50,539 INFO L462 AbstractCegarLoop]: Abstraction has 705 states and 1509 transitions. [2019-11-28 18:14:50,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:14:50,539 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1509 transitions. [2019-11-28 18:14:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:50,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:50,541 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] [2019-11-28 18:14:50,541 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:50,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1519692891, now seen corresponding path program 1 times [2019-11-28 18:14:50,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:50,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150911615] [2019-11-28 18:14:50,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:50,642 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:14:50,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150911615] [2019-11-28 18:14:50,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:50,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:14:50,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209443722] [2019-11-28 18:14:50,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:14:50,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:50,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:14:50,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:14:50,645 INFO L87 Difference]: Start difference. First operand 705 states and 1509 transitions. Second operand 7 states. [2019-11-28 18:14:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:50,898 INFO L93 Difference]: Finished difference Result 1805 states and 3776 transitions. [2019-11-28 18:14:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:14:50,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-11-28 18:14:50,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:50,900 INFO L225 Difference]: With dead ends: 1805 [2019-11-28 18:14:50,900 INFO L226 Difference]: Without dead ends: 1241 [2019-11-28 18:14:50,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:14:50,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2019-11-28 18:14:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 808. [2019-11-28 18:14:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-11-28 18:14:50,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1717 transitions. [2019-11-28 18:14:50,920 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1717 transitions. Word has length 48 [2019-11-28 18:14:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:50,922 INFO L462 AbstractCegarLoop]: Abstraction has 808 states and 1717 transitions. [2019-11-28 18:14:50,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:14:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1717 transitions. [2019-11-28 18:14:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:50,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:50,925 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] [2019-11-28 18:14:50,925 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash -633742729, now seen corresponding path program 2 times [2019-11-28 18:14:50,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:50,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975621081] [2019-11-28 18:14:50,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:14:51,015 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:14:51,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975621081] [2019-11-28 18:14:51,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:14:51,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:14:51,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18899477] [2019-11-28 18:14:51,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:14:51,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:14:51,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:14:51,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:14:51,021 INFO L87 Difference]: Start difference. First operand 808 states and 1717 transitions. Second operand 4 states. [2019-11-28 18:14:51,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:14:51,039 INFO L93 Difference]: Finished difference Result 1347 states and 2854 transitions. [2019-11-28 18:14:51,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:14:51,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-28 18:14:51,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:14:51,041 INFO L225 Difference]: With dead ends: 1347 [2019-11-28 18:14:51,042 INFO L226 Difference]: Without dead ends: 571 [2019-11-28 18:14:51,042 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:14:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-28 18:14:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-11-28 18:14:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-11-28 18:14:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1189 transitions. [2019-11-28 18:14:51,052 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1189 transitions. Word has length 48 [2019-11-28 18:14:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:14:51,053 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 1189 transitions. [2019-11-28 18:14:51,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:14:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1189 transitions. [2019-11-28 18:14:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 18:14:51,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:14:51,055 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] [2019-11-28 18:14:51,055 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:14:51,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:14:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1502542547, now seen corresponding path program 3 times [2019-11-28 18:14:51,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:14:51,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562419745] [2019-11-28 18:14:51,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:14:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:14:51,188 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:14:51,188 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:14:51,193 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1069~0.base_46|) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46|) |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46|)) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46| 1) |v_#valid_95|) (= v_~__unbuffered_p3_EAX~0_105 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1069~0.base_46| 4)) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1069~0.base=|v_ULTIMATE.start_main_~#t1069~0.base_46|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_19|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, ULTIMATE.start_main_~#t1069~0.offset=|v_ULTIMATE.start_main_~#t1069~0.offset_30|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_45|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_29|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_26|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1069~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1070~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1072~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1071~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1069~0.offset, ULTIMATE.start_main_~#t1071~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, ULTIMATE.start_main_~#t1072~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:14:51,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1070~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1070~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13|) |v_ULTIMATE.start_main_~#t1070~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1070~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, #length] because there is no mapped edge [2019-11-28 18:14:51,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1071~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1071~0.base_13| 4)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13|) |v_ULTIMATE.start_main_~#t1071~0.offset_11| 2)) |v_#memory_int_19|) (not (= |v_ULTIMATE.start_main_~#t1071~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1071~0.offset_11|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1071~0.offset, #length, ULTIMATE.start_main_~#t1071~0.base] because there is no mapped edge [2019-11-28 18:14:51,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1072~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11|) |v_ULTIMATE.start_main_~#t1072~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1072~0.base_11| 4)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1072~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1072~0.base, #length, ULTIMATE.start_main_~#t1072~0.offset] because there is no mapped edge [2019-11-28 18:14:51,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:14:51,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 18:14:51,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-11-28 18:14:51,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-632797122 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite9_Out-632797122| |P2Thread1of1ForFork0_#t~ite8_Out-632797122|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-632797122 256)))) (or (= (mod ~z$w_buff0_used~0_In-632797122 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-632797122 256))) (and (= (mod ~z$r_buff1_thd3~0_In-632797122 256) 0) .cse0))) .cse1 (= ~z$w_buff0~0_In-632797122 |P2Thread1of1ForFork0_#t~ite8_Out-632797122|)) (and (= |P2Thread1of1ForFork0_#t~ite9_Out-632797122| ~z$w_buff0~0_In-632797122) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite8_In-632797122| |P2Thread1of1ForFork0_#t~ite8_Out-632797122|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-632797122|, ~z$w_buff0~0=~z$w_buff0~0_In-632797122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632797122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-632797122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632797122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-632797122, ~weak$$choice2~0=~weak$$choice2~0_In-632797122} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-632797122|, ~z$w_buff0~0=~z$w_buff0~0_In-632797122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632797122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-632797122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632797122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-632797122, ~weak$$choice2~0=~weak$$choice2~0_In-632797122, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-632797122|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-11-28 18:14:51,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In821158348 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out821158348| |P2Thread1of1ForFork0_#t~ite11_Out821158348|) .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out821158348| ~z$w_buff1~0_In821158348) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In821158348 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In821158348 256) 0)) (= (mod ~z$w_buff0_used~0_In821158348 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In821158348 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite11_In821158348| |P2Thread1of1ForFork0_#t~ite11_Out821158348|) (= |P2Thread1of1ForFork0_#t~ite12_Out821158348| ~z$w_buff1~0_In821158348) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In821158348, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In821158348|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821158348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821158348, ~z$w_buff1~0=~z$w_buff1~0_In821158348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821158348, ~weak$$choice2~0=~weak$$choice2~0_In821158348} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out821158348|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821158348, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out821158348|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821158348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821158348, ~z$w_buff1~0=~z$w_buff1~0_In821158348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821158348, ~weak$$choice2~0=~weak$$choice2~0_In821158348} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-11-28 18:14:51,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In427108858 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite14_Out427108858| ~z$w_buff0_used~0_In427108858) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In427108858 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In427108858 256)) .cse1) (= (mod ~z$w_buff0_used~0_In427108858 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In427108858 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite14_Out427108858| |P2Thread1of1ForFork0_#t~ite15_Out427108858|)) (and (= ~z$w_buff0_used~0_In427108858 |P2Thread1of1ForFork0_#t~ite15_Out427108858|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite14_In427108858| |P2Thread1of1ForFork0_#t~ite14_Out427108858|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In427108858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In427108858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In427108858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In427108858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In427108858, ~weak$$choice2~0=~weak$$choice2~0_In427108858} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out427108858|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out427108858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In427108858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In427108858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In427108858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In427108858, ~weak$$choice2~0=~weak$$choice2~0_In427108858} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-11-28 18:14:51,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:14:51,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-678146615 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-678146615 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-678146615| ~z$w_buff0_used~0_In-678146615) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out-678146615| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-678146615, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-678146615} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-678146615, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-678146615|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-678146615} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:14:51,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:14:51,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1816489358 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1816489358 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1816489358 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1816489358 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1816489358|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1816489358 |P3Thread1of1ForFork1_#t~ite29_Out1816489358|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1816489358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816489358, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1816489358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816489358} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1816489358, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1816489358|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816489358, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1816489358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816489358} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:14:51,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1095020446 256))) (.cse0 (= ~z$r_buff0_thd4~0_In-1095020446 ~z$r_buff0_thd4~0_Out-1095020446)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1095020446 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-1095020446)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095020446, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1095020446} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095020446, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1095020446, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1095020446|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:14:51,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In1517931117 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1517931117 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1517931117 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1517931117 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1517931117| 0)) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork1_#t~ite31_Out1517931117| ~z$r_buff1_thd4~0_In1517931117) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1517931117, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517931117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1517931117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517931117} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1517931117, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517931117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1517931117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517931117, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1517931117|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:14:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:14:51,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In201119521 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In201119521 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In201119521 |ULTIMATE.start_main_#t~ite36_Out201119521|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In201119521 |ULTIMATE.start_main_#t~ite36_Out201119521|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In201119521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In201119521, ~z$w_buff1~0=~z$w_buff1~0_In201119521, ~z~0=~z~0_In201119521} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In201119521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In201119521, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out201119521|, ~z$w_buff1~0=~z$w_buff1~0_In201119521, ~z~0=~z~0_In201119521} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:14:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-11-28 18:14:51,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In706864904 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In706864904 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In706864904 |ULTIMATE.start_main_#t~ite38_Out706864904|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out706864904|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706864904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706864904} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706864904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706864904, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out706864904|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:51,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In599984634 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In599984634 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In599984634 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In599984634 256) 0))) (or (and (= ~z$w_buff1_used~0_In599984634 |ULTIMATE.start_main_#t~ite39_Out599984634|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out599984634|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599984634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599984634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599984634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599984634} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599984634, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out599984634|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599984634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599984634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599984634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:51,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-893824204 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-893824204 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-893824204| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-893824204| ~z$r_buff0_thd0~0_In-893824204)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893824204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893824204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893824204, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-893824204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893824204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:51,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1276229973 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1276229973 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1276229973 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1276229973 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1276229973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1276229973 |ULTIMATE.start_main_#t~ite41_Out-1276229973|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1276229973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1276229973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1276229973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1276229973} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1276229973|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1276229973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1276229973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1276229973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1276229973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:14:51,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:51,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:14:51 BasicIcfg [2019-11-28 18:14:51,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:14:51,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:14:51,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:14:51,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:14:51,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:14:27" (3/4) ... [2019-11-28 18:14:51,334 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:14:51,335 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_97| 0 0))) (and (= 0 v_~z$r_buff1_thd1~0_69) (= 0 v_~z$r_buff1_thd2~0_69) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1069~0.base_46|) (= v_~z$w_buff0~0_326 0) (= 0 v_~z$r_buff1_thd4~0_128) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p3_EBX~0_104) (= v_~b~0_46 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1069~0.base_46|) |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_157 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~z$r_buff0_thd3~0_271) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~z$flush_delayed~0_78) (= v_~main$tmp_guard1~0_45 0) (= v_~a~0_68 0) (= v_~z$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~weak$$choice0~0_39) (= |v_ULTIMATE.start_main_~#t1069~0.offset_30| 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z~0_172 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46|)) (= 0 v_~z$r_buff0_thd4~0_139) (= v_~y~0_82 0) (= v_~z$read_delayed~0_7 0) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~z$r_buff1_thd3~0_242) (= 0 |v_#NULL.base_7|) (= v_~z$mem_tmp~0_49 0) (= v_~z$w_buff1_used~0_372 0) (= v_~z$r_buff1_thd0~0_144 0) (= v_~z$w_buff0_used~0_607 0) (= v_~x~0_74 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1069~0.base_46| 1) |v_#valid_95|) (= v_~__unbuffered_p3_EAX~0_105 0) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1069~0.base_46| 4)) (= v_~z$w_buff1~0_201 0) (= v_~__unbuffered_cnt~0_157 0) (= v_~z$r_buff0_thd2~0_25 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_97|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_69, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1069~0.base=|v_ULTIMATE.start_main_~#t1069~0.base_46|, ~a~0=v_~a~0_68, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_105, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~z$mem_tmp~0=v_~z$mem_tmp~0_49, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_372, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_42|, ~z$flush_delayed~0=v_~z$flush_delayed~0_78, ~weak$$choice0~0=v_~weak$$choice0~0_39, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_69, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_271, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_128, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_22|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_201, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_45|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_144, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_19|, ~y~0=v_~y~0_82, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_607, ~z$w_buff0~0=v_~z$w_buff0~0_326, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_242, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_66|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_29|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_128|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_104, ULTIMATE.start_main_~#t1069~0.offset=|v_ULTIMATE.start_main_~#t1069~0.offset_30|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_45|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_94|, ~b~0=v_~b~0_46, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_29|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_26|, ~z~0=v_~z~0_172, ~weak$$choice2~0=v_~weak$$choice2~0_157, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet34, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t1069~0.base, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~nondet35, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1070~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1072~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1071~0.offset, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t1069~0.offset, ULTIMATE.start_main_~#t1071~0.base, #NULL.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, ULTIMATE.start_main_~#t1072~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:14:51,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L841-1-->L843: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1070~0.base_13| 4)) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1070~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1070~0.base_13|)) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1070~0.base_13| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1070~0.base_13|) |v_ULTIMATE.start_main_~#t1070~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1070~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, ULTIMATE.start_main_~#t1070~0.base=|v_ULTIMATE.start_main_~#t1070~0.base_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1070~0.offset=|v_ULTIMATE.start_main_~#t1070~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1070~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1070~0.offset, #length] because there is no mapped edge [2019-11-28 18:14:51,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1071~0.base_13|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1071~0.base_13| 4)) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1071~0.base_13|) |v_ULTIMATE.start_main_~#t1071~0.offset_11| 2)) |v_#memory_int_19|) (not (= |v_ULTIMATE.start_main_~#t1071~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1071~0.offset_11|) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t1071~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_6|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t1071~0.offset=|v_ULTIMATE.start_main_~#t1071~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1071~0.base=|v_ULTIMATE.start_main_~#t1071~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, ULTIMATE.start_main_~#t1071~0.offset, #length, ULTIMATE.start_main_~#t1071~0.base] because there is no mapped edge [2019-11-28 18:14:51,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L845-1-->L847: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1072~0.base_11|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1072~0.base_11|) |v_ULTIMATE.start_main_~#t1072~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1072~0.base_11| 4)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1072~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1072~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_5|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1072~0.base=|v_ULTIMATE.start_main_~#t1072~0.base_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1072~0.offset=|v_ULTIMATE.start_main_~#t1072~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet34, #valid, #memory_int, ULTIMATE.start_main_~#t1072~0.base, #length, ULTIMATE.start_main_~#t1072~0.offset] because there is no mapped edge [2019-11-28 18:14:51,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| (ite (not (and (not (= 0 (mod v_~z$w_buff0_used~0_112 256))) (not (= (mod v_~z$w_buff1_used~0_69 256) 0)))) 1 0)) (= v_~z$w_buff0~0_26 v_~z$w_buff1~0_20) (= 1 v_~z$w_buff0~0_25) (= v_~z$w_buff0_used~0_113 v_~z$w_buff1_used~0_69) (= v_~z$w_buff0_used~0_112 1) (not (= 0 v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10)) (= |v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8| v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10) (= v_P3Thread1of1ForFork1_~arg.offset_8 |v_P3Thread1of1ForFork1_#in~arg.offset_10|) (= |v_P3Thread1of1ForFork1_#in~arg.base_10| v_P3Thread1of1ForFork1_~arg.base_8)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_26, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|} OutVars{P3Thread1of1ForFork1___VERIFIER_assert_~expression=v_P3Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_112, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_10|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork1___VERIFIER_assert_#in~expression_8|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_8, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_10|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_8} AuxVars[] AssignedVars[P3Thread1of1ForFork1___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P3Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~z$w_buff1~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-11-28 18:14:51,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_18| v_P0Thread1of1ForFork2_~arg.offset_16) (= v_P0Thread1of1ForFork2_~arg.base_16 |v_P0Thread1of1ForFork2_#in~arg.base_18|) (= v_~b~0_24 1) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= v_~x~0_35 1) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1)) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_18|, ~b~0=v_~b~0_24, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_16, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_18|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|, ~x~0=v_~x~0_35, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_16} AuxVars[] AssignedVars[~b~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-11-28 18:14:51,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_48 2) (= 0 |v_P1Thread1of1ForFork3_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= v_~y~0_47 1) (= |v_P1Thread1of1ForFork3_#in~arg.offset_14| v_P1Thread1of1ForFork3_~arg.offset_12) (= |v_P1Thread1of1ForFork3_#in~arg.base_14| v_P1Thread1of1ForFork3_~arg.base_12)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_3|, P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_12, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_14|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_12, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_14|, ~y~0=v_~y~0_47, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0, ~y~0, ~x~0] because there is no mapped edge [2019-11-28 18:14:51,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L776-->L776-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-632797122 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite9_Out-632797122| |P2Thread1of1ForFork0_#t~ite8_Out-632797122|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-632797122 256)))) (or (= (mod ~z$w_buff0_used~0_In-632797122 256) 0) (and .cse0 (= 0 (mod ~z$w_buff1_used~0_In-632797122 256))) (and (= (mod ~z$r_buff1_thd3~0_In-632797122 256) 0) .cse0))) .cse1 (= ~z$w_buff0~0_In-632797122 |P2Thread1of1ForFork0_#t~ite8_Out-632797122|)) (and (= |P2Thread1of1ForFork0_#t~ite9_Out-632797122| ~z$w_buff0~0_In-632797122) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite8_In-632797122| |P2Thread1of1ForFork0_#t~ite8_Out-632797122|)))) InVars {P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_In-632797122|, ~z$w_buff0~0=~z$w_buff0~0_In-632797122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632797122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-632797122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632797122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-632797122, ~weak$$choice2~0=~weak$$choice2~0_In-632797122} OutVars{P2Thread1of1ForFork0_#t~ite8=|P2Thread1of1ForFork0_#t~ite8_Out-632797122|, ~z$w_buff0~0=~z$w_buff0~0_In-632797122, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-632797122, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-632797122, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-632797122, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-632797122, ~weak$$choice2~0=~weak$$choice2~0_In-632797122, P2Thread1of1ForFork0_#t~ite9=|P2Thread1of1ForFork0_#t~ite9_Out-632797122|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite8, P2Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-11-28 18:14:51,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In821158348 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite12_Out821158348| |P2Thread1of1ForFork0_#t~ite11_Out821158348|) .cse0 (= |P2Thread1of1ForFork0_#t~ite11_Out821158348| ~z$w_buff1~0_In821158348) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In821158348 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd3~0_In821158348 256) 0)) (= (mod ~z$w_buff0_used~0_In821158348 256) 0) (and .cse1 (= (mod ~z$w_buff1_used~0_In821158348 256) 0))))) (and (= |P2Thread1of1ForFork0_#t~ite11_In821158348| |P2Thread1of1ForFork0_#t~ite11_Out821158348|) (= |P2Thread1of1ForFork0_#t~ite12_Out821158348| ~z$w_buff1~0_In821158348) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In821158348, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_In821158348|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821158348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821158348, ~z$w_buff1~0=~z$w_buff1~0_In821158348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821158348, ~weak$$choice2~0=~weak$$choice2~0_In821158348} OutVars{P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out821158348|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In821158348, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out821158348|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In821158348, ~z$w_buff1_used~0=~z$w_buff1_used~0_In821158348, ~z$w_buff1~0=~z$w_buff1~0_In821158348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In821158348, ~weak$$choice2~0=~weak$$choice2~0_In821158348} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11, P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-11-28 18:14:51,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L778-->L778-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In427108858 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite14_Out427108858| ~z$w_buff0_used~0_In427108858) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In427108858 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In427108858 256)) .cse1) (= (mod ~z$w_buff0_used~0_In427108858 256) 0) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In427108858 256) 0)))) (= |P2Thread1of1ForFork0_#t~ite14_Out427108858| |P2Thread1of1ForFork0_#t~ite15_Out427108858|)) (and (= ~z$w_buff0_used~0_In427108858 |P2Thread1of1ForFork0_#t~ite15_Out427108858|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite14_In427108858| |P2Thread1of1ForFork0_#t~ite14_Out427108858|)))) InVars {P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_In427108858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In427108858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In427108858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In427108858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In427108858, ~weak$$choice2~0=~weak$$choice2~0_In427108858} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out427108858|, P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out427108858|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In427108858, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In427108858, ~z$w_buff1_used~0=~z$w_buff1_used~0_In427108858, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In427108858, ~weak$$choice2~0=~weak$$choice2~0_In427108858} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-11-28 18:14:51,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L780-->L781: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~z$r_buff0_thd3~0_73 v_~z$r_buff0_thd3~0_72)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_72, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_9|, ~weak$$choice2~0=v_~weak$$choice2~0_32, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-11-28 18:14:51,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-678146615 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-678146615 256)))) (or (and (= |P3Thread1of1ForFork1_#t~ite28_Out-678146615| ~z$w_buff0_used~0_In-678146615) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork1_#t~ite28_Out-678146615| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-678146615, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-678146615} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-678146615, P3Thread1of1ForFork1_#t~ite28=|P3Thread1of1ForFork1_#t~ite28_Out-678146615|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-678146615} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-11-28 18:14:51,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L783-->L791: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_16 v_~z$mem_tmp~0_4) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite25=|v_P2Thread1of1ForFork0_#t~ite25_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite25, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:14:51,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1816489358 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1816489358 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In1816489358 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1816489358 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork1_#t~ite29_Out1816489358|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1816489358 |P3Thread1of1ForFork1_#t~ite29_Out1816489358|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1816489358, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816489358, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1816489358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816489358} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1816489358, P3Thread1of1ForFork1_#t~ite29=|P3Thread1of1ForFork1_#t~ite29_Out1816489358|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816489358, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1816489358, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816489358} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-11-28 18:14:51,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L821-->L822: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1095020446 256))) (.cse0 (= ~z$r_buff0_thd4~0_In-1095020446 ~z$r_buff0_thd4~0_Out-1095020446)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1095020446 256) 0))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= 0 ~z$r_buff0_thd4~0_Out-1095020446)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095020446, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1095020446} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095020446, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1095020446, P3Thread1of1ForFork1_#t~ite30=|P3Thread1of1ForFork1_#t~ite30_Out-1095020446|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:14:51,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L822-->L822-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd4~0_In1517931117 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1517931117 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1517931117 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1517931117 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork1_#t~ite31_Out1517931117| 0)) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork1_#t~ite31_Out1517931117| ~z$r_buff1_thd4~0_In1517931117) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1517931117, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517931117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1517931117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517931117} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1517931117, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1517931117, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1517931117, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1517931117, P3Thread1of1ForFork1_#t~ite31=|P3Thread1of1ForFork1_#t~ite31_Out1517931117|} AuxVars[] AssignedVars[P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:14:51,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L822-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= v_~z$r_buff1_thd4~0_56 |v_P3Thread1of1ForFork1_#t~ite31_58|) (= |v_P3Thread1of1ForFork1_#res.offset_3| 0) (= |v_P3Thread1of1ForFork1_#res.base_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_58|} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_56, P3Thread1of1ForFork1_#res.base=|v_P3Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork1_#res.offset=|v_P3Thread1of1ForFork1_#res.offset_3|, P3Thread1of1ForFork1_#t~ite31=|v_P3Thread1of1ForFork1_#t~ite31_57|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork1_#res.offset, P3Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-11-28 18:14:51,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L847-1-->L853: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_60) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{ULTIMATE.start_main_#t~nondet35=|v_ULTIMATE.start_main_#t~nondet35_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet35, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:14:51,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L853-2-->L853-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In201119521 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In201119521 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In201119521 |ULTIMATE.start_main_#t~ite36_Out201119521|)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In201119521 |ULTIMATE.start_main_#t~ite36_Out201119521|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In201119521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In201119521, ~z$w_buff1~0=~z$w_buff1~0_In201119521, ~z~0=~z~0_In201119521} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In201119521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In201119521, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out201119521|, ~z$w_buff1~0=~z$w_buff1~0_In201119521, ~z~0=~z~0_In201119521} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:14:51,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L853-4-->L854: Formula: (= v_~z~0_38 |v_ULTIMATE.start_main_#t~ite36_16|) InVars {ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_16|} OutVars{ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_15|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_13|, ~z~0=v_~z~0_38} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2019-11-28 18:14:51,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In706864904 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In706864904 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In706864904 |ULTIMATE.start_main_#t~ite38_Out706864904|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out706864904|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706864904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706864904} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706864904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706864904, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out706864904|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:14:51,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L855-->L855-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In599984634 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In599984634 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In599984634 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In599984634 256) 0))) (or (and (= ~z$w_buff1_used~0_In599984634 |ULTIMATE.start_main_#t~ite39_Out599984634|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out599984634|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599984634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599984634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599984634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599984634} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In599984634, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out599984634|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In599984634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In599984634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In599984634} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:14:51,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-893824204 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-893824204 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-893824204| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-893824204| ~z$r_buff0_thd0~0_In-893824204)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893824204, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893824204} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-893824204, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-893824204|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-893824204} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:14:51,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1276229973 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1276229973 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1276229973 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1276229973 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out-1276229973| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1276229973 |ULTIMATE.start_main_#t~ite41_Out-1276229973|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1276229973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1276229973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1276229973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1276229973} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1276229973|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1276229973, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1276229973, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1276229973, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1276229973} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-11-28 18:14:51,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_110 |v_ULTIMATE.start_main_#t~ite41_51|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~main$tmp_guard1~0_23 (ite (= (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_73) (= 0 v_~__unbuffered_p3_EBX~0_72) (= 0 v_~__unbuffered_p2_EAX~0_29) (= v_~x~0_52 2) (= v_~y~0_52 2))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_51|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_50|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_110, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_72, ~y~0=v_~y~0_52, ~x~0=v_~x~0_52, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:14:51,511 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:14:51,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:14:51,516 INFO L168 Benchmark]: Toolchain (without parser) took 26306.88 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 955.0 MB in the beginning and 824.2 MB in the end (delta: 130.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:51,516 INFO L168 Benchmark]: CDTParser took 0.28 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:14:51,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:51,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:51,518 INFO L168 Benchmark]: Boogie Preprocessor took 40.61 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:14:51,518 INFO L168 Benchmark]: RCFGBuilder took 987.88 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:14:51,519 INFO L168 Benchmark]: TraceAbstraction took 24169.35 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 824.2 MB in the end (delta: 215.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-28 18:14:51,519 INFO L168 Benchmark]: Witness Printer took 184.47 ms. Allocated memory is still 2.5 GB. Free memory is still 824.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:14:51,521 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 826.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.61 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 987.88 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: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24169.35 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.3 GB). Free memory was 1.0 GB in the beginning and 824.2 MB in the end (delta: 215.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 184.47 ms. Allocated memory is still 2.5 GB. Free memory is still 824.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 169 ProgramPointsBefore, 79 ProgramPointsAfterwards, 191 TransitionsBefore, 83 TransitionsAfterwards, 12650 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 23 ChoiceCompositions, 5572 VarBasedMoverChecksPositive, 186 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 165 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 46301 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t1069, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t1070, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t1071, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1072, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 [L809] 4 a = 1 [L812] 4 __unbuffered_p3_EAX = a [L815] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L819] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L820] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L853] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 23.8s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1796 SDtfs, 1890 SDslu, 3015 SDs, 0 SdLazy, 1058 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35874occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 19661 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 435 ConstructedInterpolants, 0 QuantifiedInterpolants, 51482 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...