/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:09:55,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:09:55,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:09:55,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:09:55,045 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:09:55,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:09:55,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:09:55,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:09:55,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:09:55,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:09:55,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:09:55,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:09:55,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:09:55,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:09:55,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:09:55,074 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:09:55,075 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:09:55,076 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:09:55,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:09:55,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:09:55,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:09:55,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:09:55,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:09:55,092 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:09:55,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:09:55,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:09:55,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:09:55,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:09:55,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:09:55,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:09:55,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:09:55,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:09:55,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:09:55,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:09:55,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:09:55,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:09:55,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:09:55,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:09:55,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:09:55,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:09:55,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:09:55,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 04:09:55,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:09:55,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:09:55,139 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:09:55,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:09:55,140 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:09:55,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:09:55,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:09:55,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:09:55,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:09:55,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:09:55,142 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:09:55,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:09:55,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:09:55,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:09:55,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:09:55,143 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:09:55,143 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:09:55,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:09:55,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:09:55,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:09:55,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:09:55,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:09:55,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:09:55,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:09:55,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:09:55,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:09:55,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:09:55,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:09:55,147 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:09:55,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:09:55,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:09:55,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:09:55,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:09:55,425 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:09:55,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2019-12-27 04:09:55,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb746b46/9c0e994c0ebc40bbab8dfa2e90a22154/FLAG750fe4ca4 [2019-12-27 04:09:56,109 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:09:56,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc.i [2019-12-27 04:09:56,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb746b46/9c0e994c0ebc40bbab8dfa2e90a22154/FLAG750fe4ca4 [2019-12-27 04:09:56,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb746b46/9c0e994c0ebc40bbab8dfa2e90a22154 [2019-12-27 04:09:56,338 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:09:56,340 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:09:56,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:09:56,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:09:56,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:09:56,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:09:56" (1/1) ... [2019-12-27 04:09:56,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:56, skipping insertion in model container [2019-12-27 04:09:56,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:09:56" (1/1) ... [2019-12-27 04:09:56,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:09:56,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:09:56,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:09:56,933 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:09:57,069 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:09:57,169 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:09:57,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57 WrapperNode [2019-12-27 04:09:57,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:09:57,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:09:57,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:09:57,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:09:57,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:09:57,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:09:57,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:09:57,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:09:57,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,302 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (1/1) ... [2019-12-27 04:09:57,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:09:57,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:09:57,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:09:57,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:09:57,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (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-27 04:09:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:09:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:09:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:09:57,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:09:57,395 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:09:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:09:57,396 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:09:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:09:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 04:09:57,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 04:09:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:09:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:09:57,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:09:57,403 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 04:09:58,163 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:09:58,164 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:09:58,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:09:58 BoogieIcfgContainer [2019-12-27 04:09:58,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:09:58,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:09:58,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:09:58,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:09:58,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:09:56" (1/3) ... [2019-12-27 04:09:58,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a969da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:09:58, skipping insertion in model container [2019-12-27 04:09:58,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:09:57" (2/3) ... [2019-12-27 04:09:58,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a969da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:09:58, skipping insertion in model container [2019-12-27 04:09:58,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:09:58" (3/3) ... [2019-12-27 04:09:58,178 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc.i [2019-12-27 04:09:58,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:09:58,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:09:58,203 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:09:58,205 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:09:58,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,252 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,253 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,253 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,302 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,303 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,306 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,307 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,307 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,308 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,317 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:09:58,342 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 04:09:58,363 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:09:58,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:09:58,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:09:58,364 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:09:58,364 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:09:58,364 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:09:58,364 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:09:58,365 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:09:58,394 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 04:09:58,397 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 04:09:58,523 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 04:09:58,524 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:09:58,543 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:09:58,565 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 04:09:58,650 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 04:09:58,650 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:09:58,658 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 04:09:58,677 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 04:09:58,679 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:10:03,579 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 04:10:03,722 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 04:10:03,769 INFO L206 etLargeBlockEncoding]: Checked pairs total: 79634 [2019-12-27 04:10:03,769 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 04:10:03,774 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-27 04:10:22,073 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-27 04:10:22,076 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-27 04:10:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:10:22,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:22,083 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:10:22,084 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:22,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash 839588, now seen corresponding path program 1 times [2019-12-27 04:10:22,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:22,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433650761] [2019-12-27 04:10:22,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:22,336 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-27 04:10:22,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433650761] [2019-12-27 04:10:22,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:22,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:10:22,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789288460] [2019-12-27 04:10:22,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:22,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:22,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:22,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:22,364 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-27 04:10:26,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:26,008 INFO L93 Difference]: Finished difference Result 115280 states and 496088 transitions. [2019-12-27 04:10:26,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:26,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:10:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:26,755 INFO L225 Difference]: With dead ends: 115280 [2019-12-27 04:10:26,755 INFO L226 Difference]: Without dead ends: 112928 [2019-12-27 04:10:26,757 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-27 04:10:31,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112928 states. [2019-12-27 04:10:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112928 to 112928. [2019-12-27 04:10:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112928 states. [2019-12-27 04:10:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112928 states to 112928 states and 486484 transitions. [2019-12-27 04:10:34,033 INFO L78 Accepts]: Start accepts. Automaton has 112928 states and 486484 transitions. Word has length 3 [2019-12-27 04:10:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:34,034 INFO L462 AbstractCegarLoop]: Abstraction has 112928 states and 486484 transitions. [2019-12-27 04:10:34,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:10:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 112928 states and 486484 transitions. [2019-12-27 04:10:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:10:34,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:34,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:34,039 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1760802055, now seen corresponding path program 1 times [2019-12-27 04:10:34,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:34,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277628022] [2019-12-27 04:10:34,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:37,673 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-27 04:10:37,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277628022] [2019-12-27 04:10:37,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:37,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:37,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392609130] [2019-12-27 04:10:37,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:10:37,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:37,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:10:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:10:37,677 INFO L87 Difference]: Start difference. First operand 112928 states and 486484 transitions. Second operand 4 states. [2019-12-27 04:10:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:39,042 INFO L93 Difference]: Finished difference Result 176610 states and 731654 transitions. [2019-12-27 04:10:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:10:39,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 04:10:39,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:40,381 INFO L225 Difference]: With dead ends: 176610 [2019-12-27 04:10:40,381 INFO L226 Difference]: Without dead ends: 176561 [2019-12-27 04:10:40,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:10:49,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176561 states. [2019-12-27 04:10:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176561 to 162745. [2019-12-27 04:10:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162745 states. [2019-12-27 04:10:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162745 states to 162745 states and 681729 transitions. [2019-12-27 04:10:53,973 INFO L78 Accepts]: Start accepts. Automaton has 162745 states and 681729 transitions. Word has length 11 [2019-12-27 04:10:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:10:53,974 INFO L462 AbstractCegarLoop]: Abstraction has 162745 states and 681729 transitions. [2019-12-27 04:10:53,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:10:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 162745 states and 681729 transitions. [2019-12-27 04:10:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:10:53,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:10:53,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:10:53,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:10:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:10:53,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1561773324, now seen corresponding path program 1 times [2019-12-27 04:10:53,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:10:53,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180581257] [2019-12-27 04:10:53,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:10:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:10:54,080 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-27 04:10:54,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180581257] [2019-12-27 04:10:54,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:10:54,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:10:54,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522173842] [2019-12-27 04:10:54,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:10:54,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:10:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:10:54,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:10:54,083 INFO L87 Difference]: Start difference. First operand 162745 states and 681729 transitions. Second operand 3 states. [2019-12-27 04:10:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:10:54,223 INFO L93 Difference]: Finished difference Result 33244 states and 109167 transitions. [2019-12-27 04:10:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:10:54,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 04:10:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:10:54,283 INFO L225 Difference]: With dead ends: 33244 [2019-12-27 04:10:54,284 INFO L226 Difference]: Without dead ends: 33244 [2019-12-27 04:10:54,284 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-27 04:10:54,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33244 states. [2019-12-27 04:11:00,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33244 to 33244. [2019-12-27 04:11:00,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33244 states. [2019-12-27 04:11:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33244 states to 33244 states and 109167 transitions. [2019-12-27 04:11:00,161 INFO L78 Accepts]: Start accepts. Automaton has 33244 states and 109167 transitions. Word has length 13 [2019-12-27 04:11:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:00,162 INFO L462 AbstractCegarLoop]: Abstraction has 33244 states and 109167 transitions. [2019-12-27 04:11:00,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 33244 states and 109167 transitions. [2019-12-27 04:11:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 04:11:00,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:00,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:11:00,164 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:00,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1197008698, now seen corresponding path program 1 times [2019-12-27 04:11:00,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:00,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520165742] [2019-12-27 04:11:00,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:00,266 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-27 04:11:00,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520165742] [2019-12-27 04:11:00,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:00,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:00,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545049837] [2019-12-27 04:11:00,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:11:00,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:00,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:11:00,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:11:00,268 INFO L87 Difference]: Start difference. First operand 33244 states and 109167 transitions. Second operand 4 states. [2019-12-27 04:11:00,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:00,712 INFO L93 Difference]: Finished difference Result 44535 states and 142999 transitions. [2019-12-27 04:11:00,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:11:00,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 04:11:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:00,786 INFO L225 Difference]: With dead ends: 44535 [2019-12-27 04:11:00,786 INFO L226 Difference]: Without dead ends: 44528 [2019-12-27 04:11:00,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:11:01,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44528 states. [2019-12-27 04:11:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44528 to 39179. [2019-12-27 04:11:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39179 states. [2019-12-27 04:11:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39179 states to 39179 states and 127862 transitions. [2019-12-27 04:11:01,530 INFO L78 Accepts]: Start accepts. Automaton has 39179 states and 127862 transitions. Word has length 13 [2019-12-27 04:11:01,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:01,531 INFO L462 AbstractCegarLoop]: Abstraction has 39179 states and 127862 transitions. [2019-12-27 04:11:01,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:11:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 39179 states and 127862 transitions. [2019-12-27 04:11:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 04:11:01,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:01,535 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-27 04:11:01,535 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash -789449835, now seen corresponding path program 1 times [2019-12-27 04:11:01,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:01,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594434844] [2019-12-27 04:11:01,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:01,647 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-27 04:11:01,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594434844] [2019-12-27 04:11:01,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:01,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:01,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584888348] [2019-12-27 04:11:01,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:11:01,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:11:01,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:11:01,650 INFO L87 Difference]: Start difference. First operand 39179 states and 127862 transitions. Second operand 5 states. [2019-12-27 04:11:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:02,433 INFO L93 Difference]: Finished difference Result 52446 states and 167747 transitions. [2019-12-27 04:11:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:11:02,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 04:11:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:02,516 INFO L225 Difference]: With dead ends: 52446 [2019-12-27 04:11:02,516 INFO L226 Difference]: Without dead ends: 52433 [2019-12-27 04:11:02,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:11:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52433 states. [2019-12-27 04:11:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52433 to 39607. [2019-12-27 04:11:03,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39607 states. [2019-12-27 04:11:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39607 states to 39607 states and 129076 transitions. [2019-12-27 04:11:03,622 INFO L78 Accepts]: Start accepts. Automaton has 39607 states and 129076 transitions. Word has length 19 [2019-12-27 04:11:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:03,622 INFO L462 AbstractCegarLoop]: Abstraction has 39607 states and 129076 transitions. [2019-12-27 04:11:03,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:11:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 39607 states and 129076 transitions. [2019-12-27 04:11:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 04:11:03,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:03,635 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-27 04:11:03,635 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:03,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:03,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2013302827, now seen corresponding path program 1 times [2019-12-27 04:11:03,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:03,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932379756] [2019-12-27 04:11:03,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:03,692 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-27 04:11:03,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932379756] [2019-12-27 04:11:03,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:03,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:03,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612851232] [2019-12-27 04:11:03,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:11:03,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:11:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:11:03,694 INFO L87 Difference]: Start difference. First operand 39607 states and 129076 transitions. Second operand 4 states. [2019-12-27 04:11:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:03,735 INFO L93 Difference]: Finished difference Result 7467 states and 20456 transitions. [2019-12-27 04:11:03,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:11:03,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 04:11:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:03,752 INFO L225 Difference]: With dead ends: 7467 [2019-12-27 04:11:03,752 INFO L226 Difference]: Without dead ends: 7467 [2019-12-27 04:11:03,753 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-27 04:11:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7467 states. [2019-12-27 04:11:03,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7467 to 7355. [2019-12-27 04:11:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-27 04:11:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 20136 transitions. [2019-12-27 04:11:03,861 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 20136 transitions. Word has length 25 [2019-12-27 04:11:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:03,861 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 20136 transitions. [2019-12-27 04:11:03,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:11:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 20136 transitions. [2019-12-27 04:11:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 04:11:03,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:03,872 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-27 04:11:03,872 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1439896358, now seen corresponding path program 1 times [2019-12-27 04:11:03,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:03,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744730423] [2019-12-27 04:11:03,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:03,954 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-27 04:11:03,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744730423] [2019-12-27 04:11:03,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:03,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:11:03,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418290887] [2019-12-27 04:11:03,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:11:03,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:03,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:11:03,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:11:03,959 INFO L87 Difference]: Start difference. First operand 7355 states and 20136 transitions. Second operand 5 states. [2019-12-27 04:11:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:03,998 INFO L93 Difference]: Finished difference Result 5312 states and 15268 transitions. [2019-12-27 04:11:03,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:11:03,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 04:11:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:04,011 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 04:11:04,011 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 04:11:04,012 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-27 04:11:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 04:11:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 04:11:04,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 04:11:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14284 transitions. [2019-12-27 04:11:04,122 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14284 transitions. Word has length 37 [2019-12-27 04:11:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:04,122 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14284 transitions. [2019-12-27 04:11:04,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:11:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14284 transitions. [2019-12-27 04:11:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 04:11:04,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:04,133 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-27 04:11:04,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1467892093, now seen corresponding path program 1 times [2019-12-27 04:11:04,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:04,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140218178] [2019-12-27 04:11:04,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:04,209 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-27 04:11:04,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140218178] [2019-12-27 04:11:04,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:04,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:11:04,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945580210] [2019-12-27 04:11:04,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:04,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:04,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:04,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:04,212 INFO L87 Difference]: Start difference. First operand 4948 states and 14284 transitions. Second operand 3 states. [2019-12-27 04:11:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:04,284 INFO L93 Difference]: Finished difference Result 4957 states and 14297 transitions. [2019-12-27 04:11:04,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:04,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 04:11:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:04,296 INFO L225 Difference]: With dead ends: 4957 [2019-12-27 04:11:04,296 INFO L226 Difference]: Without dead ends: 4957 [2019-12-27 04:11:04,297 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-27 04:11:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2019-12-27 04:11:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 4953. [2019-12-27 04:11:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4953 states. [2019-12-27 04:11:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4953 states to 4953 states and 14293 transitions. [2019-12-27 04:11:04,399 INFO L78 Accepts]: Start accepts. Automaton has 4953 states and 14293 transitions. Word has length 65 [2019-12-27 04:11:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:04,400 INFO L462 AbstractCegarLoop]: Abstraction has 4953 states and 14293 transitions. [2019-12-27 04:11:04,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4953 states and 14293 transitions. [2019-12-27 04:11:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 04:11:04,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:04,410 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-27 04:11:04,411 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:04,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:04,411 INFO L82 PathProgramCache]: Analyzing trace with hash 873301269, now seen corresponding path program 1 times [2019-12-27 04:11:04,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:04,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680151597] [2019-12-27 04:11:04,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:04,523 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-27 04:11:04,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680151597] [2019-12-27 04:11:04,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:04,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 04:11:04,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677860622] [2019-12-27 04:11:04,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:11:04,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:04,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:11:04,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:11:04,526 INFO L87 Difference]: Start difference. First operand 4953 states and 14293 transitions. Second operand 5 states. [2019-12-27 04:11:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:04,825 INFO L93 Difference]: Finished difference Result 7544 states and 21558 transitions. [2019-12-27 04:11:04,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:11:04,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 04:11:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:04,836 INFO L225 Difference]: With dead ends: 7544 [2019-12-27 04:11:04,837 INFO L226 Difference]: Without dead ends: 7544 [2019-12-27 04:11:04,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:11:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7544 states. [2019-12-27 04:11:04,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7544 to 6350. [2019-12-27 04:11:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6350 states. [2019-12-27 04:11:04,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6350 states to 6350 states and 18328 transitions. [2019-12-27 04:11:04,934 INFO L78 Accepts]: Start accepts. Automaton has 6350 states and 18328 transitions. Word has length 65 [2019-12-27 04:11:04,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:04,935 INFO L462 AbstractCegarLoop]: Abstraction has 6350 states and 18328 transitions. [2019-12-27 04:11:04,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:11:04,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6350 states and 18328 transitions. [2019-12-27 04:11:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 04:11:04,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:04,944 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-27 04:11:04,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:04,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:04,945 INFO L82 PathProgramCache]: Analyzing trace with hash -127580537, now seen corresponding path program 2 times [2019-12-27 04:11:04,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:04,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252026267] [2019-12-27 04:11:04,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:05,052 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-27 04:11:05,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252026267] [2019-12-27 04:11:05,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:05,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:11:05,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508067052] [2019-12-27 04:11:05,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:11:05,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:11:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:11:05,054 INFO L87 Difference]: Start difference. First operand 6350 states and 18328 transitions. Second operand 6 states. [2019-12-27 04:11:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:05,706 INFO L93 Difference]: Finished difference Result 10883 states and 31208 transitions. [2019-12-27 04:11:05,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:11:05,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 04:11:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:05,720 INFO L225 Difference]: With dead ends: 10883 [2019-12-27 04:11:05,720 INFO L226 Difference]: Without dead ends: 10883 [2019-12-27 04:11:05,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 04:11:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-27 04:11:05,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7012. [2019-12-27 04:11:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7012 states. [2019-12-27 04:11:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7012 states to 7012 states and 20306 transitions. [2019-12-27 04:11:05,834 INFO L78 Accepts]: Start accepts. Automaton has 7012 states and 20306 transitions. Word has length 65 [2019-12-27 04:11:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:05,835 INFO L462 AbstractCegarLoop]: Abstraction has 7012 states and 20306 transitions. [2019-12-27 04:11:05,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:11:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7012 states and 20306 transitions. [2019-12-27 04:11:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 04:11:05,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:05,844 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-27 04:11:05,845 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:05,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:05,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1928895531, now seen corresponding path program 3 times [2019-12-27 04:11:05,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:05,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996974272] [2019-12-27 04:11:05,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:05,971 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-27 04:11:05,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996974272] [2019-12-27 04:11:05,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:05,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:05,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33891867] [2019-12-27 04:11:05,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:05,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:05,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:05,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:05,973 INFO L87 Difference]: Start difference. First operand 7012 states and 20306 transitions. Second operand 3 states. [2019-12-27 04:11:06,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:06,035 INFO L93 Difference]: Finished difference Result 7012 states and 20305 transitions. [2019-12-27 04:11:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:06,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 04:11:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:06,045 INFO L225 Difference]: With dead ends: 7012 [2019-12-27 04:11:06,046 INFO L226 Difference]: Without dead ends: 7012 [2019-12-27 04:11:06,046 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-27 04:11:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7012 states. [2019-12-27 04:11:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7012 to 4682. [2019-12-27 04:11:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4682 states. [2019-12-27 04:11:06,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4682 states to 4682 states and 13829 transitions. [2019-12-27 04:11:06,129 INFO L78 Accepts]: Start accepts. Automaton has 4682 states and 13829 transitions. Word has length 65 [2019-12-27 04:11:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:06,129 INFO L462 AbstractCegarLoop]: Abstraction has 4682 states and 13829 transitions. [2019-12-27 04:11:06,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4682 states and 13829 transitions. [2019-12-27 04:11:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 04:11:06,136 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:06,136 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-27 04:11:06,136 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:06,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash 796962561, now seen corresponding path program 1 times [2019-12-27 04:11:06,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:06,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955539936] [2019-12-27 04:11:06,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:06,201 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-27 04:11:06,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955539936] [2019-12-27 04:11:06,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:06,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:06,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587486976] [2019-12-27 04:11:06,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:06,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:06,204 INFO L87 Difference]: Start difference. First operand 4682 states and 13829 transitions. Second operand 3 states. [2019-12-27 04:11:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:06,230 INFO L93 Difference]: Finished difference Result 4186 states and 12061 transitions. [2019-12-27 04:11:06,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:06,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 04:11:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:06,239 INFO L225 Difference]: With dead ends: 4186 [2019-12-27 04:11:06,239 INFO L226 Difference]: Without dead ends: 4186 [2019-12-27 04:11:06,239 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-27 04:11:06,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4186 states. [2019-12-27 04:11:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4186 to 3862. [2019-12-27 04:11:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-27 04:11:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 11145 transitions. [2019-12-27 04:11:06,323 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 11145 transitions. Word has length 66 [2019-12-27 04:11:06,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:06,324 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 11145 transitions. [2019-12-27 04:11:06,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 11145 transitions. [2019-12-27 04:11:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:11:06,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:06,332 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-27 04:11:06,332 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash -129319907, now seen corresponding path program 1 times [2019-12-27 04:11:06,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:06,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884064515] [2019-12-27 04:11:06,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:11:06,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884064515] [2019-12-27 04:11:06,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:06,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:11:06,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777075964] [2019-12-27 04:11:06,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:11:06,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:06,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:11:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:11:06,466 INFO L87 Difference]: Start difference. First operand 3862 states and 11145 transitions. Second operand 7 states. [2019-12-27 04:11:07,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:07,013 INFO L93 Difference]: Finished difference Result 6482 states and 18354 transitions. [2019-12-27 04:11:07,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 04:11:07,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 04:11:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:07,024 INFO L225 Difference]: With dead ends: 6482 [2019-12-27 04:11:07,024 INFO L226 Difference]: Without dead ends: 6482 [2019-12-27 04:11:07,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:11:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2019-12-27 04:11:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 3862. [2019-12-27 04:11:07,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2019-12-27 04:11:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 11145 transitions. [2019-12-27 04:11:07,095 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 11145 transitions. Word has length 67 [2019-12-27 04:11:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:07,095 INFO L462 AbstractCegarLoop]: Abstraction has 3862 states and 11145 transitions. [2019-12-27 04:11:07,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:11:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 11145 transitions. [2019-12-27 04:11:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 04:11:07,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:07,102 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-27 04:11:07,102 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:07,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:07,103 INFO L82 PathProgramCache]: Analyzing trace with hash 392783873, now seen corresponding path program 2 times [2019-12-27 04:11:07,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:07,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777079132] [2019-12-27 04:11:07,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:07,174 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-27 04:11:07,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777079132] [2019-12-27 04:11:07,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:07,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:11:07,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194821444] [2019-12-27 04:11:07,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:11:07,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:07,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:11:07,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:11:07,177 INFO L87 Difference]: Start difference. First operand 3862 states and 11145 transitions. Second operand 3 states. [2019-12-27 04:11:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:07,200 INFO L93 Difference]: Finished difference Result 3690 states and 10432 transitions. [2019-12-27 04:11:07,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:11:07,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 04:11:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:07,206 INFO L225 Difference]: With dead ends: 3690 [2019-12-27 04:11:07,206 INFO L226 Difference]: Without dead ends: 3690 [2019-12-27 04:11:07,207 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-27 04:11:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2019-12-27 04:11:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 2988. [2019-12-27 04:11:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-27 04:11:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8462 transitions. [2019-12-27 04:11:07,276 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8462 transitions. Word has length 67 [2019-12-27 04:11:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:07,277 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8462 transitions. [2019-12-27 04:11:07,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:11:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8462 transitions. [2019-12-27 04:11:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:11:07,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:07,283 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, 1] [2019-12-27 04:11:07,284 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:07,284 INFO L82 PathProgramCache]: Analyzing trace with hash -857460709, now seen corresponding path program 1 times [2019-12-27 04:11:07,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:07,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435698950] [2019-12-27 04:11:07,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:11:07,493 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-27 04:11:07,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435698950] [2019-12-27 04:11:07,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:11:07,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:11:07,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126720028] [2019-12-27 04:11:07,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:11:07,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:11:07,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:11:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:11:07,496 INFO L87 Difference]: Start difference. First operand 2988 states and 8462 transitions. Second operand 12 states. [2019-12-27 04:11:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:11:07,954 INFO L93 Difference]: Finished difference Result 5254 states and 14788 transitions. [2019-12-27 04:11:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 04:11:07,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-27 04:11:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:11:07,964 INFO L225 Difference]: With dead ends: 5254 [2019-12-27 04:11:07,964 INFO L226 Difference]: Without dead ends: 5223 [2019-12-27 04:11:07,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:11:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5223 states. [2019-12-27 04:11:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5223 to 4143. [2019-12-27 04:11:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4143 states. [2019-12-27 04:11:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 11625 transitions. [2019-12-27 04:11:08,064 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 11625 transitions. Word has length 68 [2019-12-27 04:11:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:11:08,064 INFO L462 AbstractCegarLoop]: Abstraction has 4143 states and 11625 transitions. [2019-12-27 04:11:08,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:11:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 11625 transitions. [2019-12-27 04:11:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:11:08,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:11:08,072 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, 1] [2019-12-27 04:11:08,072 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:11:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:11:08,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1442657587, now seen corresponding path program 2 times [2019-12-27 04:11:08,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:11:08,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056194960] [2019-12-27 04:11:08,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:11:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:11:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:11:08,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:11:08,282 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:11:08,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L803: Formula: (let ((.cse0 (store |v_#valid_58| 0 0))) (and (= v_~z$w_buff1~0_188 0) (= v_~weak$$choice2~0_132 0) (= v_~main$tmp_guard0~0_18 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_211 0) (= v_~main$tmp_guard1~0_26 0) (= v_~z~0_153 0) (= 0 v_~z$r_buff0_thd3~0_107) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_15|) (= |v_#valid_56| (store .cse0 |v_ULTIMATE.start_main_~#t2489~0.base_22| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2489~0.base_22|) (= v_~z$mem_tmp~0_39 0) (= v_~z$r_buff0_thd2~0_110 0) (= v_~z$r_buff1_thd1~0_172 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2489~0.base_22|)) (= 0 v_~z$flush_delayed~0_55) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2489~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t2489~0.base_22|) |v_ULTIMATE.start_main_~#t2489~0.offset_17| 0))) (= v_~y~0_40 0) (= 0 v_~x~0_132) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1_used~0_438 0) (= v_~z$w_buff0~0_198 0) (= v_~z$r_buff1_thd0~0_288 0) (= |v_ULTIMATE.start_main_~#t2489~0.offset_17| 0) (= 0 v_~weak$$choice0~0_34) (= v_~z$w_buff0_used~0_699 0) (= 0 v_~z$r_buff1_thd3~0_190) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2489~0.base_22| 4)) (= v_~z$r_buff1_thd2~0_178 0) (= v_~z$r_buff0_thd0~0_338 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_59|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_25|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_178, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_25|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2489~0.offset=|v_ULTIMATE.start_main_~#t2489~0.offset_17|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_135|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_42|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_44|, ULTIMATE.start_main_~#t2491~0.base=|v_ULTIMATE.start_main_~#t2491~0.base_19|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_338, ULTIMATE.start_main_~#t2491~0.offset=|v_ULTIMATE.start_main_~#t2491~0.offset_14|, #length=|v_#length_21|, ULTIMATE.start_main_~#t2489~0.base=|v_ULTIMATE.start_main_~#t2489~0.base_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_39, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_48|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_438, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_38|, ~z$flush_delayed~0=v_~z$flush_delayed~0_55, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_29|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_26|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_107, ULTIMATE.start_main_~#t2490~0.base=|v_ULTIMATE.start_main_~#t2490~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_132, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_59|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_71|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~z$w_buff1~0=v_~z$w_buff1~0_188, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_195|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_288, ~y~0=v_~y~0_40, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_110, ULTIMATE.start_main_~#t2490~0.offset=|v_ULTIMATE.start_main_~#t2490~0.offset_17|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_17|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_699, ~z$w_buff0~0=v_~z$w_buff0~0_198, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_190, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_56|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_30|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_153, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t2489~0.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t2491~0.base, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2491~0.offset, #length, ULTIMATE.start_main_~#t2489~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2490~0.base, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t2490~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:11:08,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_115 v_~z$w_buff1_used~0_60) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_~z$w_buff0~0_27 v_~z$w_buff1~0_20) (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_7|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_7|) (= v_~z$w_buff0_used~0_114 1) (= 2 v_~z$w_buff0~0_26)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_114, ~z$w_buff0~0=v_~z$w_buff0~0_26, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_9, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_7|, ~z$w_buff1~0=v_~z$w_buff1~0_20, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 04:11:08,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1809961007 256))) (.cse1 (= (mod ~z$r_buff0_thd1~0_In-1809961007 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1809961007|)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1809961007 |P0Thread1of1ForFork0_#t~ite5_Out-1809961007|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809961007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1809961007} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1809961007|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1809961007, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1809961007} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 04:11:08,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L803-1-->L805: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2490~0.base_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2490~0.base_9|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2490~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2490~0.base_9|) |v_ULTIMATE.start_main_~#t2490~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2490~0.base_9| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2490~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t2490~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t2490~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2490~0.offset=|v_ULTIMATE.start_main_~#t2490~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2490~0.base=|v_ULTIMATE.start_main_~#t2490~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2490~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2490~0.base, #length] because there is no mapped edge [2019-12-27 04:11:08,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2491~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2491~0.offset_11|) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2491~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2491~0.base_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2491~0.base_13| 4) |v_#length_17|) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2491~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2491~0.base_13|) |v_ULTIMATE.start_main_~#t2491~0.offset_11| 2))) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2491~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2491~0.base=|v_ULTIMATE.start_main_~#t2491~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2491~0.offset=|v_ULTIMATE.start_main_~#t2491~0.offset_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2491~0.base, ULTIMATE.start_main_~#t2491~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 04:11:08,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L760-2-->L760-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-181270174 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In-181270174 256) 0))) (or (and (= ~z~0_In-181270174 |P1Thread1of1ForFork1_#t~ite9_Out-181270174|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-181270174 |P1Thread1of1ForFork1_#t~ite9_Out-181270174|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-181270174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181270174, ~z$w_buff1~0=~z$w_buff1~0_In-181270174, ~z~0=~z~0_In-181270174} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-181270174|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-181270174, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-181270174, ~z$w_buff1~0=~z$w_buff1~0_In-181270174, ~z~0=~z~0_In-181270174} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 04:11:08,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L760-4-->L761: Formula: (= v_~z~0_37 |v_P1Thread1of1ForFork1_#t~ite9_10|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_10|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_9|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_13|, ~z~0=v_~z~0_37} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 04:11:08,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1964111477 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1964111477 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out1964111477| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1964111477| ~z$w_buff0_used~0_In1964111477)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1964111477, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1964111477} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1964111477, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1964111477|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1964111477} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 04:11:08,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-354779978 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-354779978 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-354779978| ~z$w_buff1~0_In-354779978)) (and (or .cse0 .cse1) (= ~z~0_In-354779978 |P2Thread1of1ForFork2_#t~ite15_Out-354779978|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-354779978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354779978, ~z$w_buff1~0=~z$w_buff1~0_In-354779978, ~z~0=~z~0_In-354779978} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-354779978|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-354779978, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-354779978, ~z$w_buff1~0=~z$w_buff1~0_In-354779978, ~z~0=~z~0_In-354779978} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 04:11:08,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L780-4-->L781: Formula: (= v_~z~0_41 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_41, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 04:11:08,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1024194431 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1024194431 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1024194431| ~z$w_buff0_used~0_In-1024194431)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1024194431| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024194431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1024194431} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1024194431, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1024194431, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1024194431|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 04:11:08,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1747445895 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1747445895 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1747445895 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1747445895 256)))) (or (and (= ~z$w_buff1_used~0_In-1747445895 |P2Thread1of1ForFork2_#t~ite18_Out-1747445895|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1747445895|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1747445895, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1747445895, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1747445895, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1747445895} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1747445895, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1747445895, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1747445895, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1747445895, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1747445895|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 04:11:08,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-600915092 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-600915092 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-600915092 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-600915092 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-600915092 |P1Thread1of1ForFork1_#t~ite12_Out-600915092|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-600915092|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-600915092, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-600915092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-600915092, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-600915092} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-600915092, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-600915092, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-600915092, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-600915092|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-600915092} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 04:11:08,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1109304339 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1109304339 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1109304339|)) (and (= ~z$r_buff0_thd3~0_In-1109304339 |P2Thread1of1ForFork2_#t~ite19_Out-1109304339|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109304339} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1109304339, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1109304339, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1109304339|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 04:11:08,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1134667855 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1134667855 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-1134667855| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1134667855| ~z$r_buff0_thd2~0_In-1134667855) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134667855, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1134667855} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1134667855, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1134667855|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1134667855} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 04:11:08,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-1119509595 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1119509595 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1119509595 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1119509595 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1119509595| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1119509595 |P1Thread1of1ForFork1_#t~ite14_Out-1119509595|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119509595, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1119509595, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1119509595, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1119509595} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1119509595, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1119509595, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1119509595, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1119509595|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1119509595} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 04:11:08,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L764-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_130 |v_P1Thread1of1ForFork1_#t~ite14_40|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_130, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_39|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 04:11:08,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1294382681 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In1294382681 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1294382681 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1294382681 256)))) (or (and (= ~z$r_buff1_thd3~0_In1294382681 |P2Thread1of1ForFork2_#t~ite20_Out1294382681|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1294382681|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1294382681, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1294382681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1294382681, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1294382681} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1294382681, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1294382681|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1294382681, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1294382681, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1294382681} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 04:11:08,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L784-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_148 |v_P2Thread1of1ForFork2_#t~ite20_36|)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_148, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 04:11:08,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1346707456 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1346707456 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1346707456 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1346707456 256)))) (or (and (= ~z$w_buff1_used~0_In-1346707456 |P0Thread1of1ForFork0_#t~ite6_Out-1346707456|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1346707456|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1346707456, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1346707456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1346707456, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1346707456} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1346707456|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1346707456, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1346707456, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1346707456, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1346707456} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 04:11:08,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L743-->L744: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1879486890 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1879486890 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-1879486890 ~z$r_buff0_thd1~0_In-1879486890)) (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1879486890 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879486890, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1879486890} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1879486890, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1879486890|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1879486890} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:11:08,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1522798897 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1522798897 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1522798897 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1522798897 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In1522798897 |P0Thread1of1ForFork0_#t~ite8_Out1522798897|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1522798897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522798897, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522798897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522798897, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522798897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1522798897, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1522798897|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522798897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522798897, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522798897} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 04:11:08,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_118 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_118, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 04:11:08,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L807-1-->L813: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:11:08,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L813-2-->L813-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2061534550 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In2061534550 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out2061534550| |ULTIMATE.start_main_#t~ite25_Out2061534550|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out2061534550| ~z$w_buff1~0_In2061534550) (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out2061534550| ~z~0_In2061534550) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061534550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061534550, ~z$w_buff1~0=~z$w_buff1~0_In2061534550, ~z~0=~z~0_In2061534550} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2061534550, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2061534550|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2061534550, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out2061534550|, ~z$w_buff1~0=~z$w_buff1~0_In2061534550, ~z~0=~z~0_In2061534550} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 04:11:08,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1321677758 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1321677758 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1321677758|)) (and (= ~z$w_buff0_used~0_In-1321677758 |ULTIMATE.start_main_#t~ite26_Out-1321677758|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1321677758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1321677758} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1321677758, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1321677758, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1321677758|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 04:11:08,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-->L815-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1735479452 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-1735479452 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1735479452 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1735479452 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out-1735479452| ~z$w_buff1_used~0_In-1735479452)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite27_Out-1735479452| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735479452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735479452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1735479452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735479452} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1735479452, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1735479452, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1735479452, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1735479452, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1735479452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 04:11:08,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-988259342 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-988259342 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-988259342| 0)) (and (= |ULTIMATE.start_main_#t~ite28_Out-988259342| ~z$r_buff0_thd0~0_In-988259342) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-988259342, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988259342} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-988259342, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-988259342|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988259342} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 04:11:08,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-999246344 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-999246344 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-999246344 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-999246344 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-999246344 |ULTIMATE.start_main_#t~ite29_Out-999246344|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out-999246344| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-999246344, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-999246344, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-999246344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-999246344} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-999246344, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-999246344|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-999246344, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-999246344, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-999246344} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 04:11:08,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L829-->L830: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_46 256))) (= v_~z$r_buff0_thd0~0_162 v_~z$r_buff0_thd0~0_161)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_46} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_161, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_7|, ~weak$$choice2~0=v_~weak$$choice2~0_46} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 04:11:08,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L832-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_15 256)) (not (= (mod v_~z$flush_delayed~0_47 256) 0)) (= 0 v_~z$flush_delayed~0_46) (= v_~z$mem_tmp~0_33 v_~z~0_120)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_47} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_33, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_28|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~z$flush_delayed~0=v_~z$flush_delayed~0_46, ~z~0=v_~z~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:11:08,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 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_8, 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-27 04:11:08,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:11:08 BasicIcfg [2019-12-27 04:11:08,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:11:08,447 INFO L168 Benchmark]: Toolchain (without parser) took 72106.38 ms. Allocated memory was 138.9 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 102.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,447 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.78 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 151.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,450 INFO L168 Benchmark]: Boogie Preprocessor took 58.40 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,450 INFO L168 Benchmark]: RCFGBuilder took 856.87 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,452 INFO L168 Benchmark]: TraceAbstraction took 70275.75 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 04:11:08,456 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.18 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.00 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 101.8 MB in the beginning and 154.9 MB in the end (delta: -53.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.78 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 151.6 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 58.40 ms. Allocated memory is still 202.9 MB. Free memory was 151.6 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 856.87 ms. Allocated memory is still 202.9 MB. Free memory was 148.9 MB in the beginning and 99.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70275.75 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 173 ProgramPointsBefore, 95 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 5611 VarBasedMoverChecksPositive, 231 VarBasedMoverChecksNegative, 69 SemBasedMoverChecksPositive, 225 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 79634 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L803] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L731] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L732] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L733] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L734] 1 z$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L741] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L805] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 [L757] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 y = 2 [L777] 3 z = 1 VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L780] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L761] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L762] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L763] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L742] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L814] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L815] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L816] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L817] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 z$flush_delayed = weak$$choice2 [L823] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L825] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L826] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L827] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2324 SDtfs, 1892 SDslu, 3980 SDs, 0 SdLazy, 2292 SolverSat, 110 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 21 SyntacticMatches, 12 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162745occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.5s AutomataMinimizationTime, 15 MinimizatonAttempts, 44592 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 717 NumberOfCodeBlocks, 717 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 634 ConstructedInterpolants, 0 QuantifiedInterpolants, 115337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...