./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a0c04adec756cefd794d8958a9954363bf4bc8f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:46,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:02:46,899 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:02:46,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:02:46,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:02:46,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:02:46,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:02:46,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:02:46,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:02:46,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:02:46,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:02:46,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:02:46,923 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:02:46,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:02:46,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:02:46,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:02:46,931 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:02:46,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:02:46,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:02:46,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:02:46,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:02:46,947 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:02:46,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:02:46,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:02:46,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:02:46,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:02:46,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:02:46,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:02:46,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:02:46,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:02:46,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:02:46,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:02:46,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:02:46,965 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:02:46,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:02:46,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:02:46,971 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:02:46,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:02:46,973 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:02:46,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:02:46,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:02:46,982 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:02:47,019 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:02:47,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:02:47,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:02:47,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:02:47,024 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:02:47,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:02:47,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:02:47,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:02:47,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:02:47,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:02:47,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:02:47,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:02:47,027 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:02:47,027 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:02:47,028 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:02:47,028 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:02:47,028 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:02:47,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:02:47,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:02:47,029 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:02:47,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:02:47,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:02:47,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:02:47,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:02:47,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:02:47,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:02:47,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:02:47,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:02:47,033 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:02:47,033 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 -> 7a0c04adec756cefd794d8958a9954363bf4bc8f [2019-11-28 18:02:47,325 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:02:47,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:02:47,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:02:47,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:02:47,348 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:02:47,349 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i [2019-11-28 18:02:47,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6312f516/8a3a4e6bf1f34aa9a4523bac6de76629/FLAG793b93bf9 [2019-11-28 18:02:47,995 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:02:47,996 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix009_power.oepc.i [2019-11-28 18:02:48,022 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6312f516/8a3a4e6bf1f34aa9a4523bac6de76629/FLAG793b93bf9 [2019-11-28 18:02:48,266 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6312f516/8a3a4e6bf1f34aa9a4523bac6de76629 [2019-11-28 18:02:48,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:02:48,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:02:48,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:48,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:02:48,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:02:48,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:48" (1/1) ... [2019-11-28 18:02:48,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54986a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:48, skipping insertion in model container [2019-11-28 18:02:48,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:02:48" (1/1) ... [2019-11-28 18:02:48,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:02:48,352 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:02:48,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:48,871 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:02:48,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:02:49,025 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:02:49,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49 WrapperNode [2019-11-28 18:02:49,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:02:49,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:49,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:02:49,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:02:49,037 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:02:49" (1/1) ... [2019-11-28 18:02:49,058 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:02:49" (1/1) ... [2019-11-28 18:02:49,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:02:49,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:02:49,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:02:49,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:02:49,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (1/1) ... [2019-11-28 18:02:49,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:02:49,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:02:49,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:02:49,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:02:49,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (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:02:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:02:49,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:02:49,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:02:49,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:02:49,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:02:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:02:49,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:02:49,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:02:49,216 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:02:49,961 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:02:49,962 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:02:49,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:49 BoogieIcfgContainer [2019-11-28 18:02:49,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:02:49,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:02:49,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:02:49,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:02:49,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:02:48" (1/3) ... [2019-11-28 18:02:49,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65595ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:49, skipping insertion in model container [2019-11-28 18:02:49,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:02:49" (2/3) ... [2019-11-28 18:02:49,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65595ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:02:49, skipping insertion in model container [2019-11-28 18:02:49,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:49" (3/3) ... [2019-11-28 18:02:49,972 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-11-28 18:02:49,982 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:02:49,983 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:02:49,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:02:49,992 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:02:50,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:02:50,086 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:02:50,103 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:02:50,103 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:02:50,103 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:02:50,103 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:02:50,104 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:02:50,104 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:02:50,104 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:02:50,104 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:02:50,121 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-11-28 18:02:50,124 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-11-28 18:02:50,211 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-11-28 18:02:50,212 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:50,228 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:02:50,252 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-11-28 18:02:50,299 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-11-28 18:02:50,299 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:02:50,309 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:02:50,331 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:02:50,332 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:02:54,899 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:02:55,014 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:02:55,382 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-11-28 18:02:55,505 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-28 18:02:55,528 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-11-28 18:02:55,529 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-11-28 18:02:55,532 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-11-28 18:02:56,047 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:02:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:02:56,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:02:56,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:02:56,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:02:56,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:02:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:02:56,070 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-11-28 18:02:56,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:02:56,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025429169] [2019-11-28 18:02:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:02:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:02:56,376 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:02:56,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025429169] [2019-11-28 18:02:56,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:02:56,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:02:56,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291247471] [2019-11-28 18:02:56,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:02:56,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:02:56,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:02:56,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:02:56,418 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:02:56,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:02:56,823 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-11-28 18:02:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:02:56,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:02:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:02:56,949 INFO L225 Difference]: With dead ends: 8466 [2019-11-28 18:02:56,958 INFO L226 Difference]: Without dead ends: 7974 [2019-11-28 18:02:56,960 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:02:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-11-28 18:02:57,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-11-28 18:02:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-11-28 18:02:57,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-11-28 18:02:57,463 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-11-28 18:02:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:02:57,464 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-11-28 18:02:57,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:02:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-11-28 18:02:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:02:57,473 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:02:57,474 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:02:57,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:02:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:02:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-11-28 18:02:57,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:02:57,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851317565] [2019-11-28 18:02:57,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:02:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:02:57,643 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:02:57,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851317565] [2019-11-28 18:02:57,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:02:57,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:02:57,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147867072] [2019-11-28 18:02:57,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:02:57,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:02:57,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:02:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:02:57,647 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 4 states. [2019-11-28 18:02:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:02:58,013 INFO L93 Difference]: Finished difference Result 12158 states and 38103 transitions. [2019-11-28 18:02:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:02:58,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:02:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:02:58,089 INFO L225 Difference]: With dead ends: 12158 [2019-11-28 18:02:58,089 INFO L226 Difference]: Without dead ends: 12151 [2019-11-28 18:02:58,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:02:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12151 states. [2019-11-28 18:02:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12151 to 10962. [2019-11-28 18:02:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10962 states. [2019-11-28 18:02:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 34971 transitions. [2019-11-28 18:02:58,663 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 34971 transitions. Word has length 11 [2019-11-28 18:02:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:02:58,665 INFO L462 AbstractCegarLoop]: Abstraction has 10962 states and 34971 transitions. [2019-11-28 18:02:58,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:02:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 34971 transitions. [2019-11-28 18:02:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:02:58,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:02:58,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:02:58,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:02:58,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:02:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-11-28 18:02:58,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:02:58,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706744716] [2019-11-28 18:02:58,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:02:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:02:58,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:02:58,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706744716] [2019-11-28 18:02:58,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:02:58,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:02:58,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724821979] [2019-11-28 18:02:58,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:02:58,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:02:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:02:58,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:02:58,816 INFO L87 Difference]: Start difference. First operand 10962 states and 34971 transitions. Second operand 5 states. [2019-11-28 18:02:59,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:02:59,237 INFO L93 Difference]: Finished difference Result 15393 states and 48301 transitions. [2019-11-28 18:02:59,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:02:59,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-28 18:02:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:02:59,304 INFO L225 Difference]: With dead ends: 15393 [2019-11-28 18:02:59,304 INFO L226 Difference]: Without dead ends: 15393 [2019-11-28 18:02:59,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:02:59,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15393 states. [2019-11-28 18:02:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15393 to 12374. [2019-11-28 18:02:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12374 states. [2019-11-28 18:02:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12374 states to 12374 states and 39394 transitions. [2019-11-28 18:02:59,794 INFO L78 Accepts]: Start accepts. Automaton has 12374 states and 39394 transitions. Word has length 14 [2019-11-28 18:02:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:02:59,795 INFO L462 AbstractCegarLoop]: Abstraction has 12374 states and 39394 transitions. [2019-11-28 18:02:59,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:02:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 12374 states and 39394 transitions. [2019-11-28 18:02:59,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:02:59,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:02:59,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:02:59,801 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:02:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:02:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash 484931163, now seen corresponding path program 1 times [2019-11-28 18:02:59,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:02:59,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466450933] [2019-11-28 18:02:59,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:02:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:02:59,910 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:02:59,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466450933] [2019-11-28 18:02:59,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:02:59,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:02:59,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055515399] [2019-11-28 18:02:59,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:02:59,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:02:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:02:59,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:02:59,912 INFO L87 Difference]: Start difference. First operand 12374 states and 39394 transitions. Second operand 3 states. [2019-11-28 18:02:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:02:59,969 INFO L93 Difference]: Finished difference Result 11716 states and 36735 transitions. [2019-11-28 18:02:59,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:02:59,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:02:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:00,009 INFO L225 Difference]: With dead ends: 11716 [2019-11-28 18:03:00,010 INFO L226 Difference]: Without dead ends: 11716 [2019-11-28 18:03:00,010 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:03:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11716 states. [2019-11-28 18:03:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11716 to 11636. [2019-11-28 18:03:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11636 states. [2019-11-28 18:03:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 36503 transitions. [2019-11-28 18:03:00,523 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 36503 transitions. Word has length 16 [2019-11-28 18:03:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:00,523 INFO L462 AbstractCegarLoop]: Abstraction has 11636 states and 36503 transitions. [2019-11-28 18:03:00,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 36503 transitions. [2019-11-28 18:03:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:03:00,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:00,527 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:00,528 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:00,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash 465765166, now seen corresponding path program 1 times [2019-11-28 18:03:00,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:00,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815608524] [2019-11-28 18:03:00,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:00,606 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:03:00,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815608524] [2019-11-28 18:03:00,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:00,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:03:00,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127895610] [2019-11-28 18:03:00,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:00,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:00,609 INFO L87 Difference]: Start difference. First operand 11636 states and 36503 transitions. Second operand 3 states. [2019-11-28 18:03:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:00,679 INFO L93 Difference]: Finished difference Result 11698 states and 36598 transitions. [2019-11-28 18:03:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:00,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:03:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:00,732 INFO L225 Difference]: With dead ends: 11698 [2019-11-28 18:03:00,733 INFO L226 Difference]: Without dead ends: 11698 [2019-11-28 18:03:00,733 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:03:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2019-11-28 18:03:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 11633. [2019-11-28 18:03:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-11-28 18:03:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 36494 transitions. [2019-11-28 18:03:01,057 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 36494 transitions. Word has length 16 [2019-11-28 18:03:01,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:01,057 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 36494 transitions. [2019-11-28 18:03:01,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 36494 transitions. [2019-11-28 18:03:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:03:01,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:01,063 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:01,063 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1868214612, now seen corresponding path program 1 times [2019-11-28 18:03:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129354651] [2019-11-28 18:03:01,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:01,158 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:03:01,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129354651] [2019-11-28 18:03:01,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:01,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970024768] [2019-11-28 18:03:01,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:01,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:01,165 INFO L87 Difference]: Start difference. First operand 11633 states and 36494 transitions. Second operand 4 states. [2019-11-28 18:03:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:01,225 INFO L93 Difference]: Finished difference Result 11465 states and 35956 transitions. [2019-11-28 18:03:01,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:01,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:03:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:01,246 INFO L225 Difference]: With dead ends: 11465 [2019-11-28 18:03:01,246 INFO L226 Difference]: Without dead ends: 11465 [2019-11-28 18:03:01,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:03:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2019-11-28 18:03:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 11465. [2019-11-28 18:03:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11465 states. [2019-11-28 18:03:01,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 35956 transitions. [2019-11-28 18:03:01,578 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 35956 transitions. Word has length 17 [2019-11-28 18:03:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:01,578 INFO L462 AbstractCegarLoop]: Abstraction has 11465 states and 35956 transitions. [2019-11-28 18:03:01,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:01,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 35956 transitions. [2019-11-28 18:03:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:03:01,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:01,586 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:03:01,587 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:01,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -715570933, now seen corresponding path program 1 times [2019-11-28 18:03:01,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:01,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829315337] [2019-11-28 18:03:01,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:01,678 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:03:01,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829315337] [2019-11-28 18:03:01,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:01,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:01,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85797620] [2019-11-28 18:03:01,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:01,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:01,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:01,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:01,681 INFO L87 Difference]: Start difference. First operand 11465 states and 35956 transitions. Second operand 4 states. [2019-11-28 18:03:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:01,756 INFO L93 Difference]: Finished difference Result 11508 states and 35995 transitions. [2019-11-28 18:03:01,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:01,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 18:03:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:01,781 INFO L225 Difference]: With dead ends: 11508 [2019-11-28 18:03:01,782 INFO L226 Difference]: Without dead ends: 11508 [2019-11-28 18:03:01,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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:03:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11508 states. [2019-11-28 18:03:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11508 to 11443. [2019-11-28 18:03:02,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11443 states. [2019-11-28 18:03:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 35891 transitions. [2019-11-28 18:03:02,133 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 35891 transitions. Word has length 18 [2019-11-28 18:03:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:02,134 INFO L462 AbstractCegarLoop]: Abstraction has 11443 states and 35891 transitions. [2019-11-28 18:03:02,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:02,135 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 35891 transitions. [2019-11-28 18:03:02,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:03:02,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:02,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:02,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -393466089, now seen corresponding path program 1 times [2019-11-28 18:03:02,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:02,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709470593] [2019-11-28 18:03:02,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:02,183 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:03:02,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709470593] [2019-11-28 18:03:02,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:02,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:03:02,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108895207] [2019-11-28 18:03:02,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:02,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:02,186 INFO L87 Difference]: Start difference. First operand 11443 states and 35891 transitions. Second operand 3 states. [2019-11-28 18:03:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:02,200 INFO L93 Difference]: Finished difference Result 1506 states and 3373 transitions. [2019-11-28 18:03:02,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:02,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:03:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:02,203 INFO L225 Difference]: With dead ends: 1506 [2019-11-28 18:03:02,204 INFO L226 Difference]: Without dead ends: 1506 [2019-11-28 18:03:02,204 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:03:02,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-11-28 18:03:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2019-11-28 18:03:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-11-28 18:03:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 3373 transitions. [2019-11-28 18:03:02,234 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 3373 transitions. Word has length 19 [2019-11-28 18:03:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:02,235 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 3373 transitions. [2019-11-28 18:03:02,235 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 3373 transitions. [2019-11-28 18:03:02,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:03:02,238 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:02,238 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:02,239 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:02,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-11-28 18:03:02,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:02,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146780693] [2019-11-28 18:03:02,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:02,529 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-11-28 18:03:02,542 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:03:02,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146780693] [2019-11-28 18:03:02,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:02,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:03:02,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466777659] [2019-11-28 18:03:02,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:03:02,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:02,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:03:02,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:03:02,544 INFO L87 Difference]: Start difference. First operand 1506 states and 3373 transitions. Second operand 6 states. [2019-11-28 18:03:02,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:02,983 INFO L93 Difference]: Finished difference Result 2289 states and 4911 transitions. [2019-11-28 18:03:02,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:03:02,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:03:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:02,987 INFO L225 Difference]: With dead ends: 2289 [2019-11-28 18:03:02,988 INFO L226 Difference]: Without dead ends: 2289 [2019-11-28 18:03:02,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:03:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-11-28 18:03:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1520. [2019-11-28 18:03:03,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2019-11-28 18:03:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3402 transitions. [2019-11-28 18:03:03,017 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3402 transitions. Word has length 25 [2019-11-28 18:03:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:03,017 INFO L462 AbstractCegarLoop]: Abstraction has 1520 states and 3402 transitions. [2019-11-28 18:03:03,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:03:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3402 transitions. [2019-11-28 18:03:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:03:03,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:03,020 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:03,021 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:03,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-11-28 18:03:03,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:03,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934227251] [2019-11-28 18:03:03,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:03,110 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:03:03,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934227251] [2019-11-28 18:03:03,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:03,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:03,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885911561] [2019-11-28 18:03:03,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:03,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:03,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:03,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:03,113 INFO L87 Difference]: Start difference. First operand 1520 states and 3402 transitions. Second operand 4 states. [2019-11-28 18:03:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:03,128 INFO L93 Difference]: Finished difference Result 737 states and 1632 transitions. [2019-11-28 18:03:03,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:03:03,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:03:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:03,130 INFO L225 Difference]: With dead ends: 737 [2019-11-28 18:03:03,130 INFO L226 Difference]: Without dead ends: 737 [2019-11-28 18:03:03,131 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:03:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-11-28 18:03:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-11-28 18:03:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-28 18:03:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1632 transitions. [2019-11-28 18:03:03,142 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1632 transitions. Word has length 28 [2019-11-28 18:03:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:03,144 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1632 transitions. [2019-11-28 18:03:03,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1632 transitions. [2019-11-28 18:03:03,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:03,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:03,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:03,149 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 299597665, now seen corresponding path program 1 times [2019-11-28 18:03:03,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:03,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061198457] [2019-11-28 18:03:03,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:03,202 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:03:03,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061198457] [2019-11-28 18:03:03,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:03,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:03,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658959807] [2019-11-28 18:03:03,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:03:03,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:03,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:03:03,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:03:03,204 INFO L87 Difference]: Start difference. First operand 737 states and 1632 transitions. Second operand 3 states. [2019-11-28 18:03:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:03,251 INFO L93 Difference]: Finished difference Result 1125 states and 2413 transitions. [2019-11-28 18:03:03,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:03,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:03:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:03,254 INFO L225 Difference]: With dead ends: 1125 [2019-11-28 18:03:03,254 INFO L226 Difference]: Without dead ends: 1125 [2019-11-28 18:03:03,254 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:03:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-11-28 18:03:03,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 840. [2019-11-28 18:03:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-11-28 18:03:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1837 transitions. [2019-11-28 18:03:03,269 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1837 transitions. Word has length 52 [2019-11-28 18:03:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:03,269 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1837 transitions. [2019-11-28 18:03:03,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:03:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1837 transitions. [2019-11-28 18:03:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:03,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:03,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:03,274 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:03,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:03,274 INFO L82 PathProgramCache]: Analyzing trace with hash -921868638, now seen corresponding path program 1 times [2019-11-28 18:03:03,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:03,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809142551] [2019-11-28 18:03:03,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:03,423 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:03:03,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809142551] [2019-11-28 18:03:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:03,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:03:03,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147775143] [2019-11-28 18:03:03,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:03,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:03,428 INFO L87 Difference]: Start difference. First operand 840 states and 1837 transitions. Second operand 7 states. [2019-11-28 18:03:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:04,129 INFO L93 Difference]: Finished difference Result 1572 states and 3311 transitions. [2019-11-28 18:03:04,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:03:04,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:03:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:04,132 INFO L225 Difference]: With dead ends: 1572 [2019-11-28 18:03:04,132 INFO L226 Difference]: Without dead ends: 1572 [2019-11-28 18:03:04,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:03:04,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-11-28 18:03:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1093. [2019-11-28 18:03:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-11-28 18:03:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2376 transitions. [2019-11-28 18:03:04,152 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 2376 transitions. Word has length 52 [2019-11-28 18:03:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:04,153 INFO L462 AbstractCegarLoop]: Abstraction has 1093 states and 2376 transitions. [2019-11-28 18:03:04,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:04,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 2376 transitions. [2019-11-28 18:03:04,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:03:04,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:04,156 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:04,157 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:04,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1483615416, now seen corresponding path program 2 times [2019-11-28 18:03:04,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:04,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288209995] [2019-11-28 18:03:04,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:04,253 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:03:04,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288209995] [2019-11-28 18:03:04,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:04,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:03:04,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399638427] [2019-11-28 18:03:04,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:03:04,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:04,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:03:04,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:03:04,255 INFO L87 Difference]: Start difference. First operand 1093 states and 2376 transitions. Second operand 4 states. [2019-11-28 18:03:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:04,322 INFO L93 Difference]: Finished difference Result 1343 states and 2901 transitions. [2019-11-28 18:03:04,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:03:04,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:03:04,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:04,325 INFO L225 Difference]: With dead ends: 1343 [2019-11-28 18:03:04,325 INFO L226 Difference]: Without dead ends: 1343 [2019-11-28 18:03:04,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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:03:04,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-28 18:03:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 997. [2019-11-28 18:03:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-28 18:03:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2200 transitions. [2019-11-28 18:03:04,339 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2200 transitions. Word has length 52 [2019-11-28 18:03:04,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:04,339 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 2200 transitions. [2019-11-28 18:03:04,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:03:04,339 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2200 transitions. [2019-11-28 18:03:04,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:03:04,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:04,346 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:04,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:04,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:04,346 INFO L82 PathProgramCache]: Analyzing trace with hash 223383117, now seen corresponding path program 1 times [2019-11-28 18:03:04,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:04,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753509939] [2019-11-28 18:03:04,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:03:04,463 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:03:04,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753509939] [2019-11-28 18:03:04,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:03:04,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:03:04,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075122573] [2019-11-28 18:03:04,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:03:04,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:03:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:03:04,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:03:04,466 INFO L87 Difference]: Start difference. First operand 997 states and 2200 transitions. Second operand 7 states. [2019-11-28 18:03:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:03:04,772 INFO L93 Difference]: Finished difference Result 2804 states and 6026 transitions. [2019-11-28 18:03:04,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:03:04,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:03:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:03:04,776 INFO L225 Difference]: With dead ends: 2804 [2019-11-28 18:03:04,777 INFO L226 Difference]: Without dead ends: 1904 [2019-11-28 18:03:04,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:03:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2019-11-28 18:03:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1060. [2019-11-28 18:03:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-11-28 18:03:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2337 transitions. [2019-11-28 18:03:04,799 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2337 transitions. Word has length 53 [2019-11-28 18:03:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:03:04,799 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 2337 transitions. [2019-11-28 18:03:04,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:03:04,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2337 transitions. [2019-11-28 18:03:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:03:04,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:03:04,803 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:03:04,803 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:03:04,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:03:04,803 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 2 times [2019-11-28 18:03:04,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:03:04,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291417866] [2019-11-28 18:03:04,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:03:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:03:04,918 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:03:04,918 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:03:04,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t241~0.base_34|) 0) (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t241~0.base_34| 4)) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_493 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t241~0.base_34| 1)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_ULTIMATE.start_main_~#t241~0.offset_22| 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_34|) |v_ULTIMATE.start_main_~#t241~0.offset_22| 0)) |v_#memory_int_15|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t241~0.base_34|) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_~#t241~0.base=|v_ULTIMATE.start_main_~#t241~0.base_34|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_~#t241~0.offset=|v_ULTIMATE.start_main_~#t241~0.offset_22|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_31|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_21|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t241~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t241~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t242~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-11-28 18:03:04,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110 0)) (= ~z$r_buff0_thd1~0_Out1745413110 1) (= ~x~0_Out1745413110 1) (= ~z$r_buff1_thd2~0_Out1745413110 ~z$r_buff0_thd2~0_In1745413110) (= ~z$r_buff1_thd0~0_Out1745413110 ~z$r_buff0_thd0~0_In1745413110) (= ~y~0_In1745413110 ~__unbuffered_p0_EBX~0_Out1745413110) (= ~z$r_buff0_thd1~0_In1745413110 ~z$r_buff1_thd1~0_Out1745413110) (= ~x~0_Out1745413110 ~__unbuffered_p0_EAX~0_Out1745413110)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1745413110, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110, ~y~0=~y~0_In1745413110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1745413110, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1745413110} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1745413110, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1745413110, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1745413110, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1745413110, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1745413110, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1745413110, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1745413110, ~y~0=~y~0_In1745413110, ~x~0=~x~0_Out1745413110, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1745413110} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:04,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t242~0.offset_11| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) |v_ULTIMATE.start_main_~#t242~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t242~0.base_12| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t242~0.base_12| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t242~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-11-28 18:03:04,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-669079613 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-669079613 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-669079613 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In-669079613 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-669079613 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-669079613| ~z$w_buff0_used~0_In-669079613) (= |P1Thread1of1ForFork1_#t~ite20_Out-669079613| |P1Thread1of1ForFork1_#t~ite21_Out-669079613|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-669079613| |P1Thread1of1ForFork1_#t~ite20_Out-669079613|) (= |P1Thread1of1ForFork1_#t~ite21_Out-669079613| ~z$w_buff0_used~0_In-669079613) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-669079613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-669079613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-669079613, ~weak$$choice2~0=~weak$$choice2~0_In-669079613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-669079613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-669079613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-669079613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-669079613|, ~weak$$choice2~0=~weak$$choice2~0_In-669079613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-669079613} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:03:04,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:03:04,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1940340031 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1940340031| |P1Thread1of1ForFork1_#t~ite30_Out-1940340031|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1940340031 256)))) (or (and (= (mod ~z$r_buff1_thd2~0_In-1940340031 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1940340031 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1940340031 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1940340031| ~z$r_buff1_thd2~0_In-1940340031)) (and (= ~z$r_buff1_thd2~0_In-1940340031 |P1Thread1of1ForFork1_#t~ite30_Out-1940340031|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1940340031| |P1Thread1of1ForFork1_#t~ite29_Out-1940340031|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1940340031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940340031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1940340031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940340031, ~weak$$choice2~0=~weak$$choice2~0_In-1940340031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940340031} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1940340031|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1940340031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940340031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1940340031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940340031, ~weak$$choice2~0=~weak$$choice2~0_In-1940340031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940340031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:03:04,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:03:04,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1287121919 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1287121919 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1287121919| |P1Thread1of1ForFork1_#t~ite33_Out1287121919|))) (or (and (or .cse0 .cse1) (= ~z~0_In1287121919 |P1Thread1of1ForFork1_#t~ite32_Out1287121919|) .cse2) (and (= ~z$w_buff1~0_In1287121919 |P1Thread1of1ForFork1_#t~ite32_Out1287121919|) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1287121919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1287121919, ~z$w_buff1~0=~z$w_buff1~0_In1287121919, ~z~0=~z~0_In1287121919} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1287121919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1287121919, ~z$w_buff1~0=~z$w_buff1~0_In1287121919, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1287121919|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1287121919|, ~z~0=~z~0_In1287121919} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:03:04,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1127012740 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1127012740 256)))) (or (and (= ~z$w_buff0_used~0_In-1127012740 |P1Thread1of1ForFork1_#t~ite34_Out-1127012740|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1127012740|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127012740, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1127012740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127012740, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1127012740|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1127012740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:03:04,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1063332651 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1063332651 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1063332651 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1063332651 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1063332651| ~z$w_buff1_used~0_In-1063332651)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1063332651| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063332651, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063332651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063332651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063332651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063332651, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063332651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063332651, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1063332651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063332651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:03:04,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1458504983 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1458504983 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1458504983| 0)) (and (= ~z$r_buff0_thd2~0_In1458504983 |P1Thread1of1ForFork1_#t~ite36_Out1458504983|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1458504983, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1458504983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1458504983, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1458504983, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1458504983|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:03:04,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1654057460 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1654057460 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1654057460 |P0Thread1of1ForFork0_#t~ite5_Out1654057460|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1654057460|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1654057460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1654057460} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1654057460|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1654057460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1654057460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:03:04,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In1239339556 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1239339556 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1239339556 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1239339556 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1239339556| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1239339556 |P0Thread1of1ForFork0_#t~ite6_Out1239339556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1239339556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1239339556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1239339556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1239339556} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1239339556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1239339556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1239339556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1239339556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1239339556} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:03:04,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2036736536 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2036736536 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2036736536 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2036736536 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In2036736536 |P1Thread1of1ForFork1_#t~ite37_Out2036736536|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2036736536|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2036736536, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2036736536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2036736536, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2036736536} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2036736536, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2036736536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2036736536, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2036736536, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2036736536|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:04,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:04,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1722277461 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1722277461 256) 0)) (.cse0 (= ~z$r_buff0_thd1~0_Out-1722277461 ~z$r_buff0_thd1~0_In-1722277461))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd1~0_Out-1722277461 0) (not .cse2) (not .cse1)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722277461, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1722277461} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722277461, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1722277461|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1722277461} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1609719186 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1609719186 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1609719186 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1609719186 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1609719186|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In1609719186 |P0Thread1of1ForFork0_#t~ite8_Out1609719186|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1609719186, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1609719186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1609719186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1609719186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1609719186, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1609719186|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1609719186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1609719186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1609719186} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:03:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:03:04,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:03:04,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In923038148 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In923038148 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out923038148| ~z$w_buff1~0_In923038148)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out923038148| ~z~0_In923038148)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923038148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923038148, ~z$w_buff1~0=~z$w_buff1~0_In923038148, ~z~0=~z~0_In923038148} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out923038148|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923038148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923038148, ~z$w_buff1~0=~z$w_buff1~0_In923038148, ~z~0=~z~0_In923038148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:03:04,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:03:04,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-313734220 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313734220 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-313734220 |ULTIMATE.start_main_#t~ite42_Out-313734220|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-313734220|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-313734220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313734220} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-313734220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313734220, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-313734220|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:03:04,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1883341558 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1883341558 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1883341558 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1883341558 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1883341558|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1883341558 |ULTIMATE.start_main_#t~ite43_Out1883341558|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883341558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883341558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883341558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883341558} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883341558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883341558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883341558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883341558, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1883341558|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:03:04,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1796880096 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1796880096 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1796880096 |ULTIMATE.start_main_#t~ite44_Out1796880096|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1796880096|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796880096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796880096} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796880096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796880096, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1796880096|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:03:04,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1069747609 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1069747609 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1069747609 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1069747609 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1069747609| ~z$r_buff1_thd0~0_In-1069747609)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1069747609| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1069747609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1069747609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1069747609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1069747609} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1069747609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1069747609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1069747609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1069747609, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1069747609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:03:04,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:05,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:03:05 BasicIcfg [2019-11-28 18:03:05,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:03:05,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:03:05,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:03:05,004 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:03:05,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:02:49" (3/4) ... [2019-11-28 18:03:05,007 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:03:05,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= (select .cse0 |v_ULTIMATE.start_main_~#t241~0.base_34|) 0) (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$w_buff1~0_283 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t241~0.base_34| 4)) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_493 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t241~0.base_34| 1)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_ULTIMATE.start_main_~#t241~0.offset_22| 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= 0 v_~__unbuffered_cnt~0_48) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t241~0.base_34|) |v_ULTIMATE.start_main_~#t241~0.offset_22| 0)) |v_#memory_int_15|) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t241~0.base_34|) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_~#t241~0.base=|v_ULTIMATE.start_main_~#t241~0.base_34|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_~#t241~0.offset=|v_ULTIMATE.start_main_~#t241~0.offset_22|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_31|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_21|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t241~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t241~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t242~0.base, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-11-28 18:03:05,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110 0)) (= ~z$r_buff0_thd1~0_Out1745413110 1) (= ~x~0_Out1745413110 1) (= ~z$r_buff1_thd2~0_Out1745413110 ~z$r_buff0_thd2~0_In1745413110) (= ~z$r_buff1_thd0~0_Out1745413110 ~z$r_buff0_thd0~0_In1745413110) (= ~y~0_In1745413110 ~__unbuffered_p0_EBX~0_Out1745413110) (= ~z$r_buff0_thd1~0_In1745413110 ~z$r_buff1_thd1~0_Out1745413110) (= ~x~0_Out1745413110 ~__unbuffered_p0_EAX~0_Out1745413110)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1745413110, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110, ~y~0=~y~0_In1745413110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1745413110, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1745413110} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1745413110, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1745413110, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out1745413110, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1745413110, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1745413110, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1745413110, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1745413110, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1745413110, ~y~0=~y~0_In1745413110, ~x~0=~x~0_Out1745413110, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1745413110} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-11-28 18:03:05,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t242~0.offset_11| 0) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) |v_ULTIMATE.start_main_~#t242~0.offset_11| 1))) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t242~0.base_12|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t242~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t242~0.base_12| 0)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t242~0.base_12| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t242~0.base=|v_ULTIMATE.start_main_~#t242~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|, ULTIMATE.start_main_~#t242~0.offset=|v_ULTIMATE.start_main_~#t242~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t242~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t242~0.offset] because there is no mapped edge [2019-11-28 18:03:05,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-669079613 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-669079613 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-669079613 256)) (and (= 0 (mod ~z$r_buff1_thd2~0_In-669079613 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-669079613 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-669079613| ~z$w_buff0_used~0_In-669079613) (= |P1Thread1of1ForFork1_#t~ite20_Out-669079613| |P1Thread1of1ForFork1_#t~ite21_Out-669079613|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-669079613| |P1Thread1of1ForFork1_#t~ite20_Out-669079613|) (= |P1Thread1of1ForFork1_#t~ite21_Out-669079613| ~z$w_buff0_used~0_In-669079613) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-669079613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-669079613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-669079613, ~weak$$choice2~0=~weak$$choice2~0_In-669079613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-669079613} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-669079613|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-669079613, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-669079613, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-669079613|, ~weak$$choice2~0=~weak$$choice2~0_In-669079613, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-669079613} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:03:05,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:03:05,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1940340031 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1940340031| |P1Thread1of1ForFork1_#t~ite30_Out-1940340031|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1940340031 256)))) (or (and (= (mod ~z$r_buff1_thd2~0_In-1940340031 256) 0) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-1940340031 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-1940340031 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1940340031| ~z$r_buff1_thd2~0_In-1940340031)) (and (= ~z$r_buff1_thd2~0_In-1940340031 |P1Thread1of1ForFork1_#t~ite30_Out-1940340031|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1940340031| |P1Thread1of1ForFork1_#t~ite29_Out-1940340031|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1940340031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940340031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1940340031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940340031, ~weak$$choice2~0=~weak$$choice2~0_In-1940340031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940340031} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1940340031|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1940340031|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940340031, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1940340031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1940340031, ~weak$$choice2~0=~weak$$choice2~0_In-1940340031, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940340031} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:03:05,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-11-28 18:03:05,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1287121919 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1287121919 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1287121919| |P1Thread1of1ForFork1_#t~ite33_Out1287121919|))) (or (and (or .cse0 .cse1) (= ~z~0_In1287121919 |P1Thread1of1ForFork1_#t~ite32_Out1287121919|) .cse2) (and (= ~z$w_buff1~0_In1287121919 |P1Thread1of1ForFork1_#t~ite32_Out1287121919|) (not .cse1) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1287121919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1287121919, ~z$w_buff1~0=~z$w_buff1~0_In1287121919, ~z~0=~z~0_In1287121919} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1287121919, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1287121919, ~z$w_buff1~0=~z$w_buff1~0_In1287121919, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1287121919|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1287121919|, ~z~0=~z~0_In1287121919} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-11-28 18:03:05,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1127012740 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1127012740 256)))) (or (and (= ~z$w_buff0_used~0_In-1127012740 |P1Thread1of1ForFork1_#t~ite34_Out-1127012740|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1127012740|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127012740, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1127012740} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1127012740, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1127012740|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1127012740} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:03:05,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1063332651 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-1063332651 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1063332651 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1063332651 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1063332651| ~z$w_buff1_used~0_In-1063332651)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1063332651| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063332651, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063332651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063332651, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063332651} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1063332651, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1063332651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1063332651, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1063332651|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1063332651} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:03:05,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1458504983 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1458504983 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1458504983| 0)) (and (= ~z$r_buff0_thd2~0_In1458504983 |P1Thread1of1ForFork1_#t~ite36_Out1458504983|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1458504983, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1458504983} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1458504983, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1458504983, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1458504983|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:03:05,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1654057460 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1654057460 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1654057460 |P0Thread1of1ForFork0_#t~ite5_Out1654057460|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1654057460|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1654057460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1654057460} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1654057460|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1654057460, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1654057460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:03:05,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In1239339556 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1239339556 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In1239339556 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1239339556 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1239339556| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1239339556 |P0Thread1of1ForFork0_#t~ite6_Out1239339556|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1239339556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1239339556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1239339556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1239339556} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1239339556|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1239339556, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1239339556, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1239339556, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1239339556} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:03:05,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In2036736536 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In2036736536 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2036736536 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2036736536 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In2036736536 |P1Thread1of1ForFork1_#t~ite37_Out2036736536|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out2036736536|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2036736536, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2036736536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2036736536, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2036736536} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2036736536, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2036736536, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2036736536, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2036736536, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2036736536|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:05,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:03:05,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1722277461 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1722277461 256) 0)) (.cse0 (= ~z$r_buff0_thd1~0_Out-1722277461 ~z$r_buff0_thd1~0_In-1722277461))) (or (and .cse0 .cse1) (and (= ~z$r_buff0_thd1~0_Out-1722277461 0) (not .cse2) (not .cse1)) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722277461, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1722277461} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722277461, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1722277461|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1722277461} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:03:05,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1609719186 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1609719186 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1609719186 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1609719186 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1609719186|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd1~0_In1609719186 |P0Thread1of1ForFork0_#t~ite8_Out1609719186|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1609719186, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1609719186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1609719186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1609719186} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1609719186, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1609719186|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1609719186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1609719186, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1609719186} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:03:05,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:03:05,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-11-28 18:03:05,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In923038148 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In923038148 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out923038148| ~z$w_buff1~0_In923038148)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out923038148| ~z~0_In923038148)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923038148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923038148, ~z$w_buff1~0=~z$w_buff1~0_In923038148, ~z~0=~z~0_In923038148} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out923038148|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In923038148, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923038148, ~z$w_buff1~0=~z$w_buff1~0_In923038148, ~z~0=~z~0_In923038148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:03:05,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-11-28 18:03:05,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-313734220 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-313734220 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-313734220 |ULTIMATE.start_main_#t~ite42_Out-313734220|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-313734220|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-313734220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313734220} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-313734220, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313734220, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-313734220|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:03:05,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1883341558 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1883341558 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1883341558 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In1883341558 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1883341558|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1883341558 |ULTIMATE.start_main_#t~ite43_Out1883341558|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883341558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883341558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883341558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883341558} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1883341558, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1883341558, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1883341558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1883341558, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1883341558|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:03:05,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1796880096 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1796880096 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1796880096 |ULTIMATE.start_main_#t~ite44_Out1796880096|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out1796880096|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796880096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796880096} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796880096, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796880096, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1796880096|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:03:05,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1069747609 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1069747609 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1069747609 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1069747609 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1069747609| ~z$r_buff1_thd0~0_In-1069747609)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1069747609| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1069747609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1069747609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1069747609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1069747609} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1069747609, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1069747609, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1069747609, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1069747609, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1069747609|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:03:05,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:03:05,130 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:03:05,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:03:05,131 INFO L168 Benchmark]: Toolchain (without parser) took 16860.14 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 516.9 MB). Free memory was 956.3 MB in the beginning and 951.2 MB in the end (delta: 5.1 MB). Peak memory consumption was 522.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,132 INFO L168 Benchmark]: CDTParser took 0.90 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:03:05,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,132 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.45 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:03:05,132 INFO L168 Benchmark]: Boogie Preprocessor took 55.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,133 INFO L168 Benchmark]: RCFGBuilder took 816.93 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,133 INFO L168 Benchmark]: TraceAbstraction took 15038.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 88.6 MB). Peak memory consumption was 460.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,140 INFO L168 Benchmark]: Witness Printer took 126.79 ms. Allocated memory is still 1.5 GB. Free memory was 963.7 MB in the beginning and 951.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:03:05,142 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.90 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 753.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -153.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 816.93 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: 45.6 MB). Peak memory consumption was 45.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15038.25 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 372.2 MB). Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 88.6 MB). Peak memory consumption was 460.8 MB. Max. memory is 11.5 GB. * Witness Printer took 126.79 ms. Allocated memory is still 1.5 GB. Free memory was 963.7 MB in the beginning and 951.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 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 [L820] 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 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1819 SDtfs, 1402 SDslu, 3390 SDs, 0 SdLazy, 1657 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12374occurred 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: 3.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 7141 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 70144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...