/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:58:20,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:58:20,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:58:20,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:58:20,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:58:20,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:58:20,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:58:20,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:58:20,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:58:20,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:58:20,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:58:20,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:58:20,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:58:20,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:58:20,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:58:20,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:58:20,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:58:20,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:58:20,153 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:58:20,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:58:20,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:58:20,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:58:20,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:58:20,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:58:20,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:58:20,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:58:20,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:58:20,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:58:20,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:58:20,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:58:20,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:58:20,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:58:20,167 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:58:20,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:58:20,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:58:20,169 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:58:20,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:58:20,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:58:20,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:58:20,171 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:58:20,171 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:58:20,172 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:58:20,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:58:20,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:58:20,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:58:20,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:58:20,188 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:58:20,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:58:20,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:58:20,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:58:20,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:58:20,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:58:20,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:58:20,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:58:20,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:58:20,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:58:20,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:58:20,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:58:20,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:58:20,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:58:20,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:58:20,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:58:20,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:58:20,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:58:20,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:58:20,192 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:58:20,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:58:20,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:58:20,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:58:20,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:58:20,193 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:58:20,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:58:20,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:58:20,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:58:20,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:58:20,497 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:58:20,497 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:58:20,498 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-26 22:58:20,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbb88192/d51ac70a141a4257bee6c6c3527367b9/FLAG99039e0dc [2019-12-26 22:58:21,154 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:58:21,155 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2019-12-26 22:58:21,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbb88192/d51ac70a141a4257bee6c6c3527367b9/FLAG99039e0dc [2019-12-26 22:58:21,382 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dbb88192/d51ac70a141a4257bee6c6c3527367b9 [2019-12-26 22:58:21,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:58:21,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:58:21,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:58:21,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:58:21,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:58:21,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:58:21" (1/1) ... [2019-12-26 22:58:21,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c1ed74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:21, skipping insertion in model container [2019-12-26 22:58:21,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:58:21" (1/1) ... [2019-12-26 22:58:21,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:58:21,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:58:22,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:58:22,066 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:58:22,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:58:22,256 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:58:22,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22 WrapperNode [2019-12-26 22:58:22,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:58:22,257 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:58:22,257 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:58:22,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:58:22,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:58:22,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:58:22,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:58:22,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:58:22,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (1/1) ... [2019-12-26 22:58:22,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:58:22,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:58:22,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:58:22,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:58:22,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (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-12-26 22:58:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:58:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:58:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:58:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:58:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:58:22,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:58:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:58:22,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:58:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:58:22,435 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:58:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:58:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:58:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:58:22,438 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:58:23,245 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:58:23,246 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:58:23,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:58:23 BoogieIcfgContainer [2019-12-26 22:58:23,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:58:23,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:58:23,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:58:23,251 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:58:23,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:58:21" (1/3) ... [2019-12-26 22:58:23,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17387b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:58:23, skipping insertion in model container [2019-12-26 22:58:23,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:58:22" (2/3) ... [2019-12-26 22:58:23,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17387b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:58:23, skipping insertion in model container [2019-12-26 22:58:23,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:58:23" (3/3) ... [2019-12-26 22:58:23,255 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2019-12-26 22:58:23,265 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:58:23,266 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:58:23,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:58:23,275 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:58:23,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,313 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,322 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,323 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,347 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,359 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,361 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,361 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,362 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,366 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:58:23,383 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:58:23,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:58:23,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:58:23,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:58:23,404 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:58:23,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:58:23,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:58:23,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:58:23,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:58:23,422 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-26 22:58:23,424 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:58:23,550 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:58:23,551 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:58:23,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:58:23,587 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-26 22:58:23,640 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-26 22:58:23,640 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:58:23,647 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 339 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:58:23,666 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-26 22:58:23,667 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:58:28,726 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 80 [2019-12-26 22:58:28,859 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-26 22:58:28,997 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:58:29,117 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 22:58:29,145 INFO L206 etLargeBlockEncoding]: Checked pairs total: 91392 [2019-12-26 22:58:29,145 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-26 22:58:29,149 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-26 22:58:48,789 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118050 states. [2019-12-26 22:58:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 118050 states. [2019-12-26 22:58:48,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 22:58:48,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:58:48,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 22:58:48,799 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:58:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:58:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash 815309389, now seen corresponding path program 1 times [2019-12-26 22:58:48,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:58:48,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67163976] [2019-12-26 22:58:48,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:58:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:58:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:58:49,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67163976] [2019-12-26 22:58:49,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:58:49,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:58:49,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487325608] [2019-12-26 22:58:49,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:58:49,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:58:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:58:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:58:49,102 INFO L87 Difference]: Start difference. First operand 118050 states. Second operand 3 states. [2019-12-26 22:58:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:58:50,405 INFO L93 Difference]: Finished difference Result 117660 states and 502246 transitions. [2019-12-26 22:58:50,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:58:50,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 22:58:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:58:54,583 INFO L225 Difference]: With dead ends: 117660 [2019-12-26 22:58:54,583 INFO L226 Difference]: Without dead ends: 115112 [2019-12-26 22:58:54,584 INFO L631 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-12-26 22:58:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115112 states. [2019-12-26 22:59:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115112 to 115112. [2019-12-26 22:59:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115112 states. [2019-12-26 22:59:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115112 states to 115112 states and 491858 transitions. [2019-12-26 22:59:01,723 INFO L78 Accepts]: Start accepts. Automaton has 115112 states and 491858 transitions. Word has length 5 [2019-12-26 22:59:01,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:01,724 INFO L462 AbstractCegarLoop]: Abstraction has 115112 states and 491858 transitions. [2019-12-26 22:59:01,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states and 491858 transitions. [2019-12-26 22:59:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:59:01,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:01,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:01,728 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 162612621, now seen corresponding path program 1 times [2019-12-26 22:59:01,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:01,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366156263] [2019-12-26 22:59:01,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:01,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:01,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366156263] [2019-12-26 22:59:01,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:01,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:01,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132383758] [2019-12-26 22:59:01,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:01,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:01,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:01,855 INFO L87 Difference]: Start difference. First operand 115112 states and 491858 transitions. Second operand 4 states. [2019-12-26 22:59:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:06,701 INFO L93 Difference]: Finished difference Result 180042 states and 739573 transitions. [2019-12-26 22:59:06,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:06,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:59:06,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:07,912 INFO L225 Difference]: With dead ends: 180042 [2019-12-26 22:59:07,913 INFO L226 Difference]: Without dead ends: 179993 [2019-12-26 22:59:07,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:18,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179993 states. [2019-12-26 22:59:22,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179993 to 166069. [2019-12-26 22:59:22,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166069 states. [2019-12-26 22:59:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166069 states to 166069 states and 689057 transitions. [2019-12-26 22:59:22,642 INFO L78 Accepts]: Start accepts. Automaton has 166069 states and 689057 transitions. Word has length 11 [2019-12-26 22:59:22,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:22,642 INFO L462 AbstractCegarLoop]: Abstraction has 166069 states and 689057 transitions. [2019-12-26 22:59:22,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 166069 states and 689057 transitions. [2019-12-26 22:59:22,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:59:22,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:22,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:22,650 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1907433687, now seen corresponding path program 1 times [2019-12-26 22:59:22,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:22,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399405817] [2019-12-26 22:59:22,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:22,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399405817] [2019-12-26 22:59:22,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:22,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:22,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742905659] [2019-12-26 22:59:22,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:22,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:22,745 INFO L87 Difference]: Start difference. First operand 166069 states and 689057 transitions. Second operand 4 states. [2019-12-26 22:59:29,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:29,516 INFO L93 Difference]: Finished difference Result 237299 states and 961992 transitions. [2019-12-26 22:59:29,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:29,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 22:59:29,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:31,135 INFO L225 Difference]: With dead ends: 237299 [2019-12-26 22:59:31,135 INFO L226 Difference]: Without dead ends: 237236 [2019-12-26 22:59:31,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:41,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237236 states. [2019-12-26 22:59:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237236 to 202025. [2019-12-26 22:59:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202025 states. [2019-12-26 22:59:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202025 states to 202025 states and 831679 transitions. [2019-12-26 22:59:54,210 INFO L78 Accepts]: Start accepts. Automaton has 202025 states and 831679 transitions. Word has length 13 [2019-12-26 22:59:54,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:54,212 INFO L462 AbstractCegarLoop]: Abstraction has 202025 states and 831679 transitions. [2019-12-26 22:59:54,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:54,212 INFO L276 IsEmpty]: Start isEmpty. Operand 202025 states and 831679 transitions. [2019-12-26 22:59:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:59:54,215 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:54,215 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:54,215 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:54,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1457610254, now seen corresponding path program 1 times [2019-12-26 22:59:54,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:54,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165844671] [2019-12-26 22:59:54,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:54,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165844671] [2019-12-26 22:59:54,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:54,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:54,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191799229] [2019-12-26 22:59:54,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:54,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:54,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:54,279 INFO L87 Difference]: Start difference. First operand 202025 states and 831679 transitions. Second operand 3 states. [2019-12-26 22:59:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:54,414 INFO L93 Difference]: Finished difference Result 39500 states and 127344 transitions. [2019-12-26 22:59:54,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:54,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:59:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:54,476 INFO L225 Difference]: With dead ends: 39500 [2019-12-26 22:59:54,477 INFO L226 Difference]: Without dead ends: 39500 [2019-12-26 22:59:54,477 INFO L631 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-12-26 22:59:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39500 states. [2019-12-26 22:59:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39500 to 39500. [2019-12-26 22:59:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39500 states. [2019-12-26 22:59:55,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39500 states to 39500 states and 127344 transitions. [2019-12-26 22:59:55,140 INFO L78 Accepts]: Start accepts. Automaton has 39500 states and 127344 transitions. Word has length 13 [2019-12-26 22:59:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:55,141 INFO L462 AbstractCegarLoop]: Abstraction has 39500 states and 127344 transitions. [2019-12-26 22:59:55,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 39500 states and 127344 transitions. [2019-12-26 22:59:55,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 22:59:55,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:55,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:55,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:55,145 INFO L82 PathProgramCache]: Analyzing trace with hash -440148133, now seen corresponding path program 1 times [2019-12-26 22:59:55,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:55,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332824800] [2019-12-26 22:59:55,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:55,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332824800] [2019-12-26 22:59:55,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:55,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:55,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880140379] [2019-12-26 22:59:55,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:59:55,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:59:55,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:55,258 INFO L87 Difference]: Start difference. First operand 39500 states and 127344 transitions. Second operand 5 states. [2019-12-26 22:59:56,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:56,076 INFO L93 Difference]: Finished difference Result 52847 states and 167054 transitions. [2019-12-26 22:59:56,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:59:56,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 22:59:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:57,268 INFO L225 Difference]: With dead ends: 52847 [2019-12-26 22:59:57,268 INFO L226 Difference]: Without dead ends: 52834 [2019-12-26 22:59:57,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:59:57,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52834 states. [2019-12-26 22:59:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52834 to 39960. [2019-12-26 22:59:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39960 states. [2019-12-26 22:59:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39960 states to 39960 states and 128654 transitions. [2019-12-26 22:59:58,019 INFO L78 Accepts]: Start accepts. Automaton has 39960 states and 128654 transitions. Word has length 19 [2019-12-26 22:59:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,019 INFO L462 AbstractCegarLoop]: Abstraction has 39960 states and 128654 transitions. [2019-12-26 22:59:58,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:59:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 39960 states and 128654 transitions. [2019-12-26 22:59:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:59:58,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,033 INFO L411 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-12-26 22:59:58,034 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash -79667593, now seen corresponding path program 1 times [2019-12-26 22:59:58,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012974492] [2019-12-26 22:59:58,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012974492] [2019-12-26 22:59:58,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:58,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853956727] [2019-12-26 22:59:58,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:59:58,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:59:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:59:58,128 INFO L87 Difference]: Start difference. First operand 39960 states and 128654 transitions. Second operand 4 states. [2019-12-26 22:59:58,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,172 INFO L93 Difference]: Finished difference Result 7841 states and 21500 transitions. [2019-12-26 22:59:58,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:59:58,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:59:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,184 INFO L225 Difference]: With dead ends: 7841 [2019-12-26 22:59:58,184 INFO L226 Difference]: Without dead ends: 7841 [2019-12-26 22:59:58,185 INFO L631 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-12-26 22:59:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7841 states. [2019-12-26 22:59:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7841 to 7701. [2019-12-26 22:59:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7701 states. [2019-12-26 22:59:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7701 states to 7701 states and 21100 transitions. [2019-12-26 22:59:58,294 INFO L78 Accepts]: Start accepts. Automaton has 7701 states and 21100 transitions. Word has length 25 [2019-12-26 22:59:58,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,294 INFO L462 AbstractCegarLoop]: Abstraction has 7701 states and 21100 transitions. [2019-12-26 22:59:58,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:59:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 7701 states and 21100 transitions. [2019-12-26 22:59:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:59:58,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,306 INFO L411 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] [2019-12-26 22:59:58,306 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,307 INFO L82 PathProgramCache]: Analyzing trace with hash -832696622, now seen corresponding path program 1 times [2019-12-26 22:59:58,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031826360] [2019-12-26 22:59:58,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031826360] [2019-12-26 22:59:58,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:59:58,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598954263] [2019-12-26 22:59:58,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:59:58,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:59:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:58,383 INFO L87 Difference]: Start difference. First operand 7701 states and 21100 transitions. Second operand 5 states. [2019-12-26 22:59:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,426 INFO L93 Difference]: Finished difference Result 5712 states and 16440 transitions. [2019-12-26 22:59:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:59:58,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-26 22:59:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,435 INFO L225 Difference]: With dead ends: 5712 [2019-12-26 22:59:58,435 INFO L226 Difference]: Without dead ends: 5712 [2019-12-26 22:59:58,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:59:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5712 states. [2019-12-26 22:59:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5712 to 5299. [2019-12-26 22:59:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5299 states. [2019-12-26 22:59:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 15323 transitions. [2019-12-26 22:59:58,517 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 15323 transitions. Word has length 37 [2019-12-26 22:59:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,517 INFO L462 AbstractCegarLoop]: Abstraction has 5299 states and 15323 transitions. [2019-12-26 22:59:58,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:59:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 15323 transitions. [2019-12-26 22:59:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:59:58,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,525 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,526 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash -49475536, now seen corresponding path program 1 times [2019-12-26 22:59:58,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655525679] [2019-12-26 22:59:58,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655525679] [2019-12-26 22:59:58,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:58,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611289008] [2019-12-26 22:59:58,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:58,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:58,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:58,634 INFO L87 Difference]: Start difference. First operand 5299 states and 15323 transitions. Second operand 3 states. [2019-12-26 22:59:58,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:58,689 INFO L93 Difference]: Finished difference Result 5310 states and 15338 transitions. [2019-12-26 22:59:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:58,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:59:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:58,701 INFO L225 Difference]: With dead ends: 5310 [2019-12-26 22:59:58,701 INFO L226 Difference]: Without dead ends: 5310 [2019-12-26 22:59:58,702 INFO L631 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-12-26 22:59:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2019-12-26 22:59:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5303. [2019-12-26 22:59:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5303 states. [2019-12-26 22:59:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5303 states to 5303 states and 15329 transitions. [2019-12-26 22:59:58,796 INFO L78 Accepts]: Start accepts. Automaton has 5303 states and 15329 transitions. Word has length 64 [2019-12-26 22:59:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:58,796 INFO L462 AbstractCegarLoop]: Abstraction has 5303 states and 15329 transitions. [2019-12-26 22:59:58,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5303 states and 15329 transitions. [2019-12-26 22:59:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:59:58,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:58,804 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:58,804 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:58,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:58,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1883123384, now seen corresponding path program 1 times [2019-12-26 22:59:58,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:58,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632227911] [2019-12-26 22:59:58,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:58,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632227911] [2019-12-26 22:59:58,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:58,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:59:58,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101828132] [2019-12-26 22:59:58,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:58,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:58,900 INFO L87 Difference]: Start difference. First operand 5303 states and 15329 transitions. Second operand 3 states. [2019-12-26 22:59:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,160 INFO L93 Difference]: Finished difference Result 5310 states and 15331 transitions. [2019-12-26 22:59:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:59,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:59:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,168 INFO L225 Difference]: With dead ends: 5310 [2019-12-26 22:59:59,168 INFO L226 Difference]: Without dead ends: 5309 [2019-12-26 22:59:59,168 INFO L631 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-12-26 22:59:59,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2019-12-26 22:59:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5304. [2019-12-26 22:59:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5304 states. [2019-12-26 22:59:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5304 states to 5304 states and 15325 transitions. [2019-12-26 22:59:59,239 INFO L78 Accepts]: Start accepts. Automaton has 5304 states and 15325 transitions. Word has length 64 [2019-12-26 22:59:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,240 INFO L462 AbstractCegarLoop]: Abstraction has 5304 states and 15325 transitions. [2019-12-26 22:59:59,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5304 states and 15325 transitions. [2019-12-26 22:59:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:59:59,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,249 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1883571210, now seen corresponding path program 1 times [2019-12-26 22:59:59,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946546451] [2019-12-26 22:59:59,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946546451] [2019-12-26 22:59:59,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:59,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446889329] [2019-12-26 22:59:59,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:59,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:59,358 INFO L87 Difference]: Start difference. First operand 5304 states and 15325 transitions. Second operand 3 states. [2019-12-26 22:59:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,398 INFO L93 Difference]: Finished difference Result 5018 states and 14292 transitions. [2019-12-26 22:59:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:59,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:59:59,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,407 INFO L225 Difference]: With dead ends: 5018 [2019-12-26 22:59:59,408 INFO L226 Difference]: Without dead ends: 5018 [2019-12-26 22:59:59,408 INFO L631 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-12-26 22:59:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2019-12-26 22:59:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 5018. [2019-12-26 22:59:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5018 states. [2019-12-26 22:59:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 14292 transitions. [2019-12-26 22:59:59,520 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 14292 transitions. Word has length 64 [2019-12-26 22:59:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,520 INFO L462 AbstractCegarLoop]: Abstraction has 5018 states and 14292 transitions. [2019-12-26 22:59:59,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 14292 transitions. [2019-12-26 22:59:59,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:59:59,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,530 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1128424098, now seen corresponding path program 1 times [2019-12-26 22:59:59,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457309974] [2019-12-26 22:59:59,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457309974] [2019-12-26 22:59:59,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:59,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457936910] [2019-12-26 22:59:59,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:59,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:59,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:59,600 INFO L87 Difference]: Start difference. First operand 5018 states and 14292 transitions. Second operand 3 states. [2019-12-26 22:59:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,627 INFO L93 Difference]: Finished difference Result 4719 states and 13220 transitions. [2019-12-26 22:59:59,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:59,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 22:59:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,634 INFO L225 Difference]: With dead ends: 4719 [2019-12-26 22:59:59,634 INFO L226 Difference]: Without dead ends: 4719 [2019-12-26 22:59:59,635 INFO L631 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-12-26 22:59:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2019-12-26 22:59:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4719. [2019-12-26 22:59:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4719 states. [2019-12-26 22:59:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 13220 transitions. [2019-12-26 22:59:59,724 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 13220 transitions. Word has length 65 [2019-12-26 22:59:59,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,725 INFO L462 AbstractCegarLoop]: Abstraction has 4719 states and 13220 transitions. [2019-12-26 22:59:59,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 13220 transitions. [2019-12-26 22:59:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:59:59,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,734 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1053947633, now seen corresponding path program 1 times [2019-12-26 22:59:59,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074990272] [2019-12-26 22:59:59,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:59:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:59:59,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074990272] [2019-12-26 22:59:59,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:59:59,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:59:59,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117383665] [2019-12-26 22:59:59,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:59:59,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:59:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:59:59,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:59:59,825 INFO L87 Difference]: Start difference. First operand 4719 states and 13220 transitions. Second operand 3 states. [2019-12-26 22:59:59,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:59:59,875 INFO L93 Difference]: Finished difference Result 4719 states and 13219 transitions. [2019-12-26 22:59:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:59:59,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 22:59:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:59:59,882 INFO L225 Difference]: With dead ends: 4719 [2019-12-26 22:59:59,882 INFO L226 Difference]: Without dead ends: 4719 [2019-12-26 22:59:59,882 INFO L631 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-12-26 22:59:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2019-12-26 22:59:59,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 3181. [2019-12-26 22:59:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2019-12-26 22:59:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 9006 transitions. [2019-12-26 22:59:59,935 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 9006 transitions. Word has length 66 [2019-12-26 22:59:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:59:59,936 INFO L462 AbstractCegarLoop]: Abstraction has 3181 states and 9006 transitions. [2019-12-26 22:59:59,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:59:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 9006 transitions. [2019-12-26 22:59:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 22:59:59,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:59:59,940 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:59:59,941 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:59:59,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:59:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -864116617, now seen corresponding path program 1 times [2019-12-26 22:59:59,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:59:59,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404705379] [2019-12-26 22:59:59,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:59:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:00:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:00:00,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404705379] [2019-12-26 23:00:00,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:00:00,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:00:00,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008366289] [2019-12-26 23:00:00,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:00:00,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:00:00,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:00:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:00:00,116 INFO L87 Difference]: Start difference. First operand 3181 states and 9006 transitions. Second operand 7 states. [2019-12-26 23:00:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:00:00,308 INFO L93 Difference]: Finished difference Result 6197 states and 17566 transitions. [2019-12-26 23:00:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:00:00,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-26 23:00:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:00:00,313 INFO L225 Difference]: With dead ends: 6197 [2019-12-26 23:00:00,313 INFO L226 Difference]: Without dead ends: 3139 [2019-12-26 23:00:00,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:00:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-26 23:00:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2605. [2019-12-26 23:00:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2605 states. [2019-12-26 23:00:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 7305 transitions. [2019-12-26 23:00:00,397 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 7305 transitions. Word has length 67 [2019-12-26 23:00:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:00:00,398 INFO L462 AbstractCegarLoop]: Abstraction has 2605 states and 7305 transitions. [2019-12-26 23:00:00,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:00:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 7305 transitions. [2019-12-26 23:00:00,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:00:00,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:00:00,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:00:00,406 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:00:00,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:00:00,406 INFO L82 PathProgramCache]: Analyzing trace with hash -492073483, now seen corresponding path program 2 times [2019-12-26 23:00:00,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:00:00,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623579187] [2019-12-26 23:00:00,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:00:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:00:00,650 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:00:00,651 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:00:00,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x$r_buff1_thd3~0_146) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1403~0.base_24|) |v_ULTIMATE.start_main_~#t1403~0.offset_18| 0)) |v_#memory_int_19|) (= v_~z~0_13 0) (= v_~main$tmp_guard0~0_18 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1403~0.base_24|) (= v_~x$flush_delayed~0_40 0) (= v_~main$tmp_guard1~0_48 0) (= v_~y~0_73 0) (= v_~__unbuffered_cnt~0_158 0) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_339) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0_used~0_698) (= 0 v_~x$read_delayed_var~0.base_8) (= 0 v_~x~0_178) (= 0 v_~x$r_buff1_thd2~0_152) (= v_~x$r_buff0_thd1~0_141 0) (= v_~x$mem_tmp~0_20 0) (= 0 v_~x$read_delayed~0_8) (= 0 v_~x$read_delayed_var~0.offset_8) (= 0 v_~__unbuffered_p2_EAX~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24|) 0) (= v_~__unbuffered_p1_EAX~0_114 0) (= v_~x$r_buff1_thd0~0_256 0) (= 0 v_~x$w_buff1~0_143) (= 0 |v_#NULL.base_3|) (= 0 v_~x$w_buff0~0_158) (= 0 |v_ULTIMATE.start_main_~#t1403~0.offset_18|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1403~0.base_24| 4) |v_#length_21|) (= v_~x$r_buff0_thd0~0_367 0) (= 0 v_~weak$$choice2~0_95) (= 0 v_~x$r_buff0_thd2~0_210) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t1403~0.base_24| 1)) (= 0 v_~x$r_buff0_thd3~0_129) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_16|, ~x$w_buff0~0=v_~x$w_buff0~0_158, ULTIMATE.start_main_~#t1403~0.base=|v_ULTIMATE.start_main_~#t1403~0.base_24|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_38|, ~x$flush_delayed~0=v_~x$flush_delayed~0_40, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_26|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_62|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_129, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_71|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_114, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_367, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_26|, ~x$w_buff1~0=v_~x$w_buff1~0_143, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_339, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_152, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_43|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_68|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_147|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, ~x~0=v_~x~0_178, ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_141, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_16|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_26|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_24|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_28|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_31|, ~x$mem_tmp~0=v_~x$mem_tmp~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_254|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_80|, ~y~0=v_~y~0_73, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_22|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_18|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_256, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_210, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_45|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_698, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_147|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1403~0.offset=|v_ULTIMATE.start_main_~#t1403~0.offset_18|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_20|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~weak$$choice2~0=v_~weak$$choice2~0_95, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1403~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1405~0.offset, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1404~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1405~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1403~0.offset, ULTIMATE.start_main_~#t1404~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:00:00,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L807-1-->L809: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1404~0.base_11| 0)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1404~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1404~0.offset_9|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11|)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1404~0.base_11| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1404~0.base_11|) |v_ULTIMATE.start_main_~#t1404~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1404~0.base_11| 4) |v_#length_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1404~0.offset=|v_ULTIMATE.start_main_~#t1404~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_3|, ULTIMATE.start_main_~#t1404~0.base=|v_ULTIMATE.start_main_~#t1404~0.base_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1404~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1404~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-26 23:00:00,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1405~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1405~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t1405~0.base_11| 0)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11| 1)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1405~0.base_11|) 0) (= 0 |v_ULTIMATE.start_main_~#t1405~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1405~0.base_11|) |v_ULTIMATE.start_main_~#t1405~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1405~0.offset=|v_ULTIMATE.start_main_~#t1405~0.offset_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1405~0.base=|v_ULTIMATE.start_main_~#t1405~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1405~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1405~0.base, #length] because there is no mapped edge [2019-12-26 23:00:00,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L4-->L764: Formula: (and (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-11093260)) (= ~__unbuffered_p1_EAX~0_Out-11093260 ~y~0_In-11093260) (= ~x$r_buff1_thd3~0_Out-11093260 ~x$r_buff0_thd3~0_In-11093260) (= 1 ~x$r_buff0_thd2~0_Out-11093260) (= ~x$r_buff0_thd2~0_In-11093260 ~x$r_buff1_thd2~0_Out-11093260) (= ~x$r_buff1_thd0~0_Out-11093260 ~x$r_buff0_thd0~0_In-11093260) (= ~x$r_buff0_thd1~0_In-11093260 ~x$r_buff1_thd1~0_Out-11093260)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-11093260, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-11093260, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-11093260, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-11093260, ~y~0=~y~0_In-11093260, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-11093260} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-11093260, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-11093260, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-11093260, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-11093260, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-11093260, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-11093260, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-11093260, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-11093260, ~y~0=~y~0_In-11093260, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-11093260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-11093260} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 23:00:00,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L784-2-->L784-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1153989727 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1153989727 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1153989727| ~x$w_buff1~0_In1153989727)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out1153989727| ~x~0_In1153989727)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1153989727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1153989727, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1153989727, ~x~0=~x~0_In1153989727} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1153989727|, ~x$w_buff1~0=~x$w_buff1~0_In1153989727, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1153989727, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1153989727, ~x~0=~x~0_In1153989727} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 23:00:00,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L784-4-->L785: Formula: (= v_~x~0_27 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|, ~x~0=v_~x~0_27} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-26 23:00:00,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-277124202 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-277124202 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-277124202 |P2Thread1of1ForFork2_#t~ite17_Out-277124202|)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-277124202| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-277124202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-277124202} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-277124202, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-277124202|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-277124202} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:00:00,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-459412764 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-459412764 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-459412764 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-459412764 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-459412764|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-459412764| ~x$w_buff1_used~0_In-459412764) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-459412764, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-459412764, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-459412764, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-459412764} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-459412764, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-459412764, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-459412764, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-459412764|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-459412764} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-26 23:00:00,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L735-2-->L735-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-923271625 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-923271625 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-923271625 |P0Thread1of1ForFork0_#t~ite3_Out-923271625|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-923271625 |P0Thread1of1ForFork0_#t~ite3_Out-923271625|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-923271625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-923271625, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-923271625, ~x~0=~x~0_In-923271625} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-923271625|, ~x$w_buff1~0=~x$w_buff1~0_In-923271625, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-923271625, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-923271625, ~x~0=~x~0_In-923271625} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-26 23:00:00,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L735-4-->L736: Formula: (= v_~x~0_31 |v_P0Thread1of1ForFork0_#t~ite3_10|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_10|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_9|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_13|, ~x~0=v_~x~0_31} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-26 23:00:00,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In618490517 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In618490517 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out618490517| ~x$w_buff0_used~0_In618490517) (or .cse0 .cse1)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out618490517| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In618490517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In618490517} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out618490517|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In618490517, ~x$w_buff0_used~0=~x$w_buff0_used~0_In618490517} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:00:00,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L737-->L737-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In283774270 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In283774270 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In283774270 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In283774270 256) 0))) (or (and (= ~x$w_buff1_used~0_In283774270 |P0Thread1of1ForFork0_#t~ite6_Out283774270|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out283774270|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In283774270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In283774270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In283774270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283774270} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out283774270|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In283774270, ~x$w_buff1_used~0=~x$w_buff1_used~0_In283774270, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In283774270, ~x$w_buff0_used~0=~x$w_buff0_used~0_In283774270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:00:00,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L738-->L738-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In922140125 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In922140125 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite7_Out922140125| ~x$r_buff0_thd1~0_In922140125) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out922140125| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In922140125, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922140125} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In922140125, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out922140125|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In922140125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-26 23:00:00,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd1~0_In129720397 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In129720397 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd1~0_In129720397 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In129720397 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In129720397 |P0Thread1of1ForFork0_#t~ite8_Out129720397|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out129720397|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In129720397, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129720397, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In129720397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In129720397} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In129720397, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out129720397|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In129720397, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In129720397, ~x$w_buff0_used~0=~x$w_buff0_used~0_In129720397} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:00:00,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L739-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_101 |v_P0Thread1of1ForFork0_#t~ite8_62|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_62|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_61|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_101} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-26 23:00:00,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-564585957 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-564585957 256)))) (or (and (= ~x$w_buff0_used~0_In-564585957 |P1Thread1of1ForFork1_#t~ite11_Out-564585957|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-564585957|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-564585957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564585957} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-564585957|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-564585957, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564585957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-26 23:00:00,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1715137939 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1715137939 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1715137939 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1715137939 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out1715137939| ~x$w_buff1_used~0_In1715137939) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite12_Out1715137939| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1715137939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1715137939, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1715137939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1715137939} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1715137939, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1715137939, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1715137939|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1715137939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1715137939} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-26 23:00:00,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L767-->L768: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1520264566 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1520264566 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1520264566 ~x$r_buff0_thd2~0_Out1520264566)) (and (= 0 ~x$r_buff0_thd2~0_Out1520264566) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1520264566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1520264566} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1520264566|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1520264566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1520264566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:00:00,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-301966671 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-301966671 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-301966671 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-301966671 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-301966671|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-301966671| ~x$r_buff1_thd2~0_In-301966671)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-301966671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-301966671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-301966671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-301966671} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-301966671, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-301966671, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-301966671, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-301966671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-301966671} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-26 23:00:00,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_54 |v_P1Thread1of1ForFork1_#t~ite14_32|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:00:00,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-939224362 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-939224362 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-939224362|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-939224362 |P2Thread1of1ForFork2_#t~ite19_Out-939224362|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-939224362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-939224362} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-939224362, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-939224362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-939224362} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-26 23:00:00,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L788-->L788-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1837650292 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1837650292 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1837650292 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1837650292 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out-1837650292| ~x$r_buff1_thd3~0_In-1837650292)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1837650292| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837650292, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1837650292, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1837650292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837650292} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1837650292|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837650292, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1837650292, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1837650292, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837650292} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-26 23:00:00,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1)) (= v_~x$r_buff1_thd3~0_81 |v_P2Thread1of1ForFork2_#t~ite20_50|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_49|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_81, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-26 23:00:00,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:00:00,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L817-2-->L817-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1978470494 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1978470494| |ULTIMATE.start_main_#t~ite24_Out-1978470494|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1978470494 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-1978470494 |ULTIMATE.start_main_#t~ite24_Out-1978470494|) .cse2) (and (not .cse1) (= ~x$w_buff1~0_In-1978470494 |ULTIMATE.start_main_#t~ite24_Out-1978470494|) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1978470494, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1978470494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1978470494, ~x~0=~x~0_In-1978470494} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1978470494, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1978470494|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1978470494|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1978470494, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1978470494, ~x~0=~x~0_In-1978470494} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-26 23:00:00,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-809016582 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-809016582 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-809016582| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-809016582 |ULTIMATE.start_main_#t~ite26_Out-809016582|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-809016582, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-809016582} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-809016582, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-809016582|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-809016582} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-26 23:00:00,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1733448884 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1733448884 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1733448884 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1733448884 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1733448884|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-1733448884 |ULTIMATE.start_main_#t~ite27_Out-1733448884|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1733448884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1733448884, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1733448884, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1733448884} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1733448884, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1733448884, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1733448884|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1733448884, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1733448884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-26 23:00:00,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In381787665 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In381787665 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In381787665 |ULTIMATE.start_main_#t~ite28_Out381787665|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out381787665| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In381787665, ~x$w_buff0_used~0=~x$w_buff0_used~0_In381787665} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In381787665, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out381787665|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In381787665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-26 23:00:00,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd0~0_In1212185782 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1212185782 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1212185782 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1212185782 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out1212185782| ~x$r_buff1_thd0~0_In1212185782) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1212185782|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1212185782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1212185782, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1212185782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1212185782} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1212185782, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1212185782|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1212185782, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1212185782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1212185782} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-26 23:00:00,682 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L832-->L832-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1247045258 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite45_Out1247045258| |ULTIMATE.start_main_#t~ite44_Out1247045258|)) (.cse5 (= (mod ~x$w_buff1_used~0_In1247045258 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1247045258 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd0~0_In1247045258 256))) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In1247045258 256)))) (or (let ((.cse2 (not .cse6))) (and .cse0 .cse1 (or .cse2 (not .cse3)) (= |ULTIMATE.start_main_#t~ite43_Out1247045258| |ULTIMATE.start_main_#t~ite44_Out1247045258|) (not .cse4) (or .cse2 (not .cse5)) (= |ULTIMATE.start_main_#t~ite43_Out1247045258| 0))) (and (or (and (= |ULTIMATE.start_main_#t~ite45_Out1247045258| ~x$w_buff1_used~0_In1247045258) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_In1247045258| |ULTIMATE.start_main_#t~ite44_Out1247045258|)) (and .cse0 .cse1 (or (and .cse5 .cse6) (and .cse3 .cse6) .cse4) (= ~x$w_buff1_used~0_In1247045258 |ULTIMATE.start_main_#t~ite44_Out1247045258|))) (= |ULTIMATE.start_main_#t~ite43_In1247045258| |ULTIMATE.start_main_#t~ite43_Out1247045258|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1247045258, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1247045258, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1247045258, ~weak$$choice2~0=~weak$$choice2~0_In1247045258, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In1247045258|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247045258, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In1247045258|} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1247045258, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1247045258, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1247045258, ~weak$$choice2~0=~weak$$choice2~0_In1247045258, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1247045258|, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1247045258|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1247045258|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1247045258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:00:00,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-8-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_91 256) 0)) (= v_~x$w_buff1_used~0_335 |v_ULTIMATE.start_main_#t~ite45_32|) (= v_~x$r_buff0_thd0~0_362 v_~x$r_buff0_thd0~0_361)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_362, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_32|} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_361, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_26|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_335, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_27|, ~weak$$choice2~0=v_~weak$$choice2~0_91, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_30|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_30|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:00:00,683 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L834-->L834-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-474066745 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-474066745| |ULTIMATE.start_main_#t~ite51_Out-474066745|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-474066745 256)))) (or (= (mod ~x$w_buff0_used~0_In-474066745 256) 0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-474066745 256))) (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-474066745 256) 0)))) (= ~x$r_buff1_thd0~0_In-474066745 |ULTIMATE.start_main_#t~ite50_Out-474066745|) .cse1) (and (= ~x$r_buff1_thd0~0_In-474066745 |ULTIMATE.start_main_#t~ite51_Out-474066745|) (not .cse1) (= |ULTIMATE.start_main_#t~ite50_In-474066745| |ULTIMATE.start_main_#t~ite50_Out-474066745|)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-474066745|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-474066745, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-474066745, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-474066745, ~weak$$choice2~0=~weak$$choice2~0_In-474066745, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474066745} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-474066745|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-474066745, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-474066745|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-474066745, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-474066745, ~weak$$choice2~0=~weak$$choice2~0_In-474066745, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-474066745} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:00:00,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L836-->L839-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_148) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$flush_delayed~0_22 0) (= (mod v_~main$tmp_guard1~0_34 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:00:00,684 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L839-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 23:00:00,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:00:00 BasicIcfg [2019-12-26 23:00:00,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:00:00,808 INFO L168 Benchmark]: Toolchain (without parser) took 99411.95 ms. Allocated memory was 145.2 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 100.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,808 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,809 INFO L168 Benchmark]: CACSL2BoogieTranslator took 855.36 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 155.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,810 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.92 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,810 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,811 INFO L168 Benchmark]: RCFGBuilder took 880.66 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 99.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,812 INFO L168 Benchmark]: TraceAbstraction took 97558.10 ms. Allocated memory was 201.9 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 99.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. [2019-12-26 23:00:00,815 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.24 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 855.36 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 155.2 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.92 ms. Allocated memory is still 201.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.87 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 880.66 ms. Allocated memory is still 201.9 MB. Free memory was 149.8 MB in the beginning and 99.7 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 97558.10 ms. Allocated memory was 201.9 MB in the beginning and 4.7 GB in the end (delta: 4.5 GB). Free memory was 99.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 175 ProgramPointsBefore, 94 ProgramPointsAfterwards, 212 TransitionsBefore, 103 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 32 ChoiceCompositions, 5784 VarBasedMoverChecksPositive, 205 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 91392 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L749] 2 x$w_buff1 = x$w_buff0 [L750] 2 x$w_buff0 = 2 [L751] 2 x$w_buff1_used = x$w_buff0_used [L752] 2 x$w_buff0_used = (_Bool)1 [L811] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] 3 y = 1 [L781] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L784] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L736] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L786] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L818] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 x$flush_delayed = weak$$choice2 [L827] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L830] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 97.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 22.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1829 SDtfs, 1262 SDslu, 2430 SDs, 0 SdLazy, 1006 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202025occurred 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: 47.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 64646 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 580 NumberOfCodeBlocks, 580 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 69958 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...