/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/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:31:40,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:31:40,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:31:40,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:31:40,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:31:40,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:31:40,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:31:40,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:31:40,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:31:40,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:31:40,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:31:40,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:31:40,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:31:40,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:31:40,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:31:40,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:31:40,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:31:40,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:31:40,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:31:40,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:31:40,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:31:40,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:31:40,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:31:40,097 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:31:40,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:31:40,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:31:40,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:31:40,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:31:40,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:31:40,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:31:40,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:31:40,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:31:40,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:31:40,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:31:40,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:31:40,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:31:40,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:31:40,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:31:40,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:31:40,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:31:40,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:31:40,121 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-18 22:31:40,146 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:31:40,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:31:40,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:31:40,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:31:40,149 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:31:40,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:31:40,149 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:31:40,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:31:40,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:31:40,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:31:40,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:31:40,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:31:40,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:31:40,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:31:40,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:31:40,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:31:40,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:31:40,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:31:40,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:31:40,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:31:40,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:31:40,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:31:40,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:31:40,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:31:40,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:31:40,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:31:40,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:31:40,153 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:31:40,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:31:40,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:31:40,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:31:40,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:31:40,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:31:40,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:31:40,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:31:40,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2019-12-18 22:31:40,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d529cba5/581ccdb238b84ecc8849ffd58e65231e/FLAGad8846d26 [2019-12-18 22:31:41,065 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:31:41,066 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2019-12-18 22:31:41,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d529cba5/581ccdb238b84ecc8849ffd58e65231e/FLAGad8846d26 [2019-12-18 22:31:41,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d529cba5/581ccdb238b84ecc8849ffd58e65231e [2019-12-18 22:31:41,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:31:41,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:31:41,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:41,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:31:41,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:31:41,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:41" (1/1) ... [2019-12-18 22:31:41,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144f2438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:41, skipping insertion in model container [2019-12-18 22:31:41,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:31:41" (1/1) ... [2019-12-18 22:31:41,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:31:41,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:31:41,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:41,989 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:31:42,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:31:42,156 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:31:42,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42 WrapperNode [2019-12-18 22:31:42,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:31:42,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:42,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:31:42,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:31:42,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:31:42,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:31:42,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:31:42,234 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:31:42,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (1/1) ... [2019-12-18 22:31:42,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:31:42,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:31:42,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:31:42,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:31:42,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (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-18 22:31:42,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:31:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:31:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:31:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:31:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:31:42,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:31:42,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:31:42,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:31:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 22:31:42,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 22:31:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:31:42,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:31:42,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:31:42,336 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:31:43,088 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:31:43,088 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:31:43,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:43 BoogieIcfgContainer [2019-12-18 22:31:43,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:31:43,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:31:43,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:31:43,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:31:43,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:31:41" (1/3) ... [2019-12-18 22:31:43,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712957f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:43, skipping insertion in model container [2019-12-18 22:31:43,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:31:42" (2/3) ... [2019-12-18 22:31:43,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@712957f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:31:43, skipping insertion in model container [2019-12-18 22:31:43,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:31:43" (3/3) ... [2019-12-18 22:31:43,099 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2019-12-18 22:31:43,110 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:31:43,111 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:31:43,120 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:31:43,122 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:31:43,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,173 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,180 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,181 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,181 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,182 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,183 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,184 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,185 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,186 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,187 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,209 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,214 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,214 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,218 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,219 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:31:43,235 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 22:31:43,252 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:31:43,252 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:31:43,252 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:31:43,252 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:31:43,252 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:31:43,252 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:31:43,252 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:31:43,253 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:31:43,269 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 22:31:43,272 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:43,358 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:43,359 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:43,379 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:43,405 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 22:31:43,455 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 22:31:43,456 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:31:43,475 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 22:31:43,502 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 22:31:43,503 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:31:46,650 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 22:31:46,781 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 22:31:46,813 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81758 [2019-12-18 22:31:46,814 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 22:31:46,817 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 109 transitions [2019-12-18 22:32:05,167 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 117812 states. [2019-12-18 22:32:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 117812 states. [2019-12-18 22:32:05,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 22:32:05,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:05,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 22:32:05,175 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:05,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:05,181 INFO L82 PathProgramCache]: Analyzing trace with hash 839664, now seen corresponding path program 1 times [2019-12-18 22:32:05,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:05,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611212757] [2019-12-18 22:32:05,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:05,413 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-18 22:32:05,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611212757] [2019-12-18 22:32:05,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:05,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:32:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225974384] [2019-12-18 22:32:05,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:32:05,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:05,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:32:05,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:32:05,439 INFO L87 Difference]: Start difference. First operand 117812 states. Second operand 3 states. [2019-12-18 22:32:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:08,979 INFO L93 Difference]: Finished difference Result 117510 states and 507540 transitions. [2019-12-18 22:32:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:32:08,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 22:32:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:09,843 INFO L225 Difference]: With dead ends: 117510 [2019-12-18 22:32:09,844 INFO L226 Difference]: Without dead ends: 115144 [2019-12-18 22:32:09,848 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-18 22:32:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115144 states. [2019-12-18 22:32:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115144 to 115144. [2019-12-18 22:32:18,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115144 states. [2019-12-18 22:32:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115144 states to 115144 states and 497894 transitions. [2019-12-18 22:32:19,442 INFO L78 Accepts]: Start accepts. Automaton has 115144 states and 497894 transitions. Word has length 3 [2019-12-18 22:32:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:19,442 INFO L462 AbstractCegarLoop]: Abstraction has 115144 states and 497894 transitions. [2019-12-18 22:32:19,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:32:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 115144 states and 497894 transitions. [2019-12-18 22:32:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:32:19,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:19,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:19,448 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -79799111, now seen corresponding path program 1 times [2019-12-18 22:32:19,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:19,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109318593] [2019-12-18 22:32:19,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:19,547 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-18 22:32:19,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109318593] [2019-12-18 22:32:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:19,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:19,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747345031] [2019-12-18 22:32:19,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:19,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:19,551 INFO L87 Difference]: Start difference. First operand 115144 states and 497894 transitions. Second operand 4 states. [2019-12-18 22:32:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:25,409 INFO L93 Difference]: Finished difference Result 185114 states and 767412 transitions. [2019-12-18 22:32:25,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:25,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:32:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:26,174 INFO L225 Difference]: With dead ends: 185114 [2019-12-18 22:32:26,175 INFO L226 Difference]: Without dead ends: 185065 [2019-12-18 22:32:26,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185065 states. [2019-12-18 22:32:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185065 to 169989. [2019-12-18 22:32:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169989 states. [2019-12-18 22:32:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 713980 transitions. [2019-12-18 22:32:38,702 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 713980 transitions. Word has length 11 [2019-12-18 22:32:38,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:32:38,703 INFO L462 AbstractCegarLoop]: Abstraction has 169989 states and 713980 transitions. [2019-12-18 22:32:38,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:32:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 713980 transitions. [2019-12-18 22:32:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:32:38,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:32:38,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:32:38,710 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:32:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:32:38,711 INFO L82 PathProgramCache]: Analyzing trace with hash -676042940, now seen corresponding path program 1 times [2019-12-18 22:32:38,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:32:38,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081516713] [2019-12-18 22:32:38,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:32:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:32:38,793 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-18 22:32:38,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081516713] [2019-12-18 22:32:38,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:32:38,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:32:38,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837883092] [2019-12-18 22:32:38,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:32:38,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:32:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:32:38,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:32:38,796 INFO L87 Difference]: Start difference. First operand 169989 states and 713980 transitions. Second operand 4 states. [2019-12-18 22:32:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:32:46,605 INFO L93 Difference]: Finished difference Result 241878 states and 992054 transitions. [2019-12-18 22:32:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:32:46,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 22:32:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:32:47,341 INFO L225 Difference]: With dead ends: 241878 [2019-12-18 22:32:47,341 INFO L226 Difference]: Without dead ends: 241815 [2019-12-18 22:32:47,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:32:52,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241815 states. [2019-12-18 22:32:56,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241815 to 205075. [2019-12-18 22:32:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205075 states. [2019-12-18 22:33:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205075 states to 205075 states and 855408 transitions. [2019-12-18 22:33:06,422 INFO L78 Accepts]: Start accepts. Automaton has 205075 states and 855408 transitions. Word has length 13 [2019-12-18 22:33:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:06,422 INFO L462 AbstractCegarLoop]: Abstraction has 205075 states and 855408 transitions. [2019-12-18 22:33:06,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:33:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 205075 states and 855408 transitions. [2019-12-18 22:33:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 22:33:06,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:06,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:33:06,427 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1689712693, now seen corresponding path program 1 times [2019-12-18 22:33:06,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:06,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949496120] [2019-12-18 22:33:06,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:06,487 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-18 22:33:06,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949496120] [2019-12-18 22:33:06,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:06,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:06,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614414771] [2019-12-18 22:33:06,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:06,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:06,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:06,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:06,489 INFO L87 Difference]: Start difference. First operand 205075 states and 855408 transitions. Second operand 3 states. [2019-12-18 22:33:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:06,637 INFO L93 Difference]: Finished difference Result 40406 states and 132180 transitions. [2019-12-18 22:33:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:06,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 22:33:06,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:06,736 INFO L225 Difference]: With dead ends: 40406 [2019-12-18 22:33:06,736 INFO L226 Difference]: Without dead ends: 40406 [2019-12-18 22:33:06,736 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-18 22:33:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40406 states. [2019-12-18 22:33:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40406 to 40406. [2019-12-18 22:33:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40406 states. [2019-12-18 22:33:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40406 states to 40406 states and 132180 transitions. [2019-12-18 22:33:07,400 INFO L78 Accepts]: Start accepts. Automaton has 40406 states and 132180 transitions. Word has length 13 [2019-12-18 22:33:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:07,400 INFO L462 AbstractCegarLoop]: Abstraction has 40406 states and 132180 transitions. [2019-12-18 22:33:07,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 40406 states and 132180 transitions. [2019-12-18 22:33:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 22:33:07,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:07,405 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-18 22:33:07,405 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:07,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1531561803, now seen corresponding path program 1 times [2019-12-18 22:33:07,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:07,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127913749] [2019-12-18 22:33:07,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:07,502 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-18 22:33:07,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127913749] [2019-12-18 22:33:07,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:07,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:33:07,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697507917] [2019-12-18 22:33:07,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:33:07,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:07,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:33:07,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:07,508 INFO L87 Difference]: Start difference. First operand 40406 states and 132180 transitions. Second operand 5 states. [2019-12-18 22:33:08,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:08,317 INFO L93 Difference]: Finished difference Result 54550 states and 174566 transitions. [2019-12-18 22:33:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:33:08,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 22:33:08,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:10,050 INFO L225 Difference]: With dead ends: 54550 [2019-12-18 22:33:10,051 INFO L226 Difference]: Without dead ends: 54537 [2019-12-18 22:33:10,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:33:10,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54537 states. [2019-12-18 22:33:10,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54537 to 40777. [2019-12-18 22:33:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40777 states. [2019-12-18 22:33:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40777 states to 40777 states and 133064 transitions. [2019-12-18 22:33:10,811 INFO L78 Accepts]: Start accepts. Automaton has 40777 states and 133064 transitions. Word has length 19 [2019-12-18 22:33:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:10,811 INFO L462 AbstractCegarLoop]: Abstraction has 40777 states and 133064 transitions. [2019-12-18 22:33:10,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:33:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40777 states and 133064 transitions. [2019-12-18 22:33:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 22:33:10,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:10,821 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-18 22:33:10,822 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1034032563, now seen corresponding path program 1 times [2019-12-18 22:33:10,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:10,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964666880] [2019-12-18 22:33:10,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:10,898 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-18 22:33:10,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964666880] [2019-12-18 22:33:10,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:10,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:33:10,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788851186] [2019-12-18 22:33:10,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:33:10,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:10,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:33:10,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:33:10,900 INFO L87 Difference]: Start difference. First operand 40777 states and 133064 transitions. Second operand 4 states. [2019-12-18 22:33:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:10,947 INFO L93 Difference]: Finished difference Result 7638 states and 20735 transitions. [2019-12-18 22:33:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:33:10,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 22:33:10,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:10,969 INFO L225 Difference]: With dead ends: 7638 [2019-12-18 22:33:10,970 INFO L226 Difference]: Without dead ends: 7638 [2019-12-18 22:33:10,970 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-18 22:33:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7638 states. [2019-12-18 22:33:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7638 to 7498. [2019-12-18 22:33:11,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-12-18 22:33:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 20363 transitions. [2019-12-18 22:33:11,085 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 20363 transitions. Word has length 25 [2019-12-18 22:33:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:11,086 INFO L462 AbstractCegarLoop]: Abstraction has 7498 states and 20363 transitions. [2019-12-18 22:33:11,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:33:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 20363 transitions. [2019-12-18 22:33:11,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 22:33:11,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:11,096 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-18 22:33:11,096 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2065802623, now seen corresponding path program 1 times [2019-12-18 22:33:11,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:11,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746920242] [2019-12-18 22:33:11,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:11,188 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-18 22:33:11,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746920242] [2019-12-18 22:33:11,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:11,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 22:33:11,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726939047] [2019-12-18 22:33:11,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:33:11,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:11,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:33:11,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:11,190 INFO L87 Difference]: Start difference. First operand 7498 states and 20363 transitions. Second operand 5 states. [2019-12-18 22:33:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:11,230 INFO L93 Difference]: Finished difference Result 5405 states and 15353 transitions. [2019-12-18 22:33:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:33:11,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 22:33:11,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:11,238 INFO L225 Difference]: With dead ends: 5405 [2019-12-18 22:33:11,238 INFO L226 Difference]: Without dead ends: 5025 [2019-12-18 22:33:11,238 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-18 22:33:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2019-12-18 22:33:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 4661. [2019-12-18 22:33:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4661 states. [2019-12-18 22:33:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4661 states to 4661 states and 13441 transitions. [2019-12-18 22:33:11,305 INFO L78 Accepts]: Start accepts. Automaton has 4661 states and 13441 transitions. Word has length 37 [2019-12-18 22:33:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:11,305 INFO L462 AbstractCegarLoop]: Abstraction has 4661 states and 13441 transitions. [2019-12-18 22:33:11,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:33:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4661 states and 13441 transitions. [2019-12-18 22:33:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:11,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:11,313 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-18 22:33:11,313 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:11,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:11,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1806952947, now seen corresponding path program 1 times [2019-12-18 22:33:11,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:11,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892209067] [2019-12-18 22:33:11,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:11,393 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-18 22:33:11,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892209067] [2019-12-18 22:33:11,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:11,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:33:11,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333006625] [2019-12-18 22:33:11,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:11,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:11,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:11,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:11,396 INFO L87 Difference]: Start difference. First operand 4661 states and 13441 transitions. Second operand 3 states. [2019-12-18 22:33:11,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:11,459 INFO L93 Difference]: Finished difference Result 4670 states and 13455 transitions. [2019-12-18 22:33:11,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:11,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:33:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:11,470 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:33:11,470 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:33:11,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:11,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:33:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:33:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:33:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13451 transitions. [2019-12-18 22:33:11,579 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13451 transitions. Word has length 65 [2019-12-18 22:33:11,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:11,580 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13451 transitions. [2019-12-18 22:33:11,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:11,580 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13451 transitions. [2019-12-18 22:33:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:11,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:11,591 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-18 22:33:11,591 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:11,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash -736030129, now seen corresponding path program 1 times [2019-12-18 22:33:11,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:11,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189561019] [2019-12-18 22:33:11,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:11,714 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-18 22:33:11,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189561019] [2019-12-18 22:33:11,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:11,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:33:11,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353376289] [2019-12-18 22:33:11,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:11,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:11,721 INFO L87 Difference]: Start difference. First operand 4666 states and 13451 transitions. Second operand 3 states. [2019-12-18 22:33:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:11,777 INFO L93 Difference]: Finished difference Result 4670 states and 13445 transitions. [2019-12-18 22:33:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:11,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:33:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:11,786 INFO L225 Difference]: With dead ends: 4670 [2019-12-18 22:33:11,786 INFO L226 Difference]: Without dead ends: 4670 [2019-12-18 22:33:11,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-18 22:33:11,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4666. [2019-12-18 22:33:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4666 states. [2019-12-18 22:33:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4666 states to 4666 states and 13441 transitions. [2019-12-18 22:33:11,877 INFO L78 Accepts]: Start accepts. Automaton has 4666 states and 13441 transitions. Word has length 65 [2019-12-18 22:33:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:11,877 INFO L462 AbstractCegarLoop]: Abstraction has 4666 states and 13441 transitions. [2019-12-18 22:33:11,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:11,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4666 states and 13441 transitions. [2019-12-18 22:33:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:12,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:12,570 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-18 22:33:12,572 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:12,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -743654703, now seen corresponding path program 1 times [2019-12-18 22:33:12,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:12,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599858346] [2019-12-18 22:33:12,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:12,690 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-18 22:33:12,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599858346] [2019-12-18 22:33:12,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:12,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:33:12,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304875356] [2019-12-18 22:33:12,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:33:12,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:12,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:33:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:12,694 INFO L87 Difference]: Start difference. First operand 4666 states and 13441 transitions. Second operand 5 states. [2019-12-18 22:33:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:13,039 INFO L93 Difference]: Finished difference Result 7090 states and 20230 transitions. [2019-12-18 22:33:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:33:13,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:33:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:13,052 INFO L225 Difference]: With dead ends: 7090 [2019-12-18 22:33:13,052 INFO L226 Difference]: Without dead ends: 7090 [2019-12-18 22:33:13,052 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-18 22:33:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7090 states. [2019-12-18 22:33:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7090 to 5981. [2019-12-18 22:33:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5981 states. [2019-12-18 22:33:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 17235 transitions. [2019-12-18 22:33:13,180 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 17235 transitions. Word has length 65 [2019-12-18 22:33:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:13,180 INFO L462 AbstractCegarLoop]: Abstraction has 5981 states and 17235 transitions. [2019-12-18 22:33:13,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:33:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 17235 transitions. [2019-12-18 22:33:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:13,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:13,192 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-18 22:33:13,192 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:13,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:13,193 INFO L82 PathProgramCache]: Analyzing trace with hash 326503145, now seen corresponding path program 2 times [2019-12-18 22:33:13,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:13,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733085399] [2019-12-18 22:33:13,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:13,295 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-18 22:33:13,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733085399] [2019-12-18 22:33:13,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:13,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:33:13,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029606051] [2019-12-18 22:33:13,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:33:13,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:13,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:33:13,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:33:13,298 INFO L87 Difference]: Start difference. First operand 5981 states and 17235 transitions. Second operand 5 states. [2019-12-18 22:33:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:13,626 INFO L93 Difference]: Finished difference Result 9069 states and 25840 transitions. [2019-12-18 22:33:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:33:13,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 22:33:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:13,640 INFO L225 Difference]: With dead ends: 9069 [2019-12-18 22:33:13,640 INFO L226 Difference]: Without dead ends: 9069 [2019-12-18 22:33:13,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:33:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9069 states. [2019-12-18 22:33:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9069 to 6733. [2019-12-18 22:33:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-12-18 22:33:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 19502 transitions. [2019-12-18 22:33:13,751 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 19502 transitions. Word has length 65 [2019-12-18 22:33:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:13,752 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 19502 transitions. [2019-12-18 22:33:13,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:33:13,752 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 19502 transitions. [2019-12-18 22:33:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:13,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:13,762 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-18 22:33:13,762 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:13,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:13,762 INFO L82 PathProgramCache]: Analyzing trace with hash 737396099, now seen corresponding path program 3 times [2019-12-18 22:33:13,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:13,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299005552] [2019-12-18 22:33:13,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:13,867 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-18 22:33:13,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299005552] [2019-12-18 22:33:13,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:13,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:33:13,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080354689] [2019-12-18 22:33:13,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:13,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:13,869 INFO L87 Difference]: Start difference. First operand 6733 states and 19502 transitions. Second operand 6 states. [2019-12-18 22:33:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:14,406 INFO L93 Difference]: Finished difference Result 10887 states and 31295 transitions. [2019-12-18 22:33:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:33:14,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 22:33:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:14,423 INFO L225 Difference]: With dead ends: 10887 [2019-12-18 22:33:14,423 INFO L226 Difference]: Without dead ends: 10887 [2019-12-18 22:33:14,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:33:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-18 22:33:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7256. [2019-12-18 22:33:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7256 states. [2019-12-18 22:33:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7256 states to 7256 states and 21081 transitions. [2019-12-18 22:33:14,614 INFO L78 Accepts]: Start accepts. Automaton has 7256 states and 21081 transitions. Word has length 65 [2019-12-18 22:33:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:14,615 INFO L462 AbstractCegarLoop]: Abstraction has 7256 states and 21081 transitions. [2019-12-18 22:33:14,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7256 states and 21081 transitions. [2019-12-18 22:33:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 22:33:14,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:14,630 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-18 22:33:14,631 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:14,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash 156309423, now seen corresponding path program 4 times [2019-12-18 22:33:14,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:14,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313050975] [2019-12-18 22:33:14,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:14,749 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-18 22:33:14,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313050975] [2019-12-18 22:33:14,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:14,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:14,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664348420] [2019-12-18 22:33:14,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:14,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:14,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:14,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:14,751 INFO L87 Difference]: Start difference. First operand 7256 states and 21081 transitions. Second operand 3 states. [2019-12-18 22:33:14,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:14,832 INFO L93 Difference]: Finished difference Result 7256 states and 21080 transitions. [2019-12-18 22:33:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:14,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 22:33:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:14,844 INFO L225 Difference]: With dead ends: 7256 [2019-12-18 22:33:14,844 INFO L226 Difference]: Without dead ends: 7256 [2019-12-18 22:33:14,844 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-18 22:33:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-18 22:33:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 4657. [2019-12-18 22:33:14,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4657 states. [2019-12-18 22:33:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4657 states to 4657 states and 13801 transitions. [2019-12-18 22:33:14,930 INFO L78 Accepts]: Start accepts. Automaton has 4657 states and 13801 transitions. Word has length 65 [2019-12-18 22:33:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:14,930 INFO L462 AbstractCegarLoop]: Abstraction has 4657 states and 13801 transitions. [2019-12-18 22:33:14,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4657 states and 13801 transitions. [2019-12-18 22:33:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:14,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:14,937 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-18 22:33:14,937 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:14,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:14,937 INFO L82 PathProgramCache]: Analyzing trace with hash 939416227, now seen corresponding path program 1 times [2019-12-18 22:33:14,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:14,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167084231] [2019-12-18 22:33:14,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:15,050 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-18 22:33:15,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167084231] [2019-12-18 22:33:15,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:15,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:33:15,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206618968] [2019-12-18 22:33:15,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:15,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:15,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:15,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:15,055 INFO L87 Difference]: Start difference. First operand 4657 states and 13801 transitions. Second operand 6 states. [2019-12-18 22:33:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:15,578 INFO L93 Difference]: Finished difference Result 7289 states and 21051 transitions. [2019-12-18 22:33:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:33:15,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 22:33:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:15,587 INFO L225 Difference]: With dead ends: 7289 [2019-12-18 22:33:15,587 INFO L226 Difference]: Without dead ends: 7289 [2019-12-18 22:33:15,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:33:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7289 states. [2019-12-18 22:33:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7289 to 4709. [2019-12-18 22:33:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4709 states. [2019-12-18 22:33:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 13956 transitions. [2019-12-18 22:33:15,660 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 13956 transitions. Word has length 66 [2019-12-18 22:33:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:15,660 INFO L462 AbstractCegarLoop]: Abstraction has 4709 states and 13956 transitions. [2019-12-18 22:33:15,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 13956 transitions. [2019-12-18 22:33:15,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:15,666 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:15,667 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-18 22:33:15,667 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:15,667 INFO L82 PathProgramCache]: Analyzing trace with hash -41621859, now seen corresponding path program 2 times [2019-12-18 22:33:15,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:15,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854350305] [2019-12-18 22:33:15,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:15,797 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-18 22:33:15,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854350305] [2019-12-18 22:33:15,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:15,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:33:15,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858561120] [2019-12-18 22:33:15,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:33:15,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:33:15,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:33:15,799 INFO L87 Difference]: Start difference. First operand 4709 states and 13956 transitions. Second operand 7 states. [2019-12-18 22:33:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:15,938 INFO L93 Difference]: Finished difference Result 9172 states and 27619 transitions. [2019-12-18 22:33:15,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:33:15,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 22:33:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:15,947 INFO L225 Difference]: With dead ends: 9172 [2019-12-18 22:33:15,948 INFO L226 Difference]: Without dead ends: 5716 [2019-12-18 22:33:15,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:33:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-12-18 22:33:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 4291. [2019-12-18 22:33:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4291 states. [2019-12-18 22:33:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4291 states to 4291 states and 12713 transitions. [2019-12-18 22:33:16,047 INFO L78 Accepts]: Start accepts. Automaton has 4291 states and 12713 transitions. Word has length 66 [2019-12-18 22:33:16,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:16,047 INFO L462 AbstractCegarLoop]: Abstraction has 4291 states and 12713 transitions. [2019-12-18 22:33:16,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:33:16,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4291 states and 12713 transitions. [2019-12-18 22:33:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 22:33:17,428 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:17,428 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-18 22:33:17,428 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:17,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1670533731, now seen corresponding path program 3 times [2019-12-18 22:33:17,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:17,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811786207] [2019-12-18 22:33:17,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:17,532 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-18 22:33:17,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811786207] [2019-12-18 22:33:17,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:17,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:17,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586564661] [2019-12-18 22:33:17,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:17,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:17,534 INFO L87 Difference]: Start difference. First operand 4291 states and 12713 transitions. Second operand 3 states. [2019-12-18 22:33:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:17,562 INFO L93 Difference]: Finished difference Result 3981 states and 11449 transitions. [2019-12-18 22:33:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:17,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 22:33:17,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:17,569 INFO L225 Difference]: With dead ends: 3981 [2019-12-18 22:33:17,570 INFO L226 Difference]: Without dead ends: 3981 [2019-12-18 22:33:17,570 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-18 22:33:17,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3981 states. [2019-12-18 22:33:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3981 to 3774. [2019-12-18 22:33:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-12-18 22:33:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 10861 transitions. [2019-12-18 22:33:17,646 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 10861 transitions. Word has length 66 [2019-12-18 22:33:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:17,647 INFO L462 AbstractCegarLoop]: Abstraction has 3774 states and 10861 transitions. [2019-12-18 22:33:17,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:17,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 10861 transitions. [2019-12-18 22:33:17,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:33:17,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:17,655 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-18 22:33:17,655 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1663442669, now seen corresponding path program 1 times [2019-12-18 22:33:17,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:17,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268623497] [2019-12-18 22:33:17,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:17,746 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-18 22:33:17,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268623497] [2019-12-18 22:33:17,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:17,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:33:17,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447988311] [2019-12-18 22:33:17,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:33:17,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:17,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:33:17,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:33:17,749 INFO L87 Difference]: Start difference. First operand 3774 states and 10861 transitions. Second operand 6 states. [2019-12-18 22:33:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:18,283 INFO L93 Difference]: Finished difference Result 6279 states and 17747 transitions. [2019-12-18 22:33:18,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 22:33:18,283 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 22:33:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:18,292 INFO L225 Difference]: With dead ends: 6279 [2019-12-18 22:33:18,292 INFO L226 Difference]: Without dead ends: 6279 [2019-12-18 22:33:18,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:33:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2019-12-18 22:33:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 3774. [2019-12-18 22:33:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3774 states. [2019-12-18 22:33:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 10861 transitions. [2019-12-18 22:33:18,359 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 10861 transitions. Word has length 67 [2019-12-18 22:33:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:18,359 INFO L462 AbstractCegarLoop]: Abstraction has 3774 states and 10861 transitions. [2019-12-18 22:33:18,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:33:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 10861 transitions. [2019-12-18 22:33:18,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 22:33:18,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:18,363 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-18 22:33:18,364 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:18,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:18,364 INFO L82 PathProgramCache]: Analyzing trace with hash -143740935, now seen corresponding path program 2 times [2019-12-18 22:33:18,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:18,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754592294] [2019-12-18 22:33:18,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:18,433 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-18 22:33:18,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754592294] [2019-12-18 22:33:18,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:18,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:33:18,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572268737] [2019-12-18 22:33:18,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:33:18,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:33:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:33:18,435 INFO L87 Difference]: Start difference. First operand 3774 states and 10861 transitions. Second operand 3 states. [2019-12-18 22:33:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:18,465 INFO L93 Difference]: Finished difference Result 3510 states and 9875 transitions. [2019-12-18 22:33:18,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:33:18,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 22:33:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:18,470 INFO L225 Difference]: With dead ends: 3510 [2019-12-18 22:33:18,470 INFO L226 Difference]: Without dead ends: 3510 [2019-12-18 22:33:18,470 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-18 22:33:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3510 states. [2019-12-18 22:33:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3510 to 2817. [2019-12-18 22:33:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-18 22:33:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7940 transitions. [2019-12-18 22:33:18,529 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7940 transitions. Word has length 67 [2019-12-18 22:33:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:18,529 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7940 transitions. [2019-12-18 22:33:18,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:33:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7940 transitions. [2019-12-18 22:33:18,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:33:18,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:18,533 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-18 22:33:18,534 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:18,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:18,534 INFO L82 PathProgramCache]: Analyzing trace with hash -539233385, now seen corresponding path program 1 times [2019-12-18 22:33:18,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:18,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942448686] [2019-12-18 22:33:18,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:33:18,748 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-18 22:33:18,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942448686] [2019-12-18 22:33:18,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:33:18,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 22:33:18,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429828128] [2019-12-18 22:33:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 22:33:18,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:33:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 22:33:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-18 22:33:18,751 INFO L87 Difference]: Start difference. First operand 2817 states and 7940 transitions. Second operand 13 states. [2019-12-18 22:33:19,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:33:19,615 INFO L93 Difference]: Finished difference Result 5022 states and 13962 transitions. [2019-12-18 22:33:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 22:33:19,615 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 22:33:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:33:19,622 INFO L225 Difference]: With dead ends: 5022 [2019-12-18 22:33:19,622 INFO L226 Difference]: Without dead ends: 4990 [2019-12-18 22:33:19,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=695, Unknown=0, NotChecked=0, Total=870 [2019-12-18 22:33:19,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4990 states. [2019-12-18 22:33:19,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4990 to 4069. [2019-12-18 22:33:19,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-18 22:33:19,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 11326 transitions. [2019-12-18 22:33:19,674 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 11326 transitions. Word has length 68 [2019-12-18 22:33:19,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:33:19,674 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 11326 transitions. [2019-12-18 22:33:19,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 22:33:19,674 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 11326 transitions. [2019-12-18 22:33:19,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 22:33:19,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:33:19,678 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-18 22:33:19,678 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:33:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:33:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash -691349817, now seen corresponding path program 2 times [2019-12-18 22:33:19,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:33:19,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409322627] [2019-12-18 22:33:19,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:33:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:33:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:33:19,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:33:19,794 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:33:19,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_57| 0 0))) (and (= v_~z$w_buff0_used~0_115 0) (= 0 v_~z$r_buff1_thd0~0_47) (= v_~main$tmp_guard0~0_10 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2037~0.base_21| 4) |v_#length_25|) (= |v_#valid_55| (store .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21| 1)) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z~0_28 0) (= v_~z$r_buff0_thd3~0_20 0) (= 0 v_~z$w_buff0~0_27) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~z$flush_delayed~0_14) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21|) |v_ULTIMATE.start_main_~#t2037~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t2037~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21|)) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t2037~0.base_21|) (= v_~x~0_12 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~weak$$choice2~0_31) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 |v_#NULL.base_5|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_13|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_20|, ~x~0=v_~x~0_12, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_~#t2037~0.base=|v_ULTIMATE.start_main_~#t2037~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_47, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_115, ~z$w_buff0~0=v_~z$w_buff0~0_27, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_28, ULTIMATE.start_main_~#t2037~0.offset=|v_ULTIMATE.start_main_~#t2037~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2038~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2039~0.base, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2037~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t2037~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:33:19,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2038~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t2038~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2038~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12|) |v_ULTIMATE.start_main_~#t2038~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t2038~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2038~0.base, #length] because there is no mapped edge [2019-12-18 22:33:19,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_60 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_17) (= v_~z$w_buff0~0_18 v_~z$w_buff1~0_18) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_93 v_~z$w_buff1_used~0_60) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_92 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_93, ~z$w_buff0~0=v_~z$w_buff0~0_18, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_92, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_60, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_18, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 22:33:19,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2039~0.base_9| 4)) (= 0 |v_ULTIMATE.start_main_~#t2039~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2039~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9|) |v_ULTIMATE.start_main_~#t2039~0.offset_8| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t2039~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_8|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2039~0.base] because there is no mapped edge [2019-12-18 22:33:19,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1490030648 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1490030648 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1490030648| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1490030648| ~z$w_buff0_used~0_In-1490030648) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1490030648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1490030648} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1490030648|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1490030648, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1490030648} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:33:19,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd1~0_In200204442 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In200204442 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In200204442 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In200204442 256)))) (or (and (= ~z$w_buff1_used~0_In200204442 |P0Thread1of1ForFork0_#t~ite6_Out200204442|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out200204442|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In200204442, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In200204442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In200204442, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In200204442} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out200204442|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In200204442, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In200204442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In200204442, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In200204442} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:33:19,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1602511706 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1602511706 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd1~0_Out-1602511706)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1602511706 ~z$r_buff0_thd1~0_Out-1602511706)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1602511706, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1602511706} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1602511706, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1602511706|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1602511706} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 22:33:19,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In275261968 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In275261968 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In275261968 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In275261968 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In275261968 |P0Thread1of1ForFork0_#t~ite8_Out275261968|) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out275261968| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In275261968, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In275261968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275261968, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In275261968} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In275261968, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out275261968|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In275261968, ~z$w_buff1_used~0=~z$w_buff1_used~0_In275261968, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In275261968} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:33:19,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L746-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 22:33:19,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In941483874 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In941483874 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out941483874| |P1Thread1of1ForFork1_#t~ite10_Out941483874|))) (or (and (or .cse0 .cse1) (= ~z~0_In941483874 |P1Thread1of1ForFork1_#t~ite9_Out941483874|) .cse2) (and (not .cse1) (= ~z$w_buff1~0_In941483874 |P1Thread1of1ForFork1_#t~ite9_Out941483874|) (not .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In941483874, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941483874, ~z$w_buff1~0=~z$w_buff1~0_In941483874, ~z~0=~z~0_In941483874} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out941483874|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In941483874, ~z$w_buff1_used~0=~z$w_buff1_used~0_In941483874, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out941483874|, ~z$w_buff1~0=~z$w_buff1~0_In941483874, ~z~0=~z~0_In941483874} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 22:33:19,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In43446851 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In43446851 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In43446851 |P2Thread1of1ForFork2_#t~ite15_Out43446851|)) (and (= ~z$w_buff1~0_In43446851 |P2Thread1of1ForFork2_#t~ite15_Out43446851|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In43446851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43446851, ~z$w_buff1~0=~z$w_buff1~0_In43446851, ~z~0=~z~0_In43446851} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out43446851|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In43446851, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43446851, ~z$w_buff1~0=~z$w_buff1~0_In43446851, ~z~0=~z~0_In43446851} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 22:33:19,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_17, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 22:33:19,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1460266905 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1460266905 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1460266905| ~z$w_buff0_used~0_In-1460266905) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-1460266905| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460266905, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1460266905} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1460266905, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1460266905, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1460266905|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 22:33:19,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-93260049 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-93260049 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-93260049 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-93260049 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out-93260049| ~z$w_buff1_used~0_In-93260049)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out-93260049| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-93260049, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-93260049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93260049, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-93260049} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-93260049, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-93260049, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-93260049, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-93260049, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-93260049|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 22:33:19,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-387714717 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-387714717 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-387714717| ~z$r_buff0_thd3~0_In-387714717) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-387714717| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-387714717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-387714717} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-387714717, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-387714717, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-387714717|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 22:33:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In1725348502 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1725348502 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1725348502 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1725348502 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite20_Out1725348502| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite20_Out1725348502| ~z$r_buff1_thd3~0_In1725348502)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1725348502, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1725348502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1725348502, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1725348502} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1725348502, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1725348502|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1725348502, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1725348502, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1725348502} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 22:33:19,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_13) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_13, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 22:33:19,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In704949611 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In704949611 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out704949611|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In704949611 |P1Thread1of1ForFork1_#t~ite11_Out704949611|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In704949611, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In704949611} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In704949611, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out704949611|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In704949611} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 22:33:19,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-316080052 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-316080052 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-316080052 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-316080052 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-316080052 |P1Thread1of1ForFork1_#t~ite12_Out-316080052|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-316080052|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-316080052, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-316080052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316080052, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-316080052} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-316080052, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-316080052, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-316080052, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-316080052|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-316080052} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 22:33:19,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1940448762 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1940448762 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1940448762|)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1940448762| ~z$r_buff0_thd2~0_In-1940448762) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940448762, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940448762} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1940448762, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1940448762|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1940448762} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 22:33:19,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1093471932 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1093471932 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1093471932 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1093471932 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In1093471932 |P1Thread1of1ForFork1_#t~ite14_Out1093471932|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1093471932|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1093471932, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1093471932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1093471932, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1093471932} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1093471932, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1093471932, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1093471932, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1093471932|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1093471932} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 22:33:19,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork1_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:33:19,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 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_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:33:19,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-1005978191| |ULTIMATE.start_main_#t~ite24_Out-1005978191|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1005978191 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1005978191 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In-1005978191 |ULTIMATE.start_main_#t~ite24_Out-1005978191|)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff1~0_In-1005978191 |ULTIMATE.start_main_#t~ite24_Out-1005978191|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1005978191, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1005978191, ~z$w_buff1~0=~z$w_buff1~0_In-1005978191, ~z~0=~z~0_In-1005978191} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1005978191, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1005978191|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1005978191, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1005978191|, ~z$w_buff1~0=~z$w_buff1~0_In-1005978191, ~z~0=~z~0_In-1005978191} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 22:33:19,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2139141825 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2139141825 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out2139141825| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out2139141825| ~z$w_buff0_used~0_In2139141825)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139141825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139141825} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2139141825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2139141825, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2139141825|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 22:33:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In1818226652 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1818226652 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1818226652 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1818226652 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1818226652|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1818226652 |ULTIMATE.start_main_#t~ite27_Out1818226652|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1818226652, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1818226652, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1818226652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1818226652} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1818226652, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1818226652, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1818226652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1818226652, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1818226652|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 22:33:19,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1393330227 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1393330227 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out-1393330227|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-1393330227 |ULTIMATE.start_main_#t~ite28_Out-1393330227|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393330227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393330227} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1393330227, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1393330227|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1393330227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 22:33:19,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-794976988 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-794976988 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-794976988 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-794976988 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-794976988 |ULTIMATE.start_main_#t~ite29_Out-794976988|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out-794976988| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-794976988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-794976988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-794976988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-794976988} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-794976988, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-794976988|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-794976988, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-794976988, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-794976988} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 22:33:19,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~z$r_buff0_thd0~0_55 v_~z$r_buff0_thd0~0_54)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_55, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_54, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_21} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 22:33:19,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L834-->L837-1: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 22:33:19,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} 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_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 22:33:19,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:33:19 BasicIcfg [2019-12-18 22:33:19,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:33:19,928 INFO L168 Benchmark]: Toolchain (without parser) took 98566.30 ms. Allocated memory was 143.7 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 100.2 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 825.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,931 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:33:19,933 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.86 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 154.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,933 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.52 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,933 INFO L168 Benchmark]: Boogie Preprocessor took 39.58 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,934 INFO L168 Benchmark]: RCFGBuilder took 816.74 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 98.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,934 INFO L168 Benchmark]: TraceAbstraction took 96833.63 ms. Allocated memory was 200.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 766.9 MB. Max. memory is 7.1 GB. [2019-12-18 22:33:19,940 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.45 ms. Allocated memory is still 143.7 MB. Free memory is still 119.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.86 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 100.2 MB in the beginning and 154.1 MB in the end (delta: -53.9 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.52 ms. Allocated memory is still 200.8 MB. Free memory was 154.1 MB in the beginning and 151.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.58 ms. Allocated memory is still 200.8 MB. Free memory was 151.2 MB in the beginning and 149.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 816.74 ms. Allocated memory is still 200.8 MB. Free memory was 149.2 MB in the beginning and 98.3 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 96833.63 ms. Allocated memory was 200.8 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 98.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 766.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 174 ProgramPointsBefore, 96 ProgramPointsAfterwards, 211 TransitionsBefore, 109 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 28 ChoiceCompositions, 5870 VarBasedMoverChecksPositive, 189 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81758 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2946 SDtfs, 2441 SDslu, 5637 SDs, 0 SdLazy, 3207 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 33 SyntacticMatches, 14 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205075occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 43.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 84094 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 979 NumberOfCodeBlocks, 979 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 892 ConstructedInterpolants, 0 QuantifiedInterpolants, 181874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...