/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/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:45:03,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:45:03,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:45:03,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:45:03,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:45:03,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:45:03,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:45:03,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:45:03,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:45:03,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:45:03,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:45:03,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:45:03,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:45:03,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:45:03,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:45:03,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:45:03,140 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:45:03,141 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:45:03,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:45:03,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:45:03,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:45:03,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:45:03,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:45:03,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:45:03,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:45:03,158 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:45:03,158 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:45:03,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:45:03,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:45:03,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:45:03,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:45:03,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:45:03,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:45:03,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:45:03,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:45:03,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:45:03,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:45:03,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:45:03,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:45:03,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:45:03,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:45:03,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:45:03,182 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:45:03,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:45:03,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:45:03,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:45:03,184 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:45:03,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:45:03,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:45:03,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:45:03,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:45:03,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:45:03,186 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:45:03,186 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:45:03,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:45:03,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:45:03,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:45:03,187 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:45:03,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:45:03,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:45:03,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:45:03,188 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:45:03,188 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:45:03,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:45:03,188 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:45:03,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:45:03,189 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:45:03,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:45:03,482 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:45:03,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:45:03,487 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:45:03,487 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:45:03,488 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2019-12-27 07:45:03,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e29162e89/5ab8dce87a3a4d75a56d91b21e1b6d23/FLAG38e724d59 [2019-12-27 07:45:04,121 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:45:04,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2019-12-27 07:45:04,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e29162e89/5ab8dce87a3a4d75a56d91b21e1b6d23/FLAG38e724d59 [2019-12-27 07:45:04,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e29162e89/5ab8dce87a3a4d75a56d91b21e1b6d23 [2019-12-27 07:45:04,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:45:04,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:45:04,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:04,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:45:04,480 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:45:04,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:04" (1/1) ... [2019-12-27 07:45:04,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc34d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:04, skipping insertion in model container [2019-12-27 07:45:04,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:45:04" (1/1) ... [2019-12-27 07:45:04,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:45:04,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:45:05,007 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:05,019 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:45:05,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:45:05,181 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:45:05,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05 WrapperNode [2019-12-27 07:45:05,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:45:05,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:05,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:45:05,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:45:05,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:45:05,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:45:05,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:45:05,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:45:05,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... [2019-12-27 07:45:05,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:45:05,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:45:05,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:45:05,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:45:05,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:45:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:45:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:45:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:45:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:45:05,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:45:05,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:45:05,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:45:05,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:45:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 07:45:05,375 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 07:45:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:45:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:45:05,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:45:05,377 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:45:06,140 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:45:06,140 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:45:06,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:06 BoogieIcfgContainer [2019-12-27 07:45:06,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:45:06,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:45:06,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:45:06,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:45:06,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:45:04" (1/3) ... [2019-12-27 07:45:06,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2de4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:06, skipping insertion in model container [2019-12-27 07:45:06,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:45:05" (2/3) ... [2019-12-27 07:45:06,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2de4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:45:06, skipping insertion in model container [2019-12-27 07:45:06,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:45:06" (3/3) ... [2019-12-27 07:45:06,154 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2019-12-27 07:45:06,162 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:45:06,162 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:45:06,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:45:06,170 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:45:06,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,207 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,208 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,233 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,233 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,240 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,240 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,250 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,251 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,253 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,254 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,257 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,257 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,258 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,259 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:45:06,270 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 07:45:06,286 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:45:06,286 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:45:06,286 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:45:06,286 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:45:06,286 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:45:06,287 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:45:06,287 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:45:06,287 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:45:06,304 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 07:45:06,306 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:06,412 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:06,412 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:06,429 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:06,457 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 07:45:06,512 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 07:45:06,512 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:45:06,520 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 07:45:06,541 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 07:45:06,542 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:45:10,070 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:45:10,188 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:45:10,216 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 07:45:10,216 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 07:45:10,220 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 07:45:28,622 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 07:45:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 07:45:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:45:28,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:28,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:45:28,631 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 07:45:28,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:28,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918403064] [2019-12-27 07:45:28,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:45:28,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918403064] [2019-12-27 07:45:28,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:28,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:45:28,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756696405] [2019-12-27 07:45:28,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:45:28,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:28,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:45:28,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:45:28,960 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 07:45:32,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:32,604 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 07:45:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:45:32,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:45:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:33,440 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 07:45:33,440 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 07:45:33,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:45:40,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 07:45:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 07:45:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 07:45:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 07:45:46,394 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 07:45:46,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:45:46,394 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 07:45:46,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:45:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 07:45:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:45:46,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:45:46,399 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:45:46,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:45:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:45:46,400 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 07:45:46,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:45:46,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387422776] [2019-12-27 07:45:46,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:45:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:45:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:45:46,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387422776] [2019-12-27 07:45:46,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:45:46,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:45:46,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009552555] [2019-12-27 07:45:46,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:45:46,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:45:46,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:45:46,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:45:46,482 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 07:45:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:45:52,071 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 07:45:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:45:52,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:45:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:45:52,857 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 07:45:52,857 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 07:45:52,858 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-27 07:45:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 07:46:02,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 07:46:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 07:46:02,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 07:46:02,575 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 07:46:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:02,575 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 07:46:02,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:02,575 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 07:46:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:02,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:02,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:02,581 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:02,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:02,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 07:46:02,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:02,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592775398] [2019-12-27 07:46:02,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:02,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592775398] [2019-12-27 07:46:02,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:02,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:02,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285481923] [2019-12-27 07:46:02,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:02,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:02,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:02,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:02,666 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 07:46:02,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:02,793 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 07:46:02,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:02,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 07:46:02,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:02,847 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 07:46:02,848 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 07:46:02,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 07:46:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 07:46:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 07:46:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 07:46:08,579 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 07:46:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:08,579 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 07:46:08,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 07:46:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 07:46:08,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:08,581 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:08,581 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 07:46:08,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:08,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503123015] [2019-12-27 07:46:08,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:08,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503123015] [2019-12-27 07:46:08,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:08,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:08,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265140330] [2019-12-27 07:46:08,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:08,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:08,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:08,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:08,661 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 07:46:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:09,109 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 07:46:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:09,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 07:46:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:09,177 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 07:46:09,177 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 07:46:09,178 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-27 07:46:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 07:46:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 07:46:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 07:46:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 07:46:10,448 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 07:46:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:10,448 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 07:46:10,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:10,449 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 07:46:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 07:46:10,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:10,452 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:10,453 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:10,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 07:46:10,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:10,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118378284] [2019-12-27 07:46:10,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:10,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118378284] [2019-12-27 07:46:10,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:10,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:10,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618990855] [2019-12-27 07:46:10,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:10,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:10,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:10,563 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 5 states. [2019-12-27 07:46:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:11,371 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 07:46:11,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:11,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 07:46:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:11,462 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 07:46:11,462 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 07:46:11,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:11,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 07:46:12,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 07:46:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 07:46:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 07:46:12,219 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 07:46:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:12,220 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 07:46:12,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 07:46:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:46:12,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:12,232 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:12,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:12,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:12,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 07:46:12,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:12,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897686405] [2019-12-27 07:46:12,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:12,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897686405] [2019-12-27 07:46:12,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:12,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:12,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971938646] [2019-12-27 07:46:12,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:46:12,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:46:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:12,308 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 4 states. [2019-12-27 07:46:12,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:12,352 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 07:46:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:46:12,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 07:46:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:12,365 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 07:46:12,365 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 07:46:12,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:46:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 07:46:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 07:46:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 07:46:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 07:46:12,472 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 07:46:12,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:12,472 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 07:46:12,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:46:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 07:46:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:46:12,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:12,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:12,485 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:12,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 07:46:12,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:12,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686795008] [2019-12-27 07:46:12,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:12,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:12,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686795008] [2019-12-27 07:46:12,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:12,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:46:12,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129774400] [2019-12-27 07:46:12,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:12,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:12,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:12,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:12,590 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 5 states. [2019-12-27 07:46:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:12,633 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 07:46:12,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:46:12,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:46:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:12,640 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 07:46:12,641 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 07:46:12,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 07:46:12,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 07:46:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 07:46:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 07:46:12,715 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 07:46:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:12,715 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 07:46:12,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 07:46:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:12,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:12,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:12,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:12,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:12,724 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 07:46:12,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:12,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920835792] [2019-12-27 07:46:12,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:12,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920835792] [2019-12-27 07:46:12,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:12,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:46:12,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240659730] [2019-12-27 07:46:12,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:12,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:12,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:12,810 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 07:46:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:12,872 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 07:46:12,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:12,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:12,879 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 07:46:12,880 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 07:46:12,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 07:46:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 07:46:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 07:46:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 07:46:13,116 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 07:46:13,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:13,118 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 07:46:13,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:13,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 07:46:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:13,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:13,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:13,126 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 07:46:13,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:13,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396348482] [2019-12-27 07:46:13,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:13,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396348482] [2019-12-27 07:46:13,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:46:13,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863610000] [2019-12-27 07:46:13,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:13,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:13,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:13,294 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 5 states. [2019-12-27 07:46:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:13,624 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 07:46:13,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:46:13,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 07:46:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:13,636 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 07:46:13,636 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 07:46:13,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 07:46:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 07:46:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 07:46:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 07:46:13,727 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 07:46:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:13,727 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 07:46:13,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 07:46:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:13,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:13,736 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:13,737 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 07:46:13,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:13,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050492978] [2019-12-27 07:46:13,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:13,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050492978] [2019-12-27 07:46:13,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:13,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:13,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856028817] [2019-12-27 07:46:13,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:13,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:13,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:13,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:13,866 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 6 states. [2019-12-27 07:46:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:14,360 INFO L93 Difference]: Finished difference Result 10887 states and 31211 transitions. [2019-12-27 07:46:14,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:46:14,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 07:46:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:14,379 INFO L225 Difference]: With dead ends: 10887 [2019-12-27 07:46:14,379 INFO L226 Difference]: Without dead ends: 10887 [2019-12-27 07:46:14,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2019-12-27 07:46:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 7014. [2019-12-27 07:46:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 07:46:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20308 transitions. [2019-12-27 07:46:14,559 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20308 transitions. Word has length 65 [2019-12-27 07:46:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:14,560 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20308 transitions. [2019-12-27 07:46:14,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20308 transitions. [2019-12-27 07:46:14,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:14,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:14,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-27 07:46:14,570 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:14,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:14,571 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 07:46:14,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:14,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122094151] [2019-12-27 07:46:14,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:14,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122094151] [2019-12-27 07:46:14,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:14,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:46:14,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411900847] [2019-12-27 07:46:14,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:46:14,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:46:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:46:14,729 INFO L87 Difference]: Start difference. First operand 7014 states and 20308 transitions. Second operand 7 states. [2019-12-27 07:46:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:15,577 INFO L93 Difference]: Finished difference Result 10694 states and 30653 transitions. [2019-12-27 07:46:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 07:46:15,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 07:46:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:15,591 INFO L225 Difference]: With dead ends: 10694 [2019-12-27 07:46:15,591 INFO L226 Difference]: Without dead ends: 10694 [2019-12-27 07:46:15,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 07:46:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10694 states. [2019-12-27 07:46:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10694 to 6618. [2019-12-27 07:46:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6618 states. [2019-12-27 07:46:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 19145 transitions. [2019-12-27 07:46:15,706 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 19145 transitions. Word has length 65 [2019-12-27 07:46:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:15,706 INFO L462 AbstractCegarLoop]: Abstraction has 6618 states and 19145 transitions. [2019-12-27 07:46:15,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:46:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 19145 transitions. [2019-12-27 07:46:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 07:46:15,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:15,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:15,716 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:15,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:15,716 INFO L82 PathProgramCache]: Analyzing trace with hash 976501587, now seen corresponding path program 4 times [2019-12-27 07:46:15,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:15,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356754557] [2019-12-27 07:46:15,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:15,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:15,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356754557] [2019-12-27 07:46:15,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:15,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:15,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281591593] [2019-12-27 07:46:15,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:15,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:15,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:15,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:15,791 INFO L87 Difference]: Start difference. First operand 6618 states and 19145 transitions. Second operand 3 states. [2019-12-27 07:46:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:15,822 INFO L93 Difference]: Finished difference Result 5982 states and 16989 transitions. [2019-12-27 07:46:15,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:15,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 07:46:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:15,831 INFO L225 Difference]: With dead ends: 5982 [2019-12-27 07:46:15,832 INFO L226 Difference]: Without dead ends: 5982 [2019-12-27 07:46:15,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2019-12-27 07:46:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5826. [2019-12-27 07:46:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-27 07:46:15,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 16559 transitions. [2019-12-27 07:46:15,941 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 16559 transitions. Word has length 65 [2019-12-27 07:46:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:15,942 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 16559 transitions. [2019-12-27 07:46:15,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:15,942 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 16559 transitions. [2019-12-27 07:46:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:15,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:15,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:15,954 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:15,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 523000800, now seen corresponding path program 1 times [2019-12-27 07:46:15,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:15,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201852104] [2019-12-27 07:46:15,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:16,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201852104] [2019-12-27 07:46:16,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:16,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:46:16,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700812054] [2019-12-27 07:46:16,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:46:16,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:46:16,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:46:16,055 INFO L87 Difference]: Start difference. First operand 5826 states and 16559 transitions. Second operand 5 states. [2019-12-27 07:46:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:16,367 INFO L93 Difference]: Finished difference Result 8401 states and 23634 transitions. [2019-12-27 07:46:16,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:46:16,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 07:46:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:16,379 INFO L225 Difference]: With dead ends: 8401 [2019-12-27 07:46:16,379 INFO L226 Difference]: Without dead ends: 8401 [2019-12-27 07:46:16,379 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-27 07:46:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8401 states. [2019-12-27 07:46:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8401 to 6174. [2019-12-27 07:46:16,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2019-12-27 07:46:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 17592 transitions. [2019-12-27 07:46:16,475 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 17592 transitions. Word has length 66 [2019-12-27 07:46:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:16,476 INFO L462 AbstractCegarLoop]: Abstraction has 6174 states and 17592 transitions. [2019-12-27 07:46:16,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:46:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 17592 transitions. [2019-12-27 07:46:16,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:16,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:16,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:16,484 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:16,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1977715684, now seen corresponding path program 2 times [2019-12-27 07:46:16,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:16,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455796991] [2019-12-27 07:46:16,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:16,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455796991] [2019-12-27 07:46:16,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:16,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:46:16,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513890596] [2019-12-27 07:46:16,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:46:16,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:46:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:46:16,607 INFO L87 Difference]: Start difference. First operand 6174 states and 17592 transitions. Second operand 6 states. [2019-12-27 07:46:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:17,193 INFO L93 Difference]: Finished difference Result 8758 states and 24598 transitions. [2019-12-27 07:46:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 07:46:17,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 07:46:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:17,207 INFO L225 Difference]: With dead ends: 8758 [2019-12-27 07:46:17,207 INFO L226 Difference]: Without dead ends: 8758 [2019-12-27 07:46:17,209 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-27 07:46:17,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8758 states. [2019-12-27 07:46:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8758 to 6363. [2019-12-27 07:46:17,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6363 states. [2019-12-27 07:46:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 18148 transitions. [2019-12-27 07:46:17,327 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 18148 transitions. Word has length 66 [2019-12-27 07:46:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:17,327 INFO L462 AbstractCegarLoop]: Abstraction has 6363 states and 18148 transitions. [2019-12-27 07:46:17,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:46:17,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 18148 transitions. [2019-12-27 07:46:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:17,336 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:17,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:17,337 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1574627286, now seen corresponding path program 3 times [2019-12-27 07:46:17,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:17,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878047474] [2019-12-27 07:46:17,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:17,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878047474] [2019-12-27 07:46:17,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:17,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:46:17,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526544031] [2019-12-27 07:46:17,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:46:17,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:17,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:46:17,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:46:17,498 INFO L87 Difference]: Start difference. First operand 6363 states and 18148 transitions. Second operand 9 states. [2019-12-27 07:46:17,804 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-12-27 07:46:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:18,853 INFO L93 Difference]: Finished difference Result 13483 states and 38530 transitions. [2019-12-27 07:46:18,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 07:46:18,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 07:46:18,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:18,871 INFO L225 Difference]: With dead ends: 13483 [2019-12-27 07:46:18,871 INFO L226 Difference]: Without dead ends: 13483 [2019-12-27 07:46:18,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:46:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13483 states. [2019-12-27 07:46:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13483 to 6627. [2019-12-27 07:46:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6627 states. [2019-12-27 07:46:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 18998 transitions. [2019-12-27 07:46:18,999 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 18998 transitions. Word has length 66 [2019-12-27 07:46:19,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:19,000 INFO L462 AbstractCegarLoop]: Abstraction has 6627 states and 18998 transitions. [2019-12-27 07:46:19,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:46:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 18998 transitions. [2019-12-27 07:46:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 07:46:19,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:19,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:19,007 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:46:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1781036024, now seen corresponding path program 4 times [2019-12-27 07:46:19,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:19,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676895938] [2019-12-27 07:46:19,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:19,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676895938] [2019-12-27 07:46:19,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:19,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:19,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011861364] [2019-12-27 07:46:19,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:19,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:19,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:19,080 INFO L87 Difference]: Start difference. First operand 6627 states and 18998 transitions. Second operand 3 states. [2019-12-27 07:46:19,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:19,147 INFO L93 Difference]: Finished difference Result 6627 states and 18997 transitions. [2019-12-27 07:46:19,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:19,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 07:46:19,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:19,157 INFO L225 Difference]: With dead ends: 6627 [2019-12-27 07:46:19,157 INFO L226 Difference]: Without dead ends: 6627 [2019-12-27 07:46:19,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2019-12-27 07:46:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 4034. [2019-12-27 07:46:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-27 07:46:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 11701 transitions. [2019-12-27 07:46:19,229 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 11701 transitions. Word has length 66 [2019-12-27 07:46:19,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:19,230 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 11701 transitions. [2019-12-27 07:46:19,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 11701 transitions. [2019-12-27 07:46:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 07:46:19,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:19,234 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:19,234 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-27 07:46:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1372470305, now seen corresponding path program 1 times [2019-12-27 07:46:19,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:19,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427164017] [2019-12-27 07:46:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:19,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427164017] [2019-12-27 07:46:19,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:19,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:46:19,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096688491] [2019-12-27 07:46:19,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:46:19,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:46:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:19,308 INFO L87 Difference]: Start difference. First operand 4034 states and 11701 transitions. Second operand 3 states. [2019-12-27 07:46:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:19,334 INFO L93 Difference]: Finished difference Result 3724 states and 10546 transitions. [2019-12-27 07:46:19,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:46:19,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 07:46:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:19,340 INFO L225 Difference]: With dead ends: 3724 [2019-12-27 07:46:19,340 INFO L226 Difference]: Without dead ends: 3724 [2019-12-27 07:46:19,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:46:19,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2019-12-27 07:46:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 2990. [2019-12-27 07:46:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 07:46:19,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 07:46:19,404 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 07:46:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:19,405 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 07:46:19,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:46:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 07:46:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:46:19,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:19,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:19,409 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-27 07:46:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:19,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 07:46:19,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:19,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34475467] [2019-12-27 07:46:19,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:46:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:46:19,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34475467] [2019-12-27 07:46:19,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:46:19,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:46:19,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492121014] [2019-12-27 07:46:19,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:46:19,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:46:19,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:46:19,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:46:19,752 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 15 states. [2019-12-27 07:46:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:46:20,529 INFO L93 Difference]: Finished difference Result 5799 states and 16480 transitions. [2019-12-27 07:46:20,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 07:46:20,530 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 07:46:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:46:20,539 INFO L225 Difference]: With dead ends: 5799 [2019-12-27 07:46:20,539 INFO L226 Difference]: Without dead ends: 5766 [2019-12-27 07:46:20,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-27 07:46:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2019-12-27 07:46:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 4145. [2019-12-27 07:46:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 07:46:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 07:46:20,628 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 07:46:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:46:20,628 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 07:46:20,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:46:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 07:46:20,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 07:46:20,632 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:46:20,632 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:46:20,632 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-27 07:46:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:46:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 2 times [2019-12-27 07:46:20,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:46:20,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573080645] [2019-12-27 07:46:20,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:46:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:46:20,745 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:46:20,745 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:46:20,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2177~0.base_27|)) (= v_~y$w_buff0_used~0_123 0) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2177~0.base_27|) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1_used~0_75 0) (= v_~y~0_30 0) (= v_~x~0_13 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2177~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2177~0.base_27|) |v_ULTIMATE.start_main_~#t2177~0.offset_20| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 |v_ULTIMATE.start_main_~#t2177~0.offset_20|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2177~0.base_27| 1) |v_#valid_63|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2177~0.base_27| 4) |v_#length_25|) (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #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_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_~#t2179~0.base=|v_ULTIMATE.start_main_~#t2179~0.base_19|, 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|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2178~0.offset=|v_ULTIMATE.start_main_~#t2178~0.offset_18|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t2179~0.offset=|v_ULTIMATE.start_main_~#t2179~0.offset_16|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~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_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t2177~0.base=|v_ULTIMATE.start_main_~#t2177~0.base_27|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, 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_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, ULTIMATE.start_main_~#t2177~0.offset=|v_ULTIMATE.start_main_~#t2177~0.offset_20|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_~#t2178~0.base=|v_ULTIMATE.start_main_~#t2178~0.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2179~0.base, 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, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2178~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t2179~0.offset, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2177~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t2177~0.offset, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t2178~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:20,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= |v_ULTIMATE.start_main_~#t2178~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2178~0.base_11| 4)) (not (= |v_ULTIMATE.start_main_~#t2178~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2178~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2178~0.base_11|) |v_ULTIMATE.start_main_~#t2178~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2178~0.base_11|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2178~0.base_11|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2178~0.base_11| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2178~0.base=|v_ULTIMATE.start_main_~#t2178~0.base_11|, ULTIMATE.start_main_~#t2178~0.offset=|v_ULTIMATE.start_main_~#t2178~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2178~0.base, ULTIMATE.start_main_~#t2178~0.offset] because there is no mapped edge [2019-12-27 07:46:20,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, 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, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:46:20,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2179~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2179~0.base_13|) |v_ULTIMATE.start_main_~#t2179~0.offset_11| 2)) |v_#memory_int_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2179~0.base_13|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2179~0.base_13| 1) |v_#valid_39|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2179~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2179~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2179~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2179~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2179~0.base=|v_ULTIMATE.start_main_~#t2179~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2179~0.offset=|v_ULTIMATE.start_main_~#t2179~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2179~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2179~0.offset, #length] because there is no mapped edge [2019-12-27 07:46:20,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1036318483 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1036318483 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1036318483|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1036318483 |P0Thread1of1ForFork0_#t~ite5_Out1036318483|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1036318483, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1036318483} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1036318483|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1036318483, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1036318483} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:46:20,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1334088806 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1334088806 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1334088806| ~y~0_In-1334088806) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-1334088806 |P1Thread1of1ForFork1_#t~ite9_Out-1334088806|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1334088806, ~y$w_buff1~0=~y$w_buff1~0_In-1334088806, ~y~0=~y~0_In-1334088806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1334088806} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1334088806, ~y$w_buff1~0=~y$w_buff1~0_In-1334088806, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1334088806|, ~y~0=~y~0_In-1334088806, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1334088806} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 07:46:20,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-780787347 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-780787347 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-780787347 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-780787347 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-780787347| 0)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-780787347 |P0Thread1of1ForFork0_#t~ite6_Out-780787347|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-780787347, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-780787347, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-780787347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-780787347} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-780787347|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-780787347, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-780787347, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-780787347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-780787347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:46:20,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-481068780 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-481068780 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-481068780) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out-481068780 ~y$r_buff0_thd1~0_In-481068780)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-481068780, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-481068780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-481068780, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-481068780|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-481068780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 07:46:20,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-146494094 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-146494094 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-146494094 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-146494094 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-146494094| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-146494094| ~y$r_buff1_thd1~0_In-146494094) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-146494094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-146494094, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-146494094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-146494094} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-146494094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-146494094, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-146494094|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-146494094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-146494094} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:46:20,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-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_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:46:20,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-600057084 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-600057084 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-600057084| ~y$w_buff1~0_In-600057084) (not .cse0) (not .cse1)) (and (= ~y~0_In-600057084 |P2Thread1of1ForFork2_#t~ite15_Out-600057084|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-600057084, ~y$w_buff1~0=~y$w_buff1~0_In-600057084, ~y~0=~y~0_In-600057084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600057084} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-600057084, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-600057084|, ~y$w_buff1~0=~y$w_buff1~0_In-600057084, ~y~0=~y~0_In-600057084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-600057084} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 07:46:20,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 07:46:20,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 07:46:20,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1641747837 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1641747837 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1641747837| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1641747837| ~y$w_buff0_used~0_In-1641747837)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1641747837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1641747837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1641747837, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1641747837, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1641747837|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:46:20,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-749259300 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-749259300 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-749259300 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-749259300 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-749259300|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-749259300 |P1Thread1of1ForFork1_#t~ite12_Out-749259300|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-749259300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-749259300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749259300, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-749259300} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-749259300, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-749259300, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-749259300, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-749259300|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-749259300} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 07:46:20,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1154534149 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1154534149 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1154534149|) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1154534149 |P1Thread1of1ForFork1_#t~ite13_Out1154534149|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1154534149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1154534149} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1154534149, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1154534149, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1154534149|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 07:46:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-2032431956 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2032431956 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-2032431956 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2032431956 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-2032431956 |P1Thread1of1ForFork1_#t~ite14_Out-2032431956|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite14_Out-2032431956| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2032431956, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032431956, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2032431956, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032431956} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2032431956, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2032431956, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2032431956, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2032431956|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2032431956} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 07:46:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:46:20,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1736878393 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1736878393 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1736878393| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1736878393 |P2Thread1of1ForFork2_#t~ite17_Out1736878393|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1736878393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1736878393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1736878393, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1736878393, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1736878393|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 07:46:20,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-1494538388 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1494538388 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1494538388 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1494538388 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1494538388| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1494538388 |P2Thread1of1ForFork2_#t~ite18_Out-1494538388|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1494538388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494538388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1494538388, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494538388} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1494538388, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494538388, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1494538388, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1494538388|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494538388} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 07:46:20,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In990789545 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In990789545 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out990789545| 0)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out990789545| ~y$r_buff0_thd3~0_In990789545) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In990789545, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In990789545} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In990789545, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In990789545, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out990789545|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 07:46:20,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1799108637 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1799108637 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-1799108637 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1799108637 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1799108637| ~y$r_buff1_thd3~0_In-1799108637) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1799108637| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1799108637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799108637, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1799108637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1799108637} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1799108637, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1799108637, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1799108637|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1799108637, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1799108637} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 07:46:20,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 07:46:20,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: 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_4|, ~__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-27 07:46:20,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out1972984505| |ULTIMATE.start_main_#t~ite25_Out1972984505|)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1972984505 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1972984505 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out1972984505| ~y$w_buff1~0_In1972984505)) (and (= |ULTIMATE.start_main_#t~ite24_Out1972984505| ~y~0_In1972984505) .cse0 (or .cse2 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1972984505, ~y~0=~y~0_In1972984505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1972984505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1972984505} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1972984505, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1972984505|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1972984505|, ~y~0=~y~0_In1972984505, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1972984505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1972984505} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 07:46:20,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1094727799 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1094727799 256) 0))) (or (and (= ~y$w_buff0_used~0_In1094727799 |ULTIMATE.start_main_#t~ite26_Out1094727799|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1094727799|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1094727799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1094727799} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1094727799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1094727799, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1094727799|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 07:46:20,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-406682648 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-406682648 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-406682648 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-406682648 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-406682648|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-406682648 |ULTIMATE.start_main_#t~ite27_Out-406682648|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-406682648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-406682648, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-406682648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-406682648} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-406682648, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-406682648, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-406682648|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-406682648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-406682648} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 07:46:20,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In2010239063 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In2010239063 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out2010239063|)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In2010239063 |ULTIMATE.start_main_#t~ite28_Out2010239063|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2010239063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2010239063} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out2010239063|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2010239063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2010239063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 07:46:20,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-675529172 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-675529172 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-675529172 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-675529172 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-675529172| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite29_Out-675529172| ~y$r_buff1_thd0~0_In-675529172) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-675529172, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675529172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-675529172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675529172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-675529172, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-675529172|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-675529172, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-675529172, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-675529172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 07:46:20,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In546719733 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out546719733| ~y$w_buff1~0_In546719733) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In546719733 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In546719733 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In546719733 256)) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In546719733 256) 0)))) .cse1 (= |ULTIMATE.start_main_#t~ite38_Out546719733| |ULTIMATE.start_main_#t~ite39_Out546719733|)) (and (= |ULTIMATE.start_main_#t~ite38_In546719733| |ULTIMATE.start_main_#t~ite38_Out546719733|) (= ~y$w_buff1~0_In546719733 |ULTIMATE.start_main_#t~ite39_Out546719733|) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In546719733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546719733, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In546719733, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In546719733|, ~weak$$choice2~0=~weak$$choice2~0_In546719733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In546719733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546719733} OutVars{~y$w_buff1~0=~y$w_buff1~0_In546719733, ~y$w_buff0_used~0=~y$w_buff0_used~0_In546719733, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out546719733|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In546719733, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out546719733|, ~weak$$choice2~0=~weak$$choice2~0_In546719733, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In546719733, ~y$w_buff1_used~0=~y$w_buff1_used~0_In546719733} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 07:46:20,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In701805546 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_In701805546| |ULTIMATE.start_main_#t~ite41_Out701805546|) (= ~y$w_buff0_used~0_In701805546 |ULTIMATE.start_main_#t~ite42_Out701805546|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In701805546 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd0~0_In701805546 256))) (= (mod ~y$w_buff0_used~0_In701805546 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In701805546 256) 0)))) .cse0 (= ~y$w_buff0_used~0_In701805546 |ULTIMATE.start_main_#t~ite41_Out701805546|) (= |ULTIMATE.start_main_#t~ite42_Out701805546| |ULTIMATE.start_main_#t~ite41_Out701805546|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In701805546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In701805546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In701805546, ~weak$$choice2~0=~weak$$choice2~0_In701805546, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In701805546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In701805546} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out701805546|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In701805546, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In701805546, ~weak$$choice2~0=~weak$$choice2~0_In701805546, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out701805546|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In701805546, ~y$w_buff1_used~0=~y$w_buff1_used~0_In701805546} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:46:20,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 07:46:20,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:46:20,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 07:46:20,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:46:20 BasicIcfg [2019-12-27 07:46:20,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:46:20,889 INFO L168 Benchmark]: Toolchain (without parser) took 76414.04 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 101.7 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,889 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:46:20,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.13 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 153.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.08 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,892 INFO L168 Benchmark]: Boogie Preprocessor took 55.80 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 148.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,893 INFO L168 Benchmark]: RCFGBuilder took 835.89 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 98.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,894 INFO L168 Benchmark]: TraceAbstraction took 74743.70 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 07:46:20,900 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory is still 121.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 706.13 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.7 MB in the beginning and 153.7 MB in the end (delta: -52.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.08 ms. Allocated memory is still 202.9 MB. Free memory was 153.7 MB in the beginning and 150.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.80 ms. Allocated memory is still 202.9 MB. Free memory was 150.7 MB in the beginning and 148.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.89 ms. Allocated memory is still 202.9 MB. Free memory was 148.8 MB in the beginning and 98.2 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 74743.70 ms. Allocated memory was 202.9 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2177, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2178, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2179, ((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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2859 SDtfs, 2602 SDslu, 5618 SDs, 0 SdLazy, 4271 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 40 SyntacticMatches, 18 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 59943 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 827 ConstructedInterpolants, 0 QuantifiedInterpolants, 151313 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...