/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:15:14,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:15:14,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:15:14,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:15:14,147 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:15:14,148 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:15:14,150 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:15:14,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:15:14,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:15:14,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:15:14,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:15:14,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:15:14,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:15:14,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:15:14,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:15:14,160 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:15:14,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:15:14,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:15:14,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:15:14,165 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:15:14,166 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:15:14,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:15:14,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:15:14,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:15:14,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:15:14,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:15:14,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:15:14,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:15:14,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:15:14,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:15:14,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:15:14,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:15:14,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:15:14,176 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:15:14,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:15:14,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:15:14,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:15:14,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:15:14,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:15:14,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:15:14,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:15:14,181 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-VariableLbe.epf [2019-12-27 06:15:14,198 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:15:14,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:15:14,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:15:14,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:15:14,200 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:15:14,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:15:14,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:15:14,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:15:14,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:15:14,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:15:14,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:15:14,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:15:14,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:15:14,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:15:14,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:15:14,203 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:15:14,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:15:14,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:15:14,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:15:14,204 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:15:14,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:15:14,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:15:14,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:15:14,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:15:14,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:15:14,484 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:15:14,500 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:15:14,504 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:15:14,505 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:15:14,505 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:15:14,507 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 06:15:14,572 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8982b6a00/ac4aac5527ca4c7a88ab739235cf865a/FLAG286f2da28 [2019-12-27 06:15:15,091 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:15:15,092 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2019-12-27 06:15:15,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8982b6a00/ac4aac5527ca4c7a88ab739235cf865a/FLAG286f2da28 [2019-12-27 06:15:15,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8982b6a00/ac4aac5527ca4c7a88ab739235cf865a [2019-12-27 06:15:15,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:15:15,413 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:15:15,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:15:15,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:15:15,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:15:15,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:15:15" (1/1) ... [2019-12-27 06:15:15,421 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:15, skipping insertion in model container [2019-12-27 06:15:15,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:15:15" (1/1) ... [2019-12-27 06:15:15,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:15:15,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:15:16,053 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:15:16,066 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:15:16,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:15:16,258 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:15:16,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16 WrapperNode [2019-12-27 06:15:16,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:15:16,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:15:16,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:15:16,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:15:16,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:15:16,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:15:16,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:15:16,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:15:16,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 06:15:16,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:15:16,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:15:16,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:15:16,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:15:16,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (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 06:15:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:15:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:15:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:15:16,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:15:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:15:16,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:15:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:15:16,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:15:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:15:16,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:15:16,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:15:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:15:16,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:15:16,454 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 06:15:17,270 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:15:17,271 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:15:17,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:15:17 BoogieIcfgContainer [2019-12-27 06:15:17,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:15:17,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:15:17,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:15:17,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:15:17,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:15:15" (1/3) ... [2019-12-27 06:15:17,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d929a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:15:17, skipping insertion in model container [2019-12-27 06:15:17,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (2/3) ... [2019-12-27 06:15:17,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d929a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:15:17, skipping insertion in model container [2019-12-27 06:15:17,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:15:17" (3/3) ... [2019-12-27 06:15:17,281 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2019-12-27 06:15:17,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:15:17,291 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:15:17,299 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:15:17,300 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:15:17,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,337 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,337 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,368 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,370 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,379 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,380 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,414 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,414 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:15:17,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:15:17,451 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:15:17,451 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:15:17,451 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:15:17,451 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:15:17,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:15:17,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:15:17,452 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:15:17,452 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:15:17,467 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 06:15:17,469 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 06:15:17,573 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 06:15:17,573 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:15:17,589 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:15:17,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 06:15:17,670 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 06:15:17,670 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:15:17,679 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:15:17,700 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 06:15:17,701 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:15:21,238 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 06:15:21,395 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 06:15:21,422 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84147 [2019-12-27 06:15:21,422 INFO L214 etLargeBlockEncoding]: Total number of compositions: 117 [2019-12-27 06:15:21,426 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 101 transitions [2019-12-27 06:15:36,838 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104860 states. [2019-12-27 06:15:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 104860 states. [2019-12-27 06:15:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 06:15:36,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:36,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 06:15:36,847 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:36,852 INFO L82 PathProgramCache]: Analyzing trace with hash 828527309, now seen corresponding path program 1 times [2019-12-27 06:15:36,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:36,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628981599] [2019-12-27 06:15:36,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:37,079 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 06:15:37,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628981599] [2019-12-27 06:15:37,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:37,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:15:37,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290142088] [2019-12-27 06:15:37,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:37,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:37,103 INFO L87 Difference]: Start difference. First operand 104860 states. Second operand 3 states. [2019-12-27 06:15:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:40,340 INFO L93 Difference]: Finished difference Result 104560 states and 443064 transitions. [2019-12-27 06:15:40,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:40,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 06:15:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:41,112 INFO L225 Difference]: With dead ends: 104560 [2019-12-27 06:15:41,112 INFO L226 Difference]: Without dead ends: 102376 [2019-12-27 06:15:41,113 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 06:15:44,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-27 06:15:48,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-27 06:15:48,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-27 06:15:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 434146 transitions. [2019-12-27 06:15:49,304 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 434146 transitions. Word has length 5 [2019-12-27 06:15:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:49,304 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 434146 transitions. [2019-12-27 06:15:49,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:49,305 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 434146 transitions. [2019-12-27 06:15:49,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:15:49,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:49,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:49,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:49,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1573606083, now seen corresponding path program 1 times [2019-12-27 06:15:49,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:49,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957059616] [2019-12-27 06:15:49,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:49,430 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 06:15:49,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957059616] [2019-12-27 06:15:49,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:49,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:49,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826903267] [2019-12-27 06:15:49,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:49,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:49,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:49,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:49,434 INFO L87 Difference]: Start difference. First operand 102376 states and 434146 transitions. Second operand 4 states. [2019-12-27 06:15:53,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:53,802 INFO L93 Difference]: Finished difference Result 164490 states and 667458 transitions. [2019-12-27 06:15:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:53,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:15:53,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:55,126 INFO L225 Difference]: With dead ends: 164490 [2019-12-27 06:15:55,127 INFO L226 Difference]: Without dead ends: 164441 [2019-12-27 06:15:55,128 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 06:16:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-27 06:16:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 151681. [2019-12-27 06:16:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151681 states. [2019-12-27 06:16:06,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151681 states to 151681 states and 621345 transitions. [2019-12-27 06:16:06,843 INFO L78 Accepts]: Start accepts. Automaton has 151681 states and 621345 transitions. Word has length 11 [2019-12-27 06:16:06,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:06,844 INFO L462 AbstractCegarLoop]: Abstraction has 151681 states and 621345 transitions. [2019-12-27 06:16:06,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:16:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 151681 states and 621345 transitions. [2019-12-27 06:16:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:16:06,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:06,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:16:06,848 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1860490575, now seen corresponding path program 1 times [2019-12-27 06:16:06,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:06,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626197445] [2019-12-27 06:16:06,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:06,919 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 06:16:06,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626197445] [2019-12-27 06:16:06,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:06,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:06,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859075463] [2019-12-27 06:16:06,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:06,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:06,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:06,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:06,921 INFO L87 Difference]: Start difference. First operand 151681 states and 621345 transitions. Second operand 3 states. [2019-12-27 06:16:07,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:07,038 INFO L93 Difference]: Finished difference Result 31396 states and 100772 transitions. [2019-12-27 06:16:07,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:07,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:16:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:07,104 INFO L225 Difference]: With dead ends: 31396 [2019-12-27 06:16:07,104 INFO L226 Difference]: Without dead ends: 31396 [2019-12-27 06:16:07,105 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 06:16:07,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31396 states. [2019-12-27 06:16:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31396 to 31396. [2019-12-27 06:16:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31396 states. [2019-12-27 06:16:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31396 states to 31396 states and 100772 transitions. [2019-12-27 06:16:07,687 INFO L78 Accepts]: Start accepts. Automaton has 31396 states and 100772 transitions. Word has length 13 [2019-12-27 06:16:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:07,687 INFO L462 AbstractCegarLoop]: Abstraction has 31396 states and 100772 transitions. [2019-12-27 06:16:07,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 31396 states and 100772 transitions. [2019-12-27 06:16:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:16:07,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:07,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:16:07,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:07,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:07,689 INFO L82 PathProgramCache]: Analyzing trace with hash -884807319, now seen corresponding path program 1 times [2019-12-27 06:16:07,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:07,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428567952] [2019-12-27 06:16:07,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:07,783 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 06:16:07,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428567952] [2019-12-27 06:16:07,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:07,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:07,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597095501] [2019-12-27 06:16:07,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:16:07,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:07,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:16:07,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:16:07,785 INFO L87 Difference]: Start difference. First operand 31396 states and 100772 transitions. Second operand 4 states. [2019-12-27 06:16:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:10,125 INFO L93 Difference]: Finished difference Result 42032 states and 131800 transitions. [2019-12-27 06:16:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:16:10,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:16:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:10,193 INFO L225 Difference]: With dead ends: 42032 [2019-12-27 06:16:10,193 INFO L226 Difference]: Without dead ends: 42025 [2019-12-27 06:16:10,194 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 06:16:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42025 states. [2019-12-27 06:16:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42025 to 36988. [2019-12-27 06:16:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36988 states. [2019-12-27 06:16:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36988 states to 36988 states and 117793 transitions. [2019-12-27 06:16:10,902 INFO L78 Accepts]: Start accepts. Automaton has 36988 states and 117793 transitions. Word has length 13 [2019-12-27 06:16:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:10,903 INFO L462 AbstractCegarLoop]: Abstraction has 36988 states and 117793 transitions. [2019-12-27 06:16:10,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:16:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36988 states and 117793 transitions. [2019-12-27 06:16:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 06:16:10,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:10,907 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 06:16:10,908 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1881358111, now seen corresponding path program 1 times [2019-12-27 06:16:10,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:10,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642056265] [2019-12-27 06:16:10,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:11,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642056265] [2019-12-27 06:16:11,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:11,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:16:11,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320278762] [2019-12-27 06:16:11,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:16:11,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:16:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:16:11,077 INFO L87 Difference]: Start difference. First operand 36988 states and 117793 transitions. Second operand 5 states. [2019-12-27 06:16:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:11,872 INFO L93 Difference]: Finished difference Result 49769 states and 155237 transitions. [2019-12-27 06:16:11,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:16:11,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 06:16:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:12,326 INFO L225 Difference]: With dead ends: 49769 [2019-12-27 06:16:12,326 INFO L226 Difference]: Without dead ends: 49756 [2019-12-27 06:16:12,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:16:12,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49756 states. [2019-12-27 06:16:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49756 to 37331. [2019-12-27 06:16:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37331 states. [2019-12-27 06:16:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37331 states to 37331 states and 118759 transitions. [2019-12-27 06:16:13,035 INFO L78 Accepts]: Start accepts. Automaton has 37331 states and 118759 transitions. Word has length 19 [2019-12-27 06:16:13,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:13,035 INFO L462 AbstractCegarLoop]: Abstraction has 37331 states and 118759 transitions. [2019-12-27 06:16:13,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:16:13,036 INFO L276 IsEmpty]: Start isEmpty. Operand 37331 states and 118759 transitions. [2019-12-27 06:16:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:16:13,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:13,050 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 06:16:13,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:13,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:13,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1003586279, now seen corresponding path program 1 times [2019-12-27 06:16:13,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:13,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636694130] [2019-12-27 06:16:13,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:13,108 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 06:16:13,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636694130] [2019-12-27 06:16:13,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:13,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:16:13,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544122846] [2019-12-27 06:16:13,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:16:13,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:16:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:16:13,111 INFO L87 Difference]: Start difference. First operand 37331 states and 118759 transitions. Second operand 4 states. [2019-12-27 06:16:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:13,153 INFO L93 Difference]: Finished difference Result 7095 states and 19249 transitions. [2019-12-27 06:16:13,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:16:13,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:16:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:13,165 INFO L225 Difference]: With dead ends: 7095 [2019-12-27 06:16:13,166 INFO L226 Difference]: Without dead ends: 7095 [2019-12-27 06:16:13,166 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 06:16:13,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7095 states. [2019-12-27 06:16:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7095 to 6983. [2019-12-27 06:16:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6983 states. [2019-12-27 06:16:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6983 states to 6983 states and 18929 transitions. [2019-12-27 06:16:13,276 INFO L78 Accepts]: Start accepts. Automaton has 6983 states and 18929 transitions. Word has length 25 [2019-12-27 06:16:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:13,276 INFO L462 AbstractCegarLoop]: Abstraction has 6983 states and 18929 transitions. [2019-12-27 06:16:13,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:16:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 6983 states and 18929 transitions. [2019-12-27 06:16:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 06:16:13,288 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:13,288 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 06:16:13,288 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:13,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:13,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1818610326, now seen corresponding path program 1 times [2019-12-27 06:16:13,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:13,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066018031] [2019-12-27 06:16:13,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:13,361 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 06:16:13,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066018031] [2019-12-27 06:16:13,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:13,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:16:13,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836037615] [2019-12-27 06:16:13,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:16:13,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:13,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:16:13,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:16:13,364 INFO L87 Difference]: Start difference. First operand 6983 states and 18929 transitions. Second operand 5 states. [2019-12-27 06:16:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:13,405 INFO L93 Difference]: Finished difference Result 5023 states and 14417 transitions. [2019-12-27 06:16:13,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:16:13,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 06:16:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:13,414 INFO L225 Difference]: With dead ends: 5023 [2019-12-27 06:16:13,414 INFO L226 Difference]: Without dead ends: 5023 [2019-12-27 06:16:13,414 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 06:16:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-27 06:16:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-27 06:16:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-27 06:16:13,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13433 transitions. [2019-12-27 06:16:13,491 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13433 transitions. Word has length 37 [2019-12-27 06:16:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:13,492 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13433 transitions. [2019-12-27 06:16:13,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:16:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13433 transitions. [2019-12-27 06:16:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:16:13,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:13,500 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 06:16:13,500 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 582496663, now seen corresponding path program 1 times [2019-12-27 06:16:13,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:13,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579990341] [2019-12-27 06:16:13,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:13,624 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 06:16:13,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579990341] [2019-12-27 06:16:13,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:13,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:13,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981899818] [2019-12-27 06:16:13,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:13,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:13,627 INFO L87 Difference]: Start difference. First operand 4659 states and 13433 transitions. Second operand 3 states. [2019-12-27 06:16:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:13,654 INFO L93 Difference]: Finished difference Result 4659 states and 13229 transitions. [2019-12-27 06:16:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:13,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:16:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:13,662 INFO L225 Difference]: With dead ends: 4659 [2019-12-27 06:16:13,662 INFO L226 Difference]: Without dead ends: 4659 [2019-12-27 06:16:13,663 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 06:16:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4659 states. [2019-12-27 06:16:13,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4659 to 4659. [2019-12-27 06:16:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-27 06:16:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13229 transitions. [2019-12-27 06:16:13,732 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13229 transitions. Word has length 65 [2019-12-27 06:16:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:13,733 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13229 transitions. [2019-12-27 06:16:13,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13229 transitions. [2019-12-27 06:16:13,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:13,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:13,741 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 06:16:13,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 995216816, now seen corresponding path program 1 times [2019-12-27 06:16:13,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:13,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362336145] [2019-12-27 06:16:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:13,933 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 06:16:13,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362336145] [2019-12-27 06:16:13,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:13,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:13,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956483178] [2019-12-27 06:16:13,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:16:13,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:16:13,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:16:13,942 INFO L87 Difference]: Start difference. First operand 4659 states and 13229 transitions. Second operand 9 states. [2019-12-27 06:16:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:14,995 INFO L93 Difference]: Finished difference Result 8985 states and 25185 transitions. [2019-12-27 06:16:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 06:16:14,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:16:14,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:15,008 INFO L225 Difference]: With dead ends: 8985 [2019-12-27 06:16:15,008 INFO L226 Difference]: Without dead ends: 8985 [2019-12-27 06:16:15,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:16:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8985 states. [2019-12-27 06:16:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8985 to 5897. [2019-12-27 06:16:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2019-12-27 06:16:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 16794 transitions. [2019-12-27 06:16:15,141 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 16794 transitions. Word has length 66 [2019-12-27 06:16:15,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:15,141 INFO L462 AbstractCegarLoop]: Abstraction has 5897 states and 16794 transitions. [2019-12-27 06:16:15,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:16:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 16794 transitions. [2019-12-27 06:16:15,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:15,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:15,154 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 06:16:15,154 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1697100040, now seen corresponding path program 2 times [2019-12-27 06:16:15,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:15,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31214048] [2019-12-27 06:16:15,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:15,314 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 06:16:15,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31214048] [2019-12-27 06:16:15,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:15,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:16:15,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853249467] [2019-12-27 06:16:15,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:16:15,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:15,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:16:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:16:15,317 INFO L87 Difference]: Start difference. First operand 5897 states and 16794 transitions. Second operand 5 states. [2019-12-27 06:16:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:15,595 INFO L93 Difference]: Finished difference Result 8146 states and 22850 transitions. [2019-12-27 06:16:15,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:16:15,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 06:16:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:15,607 INFO L225 Difference]: With dead ends: 8146 [2019-12-27 06:16:15,607 INFO L226 Difference]: Without dead ends: 8146 [2019-12-27 06:16:15,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:16:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8146 states. [2019-12-27 06:16:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8146 to 6114. [2019-12-27 06:16:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6114 states. [2019-12-27 06:16:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6114 states to 6114 states and 17407 transitions. [2019-12-27 06:16:15,741 INFO L78 Accepts]: Start accepts. Automaton has 6114 states and 17407 transitions. Word has length 66 [2019-12-27 06:16:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:15,741 INFO L462 AbstractCegarLoop]: Abstraction has 6114 states and 17407 transitions. [2019-12-27 06:16:15,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:16:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 6114 states and 17407 transitions. [2019-12-27 06:16:15,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:15,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:15,754 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 06:16:15,754 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1085535050, now seen corresponding path program 3 times [2019-12-27 06:16:15,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:15,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644206572] [2019-12-27 06:16:15,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:15,904 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 06:16:15,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644206572] [2019-12-27 06:16:15,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:15,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:15,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201146067] [2019-12-27 06:16:15,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:16:15,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:16:15,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:16:15,907 INFO L87 Difference]: Start difference. First operand 6114 states and 17407 transitions. Second operand 9 states. [2019-12-27 06:16:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:17,038 INFO L93 Difference]: Finished difference Result 10909 states and 30886 transitions. [2019-12-27 06:16:17,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:16:17,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 06:16:17,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:17,054 INFO L225 Difference]: With dead ends: 10909 [2019-12-27 06:16:17,055 INFO L226 Difference]: Without dead ends: 10909 [2019-12-27 06:16:17,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 06:16:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10909 states. [2019-12-27 06:16:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10909 to 6429. [2019-12-27 06:16:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6429 states. [2019-12-27 06:16:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6429 states to 6429 states and 18346 transitions. [2019-12-27 06:16:17,201 INFO L78 Accepts]: Start accepts. Automaton has 6429 states and 18346 transitions. Word has length 66 [2019-12-27 06:16:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:17,201 INFO L462 AbstractCegarLoop]: Abstraction has 6429 states and 18346 transitions. [2019-12-27 06:16:17,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:16:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6429 states and 18346 transitions. [2019-12-27 06:16:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:17,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:17,210 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 06:16:17,210 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2109016002, now seen corresponding path program 4 times [2019-12-27 06:16:17,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:17,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865272377] [2019-12-27 06:16:17,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:17,300 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 06:16:17,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865272377] [2019-12-27 06:16:17,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:17,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:16:17,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142272588] [2019-12-27 06:16:17,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:16:17,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:17,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:16:17,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:16:17,303 INFO L87 Difference]: Start difference. First operand 6429 states and 18346 transitions. Second operand 6 states. [2019-12-27 06:16:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:17,797 INFO L93 Difference]: Finished difference Result 10438 states and 29611 transitions. [2019-12-27 06:16:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:16:17,798 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 06:16:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:17,811 INFO L225 Difference]: With dead ends: 10438 [2019-12-27 06:16:17,812 INFO L226 Difference]: Without dead ends: 10438 [2019-12-27 06:16:17,812 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 06:16:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10438 states. [2019-12-27 06:16:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10438 to 6594. [2019-12-27 06:16:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6594 states. [2019-12-27 06:16:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 18831 transitions. [2019-12-27 06:16:17,919 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 18831 transitions. Word has length 66 [2019-12-27 06:16:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:17,920 INFO L462 AbstractCegarLoop]: Abstraction has 6594 states and 18831 transitions. [2019-12-27 06:16:17,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:16:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 18831 transitions. [2019-12-27 06:16:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:17,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:17,929 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 06:16:17,929 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1748460144, now seen corresponding path program 5 times [2019-12-27 06:16:17,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:17,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824668009] [2019-12-27 06:16:17,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:17,993 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 06:16:17,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824668009] [2019-12-27 06:16:17,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:17,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:17,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431228495] [2019-12-27 06:16:17,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:17,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:17,995 INFO L87 Difference]: Start difference. First operand 6594 states and 18831 transitions. Second operand 3 states. [2019-12-27 06:16:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:18,022 INFO L93 Difference]: Finished difference Result 5774 states and 16215 transitions. [2019-12-27 06:16:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:18,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:16:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:18,030 INFO L225 Difference]: With dead ends: 5774 [2019-12-27 06:16:18,030 INFO L226 Difference]: Without dead ends: 5774 [2019-12-27 06:16:18,031 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 06:16:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-12-27 06:16:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 5558. [2019-12-27 06:16:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-12-27 06:16:18,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 15627 transitions. [2019-12-27 06:16:18,101 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 15627 transitions. Word has length 66 [2019-12-27 06:16:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:18,101 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 15627 transitions. [2019-12-27 06:16:18,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 15627 transitions. [2019-12-27 06:16:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:18,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:18,109 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 06:16:18,109 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1127758128, now seen corresponding path program 1 times [2019-12-27 06:16:18,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:18,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006271778] [2019-12-27 06:16:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:18,208 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 06:16:18,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006271778] [2019-12-27 06:16:18,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:18,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:16:18,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84173587] [2019-12-27 06:16:18,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:16:18,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:18,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:16:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:16:18,210 INFO L87 Difference]: Start difference. First operand 5558 states and 15627 transitions. Second operand 7 states. [2019-12-27 06:16:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:18,732 INFO L93 Difference]: Finished difference Result 8129 states and 22541 transitions. [2019-12-27 06:16:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:16:18,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 06:16:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:18,743 INFO L225 Difference]: With dead ends: 8129 [2019-12-27 06:16:18,744 INFO L226 Difference]: Without dead ends: 8129 [2019-12-27 06:16:18,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:16:18,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8129 states. [2019-12-27 06:16:18,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8129 to 5706. [2019-12-27 06:16:18,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5706 states. [2019-12-27 06:16:18,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5706 states to 5706 states and 16032 transitions. [2019-12-27 06:16:18,921 INFO L78 Accepts]: Start accepts. Automaton has 5706 states and 16032 transitions. Word has length 67 [2019-12-27 06:16:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:18,922 INFO L462 AbstractCegarLoop]: Abstraction has 5706 states and 16032 transitions. [2019-12-27 06:16:18,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:16:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5706 states and 16032 transitions. [2019-12-27 06:16:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:18,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:18,929 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 06:16:18,929 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1037439894, now seen corresponding path program 2 times [2019-12-27 06:16:18,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:18,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078706094] [2019-12-27 06:16:18,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:19,005 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 06:16:19,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078706094] [2019-12-27 06:16:19,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:19,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:19,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305216125] [2019-12-27 06:16:19,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:19,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:19,007 INFO L87 Difference]: Start difference. First operand 5706 states and 16032 transitions. Second operand 3 states. [2019-12-27 06:16:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:19,058 INFO L93 Difference]: Finished difference Result 5706 states and 16031 transitions. [2019-12-27 06:16:19,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:19,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:16:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:19,066 INFO L225 Difference]: With dead ends: 5706 [2019-12-27 06:16:19,067 INFO L226 Difference]: Without dead ends: 5706 [2019-12-27 06:16:19,067 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 06:16:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-12-27 06:16:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 2982. [2019-12-27 06:16:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2982 states. [2019-12-27 06:16:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 8447 transitions. [2019-12-27 06:16:19,123 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 8447 transitions. Word has length 67 [2019-12-27 06:16:19,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:19,123 INFO L462 AbstractCegarLoop]: Abstraction has 2982 states and 8447 transitions. [2019-12-27 06:16:19,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:19,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 8447 transitions. [2019-12-27 06:16:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:16:19,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:19,128 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 06:16:19,128 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 136335134, now seen corresponding path program 1 times [2019-12-27 06:16:19,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:19,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836749738] [2019-12-27 06:16:19,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:19,451 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 06:16:19,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836749738] [2019-12-27 06:16:19,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:19,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:16:19,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020356532] [2019-12-27 06:16:19,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:16:19,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:16:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:16:19,453 INFO L87 Difference]: Start difference. First operand 2982 states and 8447 transitions. Second operand 15 states. [2019-12-27 06:16:20,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:20,814 INFO L93 Difference]: Finished difference Result 7719 states and 21731 transitions. [2019-12-27 06:16:20,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 06:16:20,815 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 06:16:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:20,825 INFO L225 Difference]: With dead ends: 7719 [2019-12-27 06:16:20,826 INFO L226 Difference]: Without dead ends: 7692 [2019-12-27 06:16:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=1544, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 06:16:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2019-12-27 06:16:20,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 4418. [2019-12-27 06:16:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4418 states. [2019-12-27 06:16:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 12434 transitions. [2019-12-27 06:16:20,899 INFO L78 Accepts]: Start accepts. Automaton has 4418 states and 12434 transitions. Word has length 68 [2019-12-27 06:16:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:20,899 INFO L462 AbstractCegarLoop]: Abstraction has 4418 states and 12434 transitions. [2019-12-27 06:16:20,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:16:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4418 states and 12434 transitions. [2019-12-27 06:16:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:16:20,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:20,905 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 06:16:20,905 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:20,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash 780009116, now seen corresponding path program 2 times [2019-12-27 06:16:20,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:20,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692562894] [2019-12-27 06:16:20,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:21,189 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 06:16:21,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692562894] [2019-12-27 06:16:21,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:21,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:16:21,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592145209] [2019-12-27 06:16:21,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 06:16:21,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:21,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 06:16:21,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 06:16:21,192 INFO L87 Difference]: Start difference. First operand 4418 states and 12434 transitions. Second operand 15 states. [2019-12-27 06:16:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:22,338 INFO L93 Difference]: Finished difference Result 7482 states and 20807 transitions. [2019-12-27 06:16:22,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:16:22,339 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 06:16:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:22,348 INFO L225 Difference]: With dead ends: 7482 [2019-12-27 06:16:22,349 INFO L226 Difference]: Without dead ends: 7457 [2019-12-27 06:16:22,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1171, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 06:16:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7457 states. [2019-12-27 06:16:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7457 to 4968. [2019-12-27 06:16:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4968 states. [2019-12-27 06:16:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 13972 transitions. [2019-12-27 06:16:22,426 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 13972 transitions. Word has length 68 [2019-12-27 06:16:22,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:22,426 INFO L462 AbstractCegarLoop]: Abstraction has 4968 states and 13972 transitions. [2019-12-27 06:16:22,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 06:16:22,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 13972 transitions. [2019-12-27 06:16:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:16:22,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:22,431 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 06:16:22,431 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:22,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash -438278224, now seen corresponding path program 3 times [2019-12-27 06:16:22,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:22,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702499682] [2019-12-27 06:16:22,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:22,669 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 06:16:22,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702499682] [2019-12-27 06:16:22,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:22,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:16:22,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630675380] [2019-12-27 06:16:22,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:16:22,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:22,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:16:22,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:16:22,674 INFO L87 Difference]: Start difference. First operand 4968 states and 13972 transitions. Second operand 13 states. [2019-12-27 06:16:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:23,421 INFO L93 Difference]: Finished difference Result 7346 states and 20490 transitions. [2019-12-27 06:16:23,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 06:16:23,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-27 06:16:23,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:23,433 INFO L225 Difference]: With dead ends: 7346 [2019-12-27 06:16:23,433 INFO L226 Difference]: Without dead ends: 7319 [2019-12-27 06:16:23,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-27 06:16:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2019-12-27 06:16:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 5022. [2019-12-27 06:16:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5022 states. [2019-12-27 06:16:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 14125 transitions. [2019-12-27 06:16:23,519 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 14125 transitions. Word has length 68 [2019-12-27 06:16:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:23,520 INFO L462 AbstractCegarLoop]: Abstraction has 5022 states and 14125 transitions. [2019-12-27 06:16:23,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:16:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 14125 transitions. [2019-12-27 06:16:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 06:16:23,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:23,628 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 06:16:23,628 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -618545446, now seen corresponding path program 4 times [2019-12-27 06:16:23,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:23,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782523173] [2019-12-27 06:16:23,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:23,778 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:16:23,778 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:16:23,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] ULTIMATE.startENTRY-->L827: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t891~0.base_24| 4) |v_#length_21|) (= v_~x$w_buff1_used~0_75 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t891~0.base_24|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24|)) (= 0 v_~x$r_buff0_thd0~0_80) (= 0 v_~x$r_buff0_thd3~0_21) (= 0 |v_ULTIMATE.start_main_~#t891~0.offset_17|) (= |v_#NULL.offset_7| 0) (= v_~b~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~x$r_buff0_thd2~0_29) (= v_~x$r_buff1_thd1~0_22 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t891~0.base_24| 1)) (= v_~z~0_10 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~x$w_buff1~0_27) (= v_~x$flush_delayed~0_16 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$w_buff0~0_26) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~x$r_buff1_thd2~0_21 0) (= 0 v_~a~0_7) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= 0 v_~weak$$choice0~0_7) (= v_~x~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t891~0.base_24|) |v_ULTIMATE.start_main_~#t891~0.offset_17| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff0_used~0_110) (= 0 v_~x$r_buff0_thd1~0_21) (= v_~x$mem_tmp~0_11 0) (= v_~y~0_10 0) (= v_~x$r_buff1_thd0~0_54 0) (= v_~x$r_buff1_thd3~0_20 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~main$tmp_guard1~0_13 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ~x$w_buff0~0=v_~x$w_buff0~0_26, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_16|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_13|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_15|, ~a~0=v_~a~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_80, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_12|, ~x$w_buff1~0=v_~x$w_buff1~0_27, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_75, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_31, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_18|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_~#t891~0.offset=|v_ULTIMATE.start_main_~#t891~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_15|, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ULTIMATE.start_main_~#t891~0.base=|v_ULTIMATE.start_main_~#t891~0.base_24|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_12|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_54, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_29, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_14|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_20|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ~b~0=v_~b~0_10, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_10, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_15|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t891~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t891~0.base, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t893~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t892~0.base, ~x$read_delayed_var~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t892~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 06:16:23,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L827-1-->L829: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t892~0.base_10|) |v_ULTIMATE.start_main_~#t892~0.offset_10| 1))) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t892~0.base_10| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t892~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t892~0.offset_10|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t892~0.base_10| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t892~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t892~0.base=|v_ULTIMATE.start_main_~#t892~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t892~0.offset=|v_ULTIMATE.start_main_~#t892~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t892~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t892~0.offset] because there is no mapped edge [2019-12-27 06:16:23,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L829-1-->L831: Formula: (and (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t893~0.base_12| 4)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t893~0.base_12|) |v_ULTIMATE.start_main_~#t893~0.offset_10| 2))) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t893~0.base_12|) (= |v_ULTIMATE.start_main_~#t893~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t893~0.base_12|)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t893~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t893~0.base=|v_ULTIMATE.start_main_~#t893~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t893~0.offset=|v_ULTIMATE.start_main_~#t893~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t893~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t893~0.offset] because there is no mapped edge [2019-12-27 06:16:23,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L4-->L778: Formula: (and (= ~x$r_buff1_thd2~0_Out-1010914726 ~x$r_buff0_thd2~0_In-1010914726) (= ~x$r_buff0_thd1~0_In-1010914726 ~x$r_buff1_thd1~0_Out-1010914726) (= ~y~0_Out-1010914726 ~__unbuffered_p1_EAX~0_Out-1010914726) (not (= 0 P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-1010914726)) (= 1 ~x$r_buff0_thd2~0_Out-1010914726) (= ~y~0_Out-1010914726 1) (= ~x$r_buff1_thd0~0_Out-1010914726 ~x$r_buff0_thd0~0_In-1010914726) (= ~x$r_buff0_thd3~0_In-1010914726 ~x$r_buff1_thd3~0_Out-1010914726) (= ~z~0_In-1010914726 ~__unbuffered_p1_EBX~0_Out-1010914726)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1010914726, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-1010914726, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1010914726, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1010914726, ~z~0=~z~0_In-1010914726, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1010914726} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1010914726, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1010914726, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1010914726, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-1010914726, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1010914726, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1010914726, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1010914726, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1010914726, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1010914726, P1Thread1of1ForFork2___VERIFIER_assert_~expression=P1Thread1of1ForFork2___VERIFIER_assert_~expression_In-1010914726, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1010914726, ~z~0=~z~0_In-1010914726, ~y~0=~y~0_Out-1010914726} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~y~0] because there is no mapped edge [2019-12-27 06:16:23,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1937500498 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1937500498 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out1937500498|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In1937500498 |P1Thread1of1ForFork2_#t~ite11_Out1937500498|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1937500498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1937500498} OutVars{P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1937500498|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1937500498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1937500498} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:16:23,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L804-2-->L804-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-155228757 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-155228757 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-155228757 |P2Thread1of1ForFork0_#t~ite15_Out-155228757|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-155228757 |P2Thread1of1ForFork0_#t~ite15_Out-155228757|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-155228757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-155228757, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-155228757, ~x~0=~x~0_In-155228757} OutVars{P2Thread1of1ForFork0_#t~ite15=|P2Thread1of1ForFork0_#t~ite15_Out-155228757|, ~x$w_buff1~0=~x$w_buff1~0_In-155228757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-155228757, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-155228757, ~x~0=~x~0_In-155228757} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15] because there is no mapped edge [2019-12-27 06:16:23,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L804-4-->L805: Formula: (= v_~x~0_17 |v_P2Thread1of1ForFork0_#t~ite15_8|) InVars {P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_8|} OutVars{P2Thread1of1ForFork0_#t~ite15=|v_P2Thread1of1ForFork0_#t~ite15_7|, P2Thread1of1ForFork0_#t~ite16=|v_P2Thread1of1ForFork0_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite15, P2Thread1of1ForFork0_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 06:16:23,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In223760512 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In223760512 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite17_Out223760512|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite17_Out223760512| ~x$w_buff0_used~0_In223760512) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In223760512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223760512} OutVars{P2Thread1of1ForFork0_#t~ite17=|P2Thread1of1ForFork0_#t~ite17_Out223760512|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In223760512, ~x$w_buff0_used~0=~x$w_buff0_used~0_In223760512} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite17] because there is no mapped edge [2019-12-27 06:16:23,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-428429782 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-428429782 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-428429782 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-428429782 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite18_Out-428429782| ~x$w_buff1_used~0_In-428429782)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite18_Out-428429782| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-428429782, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-428429782, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-428429782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428429782} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-428429782, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-428429782, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-428429782, P2Thread1of1ForFork0_#t~ite18=|P2Thread1of1ForFork0_#t~ite18_Out-428429782|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428429782} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite18] because there is no mapped edge [2019-12-27 06:16:23,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1528155242 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1528155242 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite19_Out-1528155242|)) (and (= ~x$r_buff0_thd3~0_In-1528155242 |P2Thread1of1ForFork0_#t~ite19_Out-1528155242|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1528155242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1528155242} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1528155242, P2Thread1of1ForFork0_#t~ite19=|P2Thread1of1ForFork0_#t~ite19_Out-1528155242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1528155242} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 06:16:23,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-388999825 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In-388999825 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd3~0_In-388999825 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-388999825 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite20_Out-388999825| ~x$r_buff1_thd3~0_In-388999825)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-388999825| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-388999825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-388999825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-388999825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-388999825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-388999825, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-388999825, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-388999825, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-388999825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-388999825} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 06:16:23,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L808-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= v_~x$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork0_#t~ite20_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_8|} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_7|, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#t~ite20, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:16:23,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L743-2-->L743-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork1_#t~ite4_Out477312581| |P0Thread1of1ForFork1_#t~ite3_Out477312581|)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In477312581 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In477312581 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~x$w_buff1~0_In477312581 |P0Thread1of1ForFork1_#t~ite3_Out477312581|)) (and .cse0 (or .cse1 .cse2) (= |P0Thread1of1ForFork1_#t~ite3_Out477312581| ~x~0_In477312581)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In477312581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In477312581, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In477312581, ~x~0=~x~0_In477312581} OutVars{P0Thread1of1ForFork1_#t~ite4=|P0Thread1of1ForFork1_#t~ite4_Out477312581|, P0Thread1of1ForFork1_#t~ite3=|P0Thread1of1ForFork1_#t~ite3_Out477312581|, ~x$w_buff1~0=~x$w_buff1~0_In477312581, ~x$w_buff1_used~0=~x$w_buff1_used~0_In477312581, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In477312581, ~x~0=~x~0_In477312581} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite4, P0Thread1of1ForFork1_#t~ite3] because there is no mapped edge [2019-12-27 06:16:23,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In128500650 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In128500650 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In128500650 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In128500650 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out128500650|)) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In128500650 |P1Thread1of1ForFork2_#t~ite12_Out128500650|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In128500650, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In128500650, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In128500650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128500650} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In128500650, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In128500650, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out128500650|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In128500650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128500650} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:16:23,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L781-->L782: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1018918822 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1018918822 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1018918822) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-1018918822 ~x$r_buff0_thd2~0_Out-1018918822)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1018918822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1018918822} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1018918822, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1018918822|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1018918822} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:16:23,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In678378360 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In678378360 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In678378360 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In678378360 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In678378360 |P1Thread1of1ForFork2_#t~ite14_Out678378360|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out678378360|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In678378360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In678378360, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In678378360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In678378360} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In678378360, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In678378360, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out678378360|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In678378360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In678378360} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:16:23,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L782-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~x$r_buff1_thd2~0_14) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:16:23,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1689978030 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1689978030 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1689978030|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1689978030 |P0Thread1of1ForFork1_#t~ite5_Out-1689978030|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1689978030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1689978030} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1689978030|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1689978030, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1689978030} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:16:23,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L745-->L745-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In2131789181 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2131789181 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In2131789181 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2131789181 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out2131789181| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite6_Out2131789181| ~x$w_buff1_used~0_In2131789181)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2131789181, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131789181, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2131789181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2131789181} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2131789181, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out2131789181|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131789181, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2131789181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2131789181} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:16:23,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1624551080 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1624551080 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite7_Out-1624551080| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite7_Out-1624551080| ~x$r_buff0_thd1~0_In-1624551080)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1624551080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1624551080} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1624551080, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1624551080|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1624551080} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 06:16:23,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-959079868 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-959079868 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-959079868 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-959079868 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-959079868| ~x$r_buff1_thd1~0_In-959079868) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-959079868| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-959079868, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-959079868, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-959079868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-959079868} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-959079868, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-959079868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-959079868, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-959079868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-959079868} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:16:23,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L747-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 06:16:23,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L831-1-->L837: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:16:23,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L837-2-->L837-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1094567255| |ULTIMATE.start_main_#t~ite24_Out-1094567255|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1094567255 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1094567255 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~x~0_In-1094567255 |ULTIMATE.start_main_#t~ite24_Out-1094567255|)) (and .cse0 (= ~x$w_buff1~0_In-1094567255 |ULTIMATE.start_main_#t~ite24_Out-1094567255|) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1094567255, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094567255, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1094567255, ~x~0=~x~0_In-1094567255} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1094567255, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1094567255|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1094567255|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1094567255, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1094567255, ~x~0=~x~0_In-1094567255} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 06:16:23,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L838-->L838-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1761491300 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1761491300 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1761491300|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1761491300 |ULTIMATE.start_main_#t~ite26_Out-1761491300|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1761491300, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1761491300} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1761491300, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1761491300|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1761491300} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 06:16:23,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-->L839-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2144131792 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2144131792 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2144131792 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In2144131792 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out2144131792|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2144131792 |ULTIMATE.start_main_#t~ite27_Out2144131792|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2144131792, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2144131792, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2144131792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144131792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2144131792, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2144131792, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2144131792|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2144131792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2144131792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 06:16:23,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L840-->L840-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-105840729 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-105840729 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-105840729| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out-105840729| ~x$r_buff0_thd0~0_In-105840729) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-105840729, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-105840729} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-105840729, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-105840729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-105840729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 06:16:23,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In904476607 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In904476607 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In904476607 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In904476607 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out904476607|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In904476607 |ULTIMATE.start_main_#t~ite29_Out904476607|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904476607, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904476607, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904476607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904476607} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904476607, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out904476607|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904476607, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904476607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904476607} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 06:16:23,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L849-->L849-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-627799535 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-627799535 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-627799535 256)) (and (= 0 (mod ~x$r_buff1_thd0~0_In-627799535 256)) .cse0) (and (= (mod ~x$w_buff1_used~0_In-627799535 256) 0) .cse0))) .cse1 (= ~x$w_buff0~0_In-627799535 |ULTIMATE.start_main_#t~ite35_Out-627799535|) (= |ULTIMATE.start_main_#t~ite36_Out-627799535| |ULTIMATE.start_main_#t~ite35_Out-627799535|)) (and (not .cse1) (= ~x$w_buff0~0_In-627799535 |ULTIMATE.start_main_#t~ite36_Out-627799535|) (= |ULTIMATE.start_main_#t~ite35_In-627799535| |ULTIMATE.start_main_#t~ite35_Out-627799535|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-627799535, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-627799535, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-627799535|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-627799535, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-627799535, ~weak$$choice2~0=~weak$$choice2~0_In-627799535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627799535} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-627799535, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-627799535, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-627799535|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-627799535|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-627799535, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-627799535, ~weak$$choice2~0=~weak$$choice2~0_In-627799535, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-627799535} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 06:16:23,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L850-->L850-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1743582132 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out-1743582132| |ULTIMATE.start_main_#t~ite38_Out-1743582132|) .cse0 (= |ULTIMATE.start_main_#t~ite38_Out-1743582132| ~x$w_buff1~0_In-1743582132) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1743582132 256)))) (or (= (mod ~x$w_buff0_used~0_In-1743582132 256) 0) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1743582132 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1743582132 256) 0))))) (and (= |ULTIMATE.start_main_#t~ite38_In-1743582132| |ULTIMATE.start_main_#t~ite38_Out-1743582132|) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out-1743582132| ~x$w_buff1~0_In-1743582132)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1743582132, ~x$w_buff1~0=~x$w_buff1~0_In-1743582132, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1743582132, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In-1743582132|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1743582132, ~weak$$choice2~0=~weak$$choice2~0_In-1743582132, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1743582132} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1743582132, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1743582132|, ~x$w_buff1~0=~x$w_buff1~0_In-1743582132, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1743582132, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1743582132|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1743582132, ~weak$$choice2~0=~weak$$choice2~0_In-1743582132, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1743582132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 06:16:23,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L851-->L851-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1621854467 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out1621854467| ~x$w_buff0_used~0_In1621854467) (= |ULTIMATE.start_main_#t~ite41_In1621854467| |ULTIMATE.start_main_#t~ite41_Out1621854467|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1621854467 256)))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1621854467 256))) (= 0 (mod ~x$w_buff0_used~0_In1621854467 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In1621854467 256) 0)))) (= |ULTIMATE.start_main_#t~ite41_Out1621854467| ~x$w_buff0_used~0_In1621854467) (= |ULTIMATE.start_main_#t~ite41_Out1621854467| |ULTIMATE.start_main_#t~ite42_Out1621854467|) .cse0))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1621854467, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1621854467|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1621854467, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1621854467, ~weak$$choice2~0=~weak$$choice2~0_In1621854467, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1621854467} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1621854467, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1621854467|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1621854467, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1621854467, ~weak$$choice2~0=~weak$$choice2~0_In1621854467, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1621854467|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1621854467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:16:23,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L853-->L854: Formula: (and (= v_~x$r_buff0_thd0~0_61 v_~x$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_60, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20} AuxVars[] AssignedVars[~x$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 06:16:23,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L854-->L854-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1940734712 256) 0))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1940734712 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-1940734712 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1940734712 256)) (and .cse0 (= (mod ~x$r_buff1_thd0~0_In-1940734712 256) 0)))) .cse1 (= |ULTIMATE.start_main_#t~ite50_Out-1940734712| ~x$r_buff1_thd0~0_In-1940734712) (= |ULTIMATE.start_main_#t~ite51_Out-1940734712| |ULTIMATE.start_main_#t~ite50_Out-1940734712|)) (and (= |ULTIMATE.start_main_#t~ite50_In-1940734712| |ULTIMATE.start_main_#t~ite50_Out-1940734712|) (= |ULTIMATE.start_main_#t~ite51_Out-1940734712| ~x$r_buff1_thd0~0_In-1940734712) (not .cse1)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-1940734712|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1940734712, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1940734712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1940734712, ~weak$$choice2~0=~weak$$choice2~0_In-1940734712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1940734712} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1940734712|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1940734712, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1940734712|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1940734712, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1940734712, ~weak$$choice2~0=~weak$$choice2~0_In-1940734712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1940734712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:16:23,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L856-->L859-1: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= 0 (mod v_~x$flush_delayed~0_11 256))) (= v_~x$mem_tmp~0_6 v_~x~0_25) (= v_~x$flush_delayed~0_10 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ~x$flush_delayed~0=v_~x$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:16:23,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L859-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 06:16:23,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:16:23 BasicIcfg [2019-12-27 06:16:23,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:16:23,910 INFO L168 Benchmark]: Toolchain (without parser) took 68498.54 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.7 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 439.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,911 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.98 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 101.3 MB in the beginning and 156.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,913 INFO L168 Benchmark]: Boogie Preprocessor took 41.51 ms. Allocated memory is still 205.0 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,918 INFO L168 Benchmark]: RCFGBuilder took 905.94 ms. Allocated memory is still 205.0 MB. Free memory was 150.6 MB in the beginning and 99.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,919 INFO L168 Benchmark]: TraceAbstraction took 66633.81 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 99.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 377.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:23,926 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.71 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 844.98 ms. Allocated memory was 145.2 MB in the beginning and 205.0 MB in the end (delta: 59.8 MB). Free memory was 101.3 MB in the beginning and 156.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 205.0 MB. Free memory was 156.1 MB in the beginning and 153.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.51 ms. Allocated memory is still 205.0 MB. Free memory was 153.4 MB in the beginning and 150.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 905.94 ms. Allocated memory is still 205.0 MB. Free memory was 150.6 MB in the beginning and 99.4 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66633.81 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 99.4 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 377.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 179 ProgramPointsBefore, 93 ProgramPointsAfterwards, 216 TransitionsBefore, 101 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 33 ChoiceCompositions, 6189 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84147 CheckedPairsTotal, 117 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L827] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 2 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L831] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 b = 1 [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L805] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L807] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L743] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L837] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L838] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L839] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L840] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L841] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L845] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L846] 0 x$flush_delayed = weak$$choice2 [L847] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L848] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L849] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L850] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L851] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L852] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L852] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2821 SDtfs, 3452 SDslu, 8150 SDs, 0 SdLazy, 5511 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 44 SyntacticMatches, 20 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151681occurred 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: 23.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 57565 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 924 NumberOfCodeBlocks, 924 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 838 ConstructedInterpolants, 0 QuantifiedInterpolants, 246389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...