/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 13:52:07,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 13:52:07,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 13:52:07,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 13:52:07,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 13:52:07,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 13:52:07,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 13:52:07,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 13:52:07,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 13:52:07,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 13:52:07,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 13:52:07,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 13:52:07,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 13:52:07,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 13:52:07,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 13:52:07,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 13:52:07,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 13:52:07,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 13:52:07,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 13:52:07,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 13:52:07,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 13:52:07,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 13:52:07,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 13:52:07,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 13:52:07,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 13:52:07,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 13:52:07,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 13:52:07,124 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 13:52:07,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 13:52:07,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 13:52:07,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 13:52:07,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 13:52:07,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 13:52:07,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 13:52:07,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 13:52:07,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 13:52:07,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 13:52:07,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 13:52:07,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 13:52:07,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 13:52:07,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 13:52:07,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 13:52:07,170 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 13:52:07,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 13:52:07,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 13:52:07,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 13:52:07,172 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 13:52:07,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 13:52:07,175 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 13:52:07,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 13:52:07,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 13:52:07,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 13:52:07,177 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 13:52:07,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 13:52:07,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 13:52:07,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 13:52:07,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 13:52:07,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 13:52:07,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:52:07,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 13:52:07,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 13:52:07,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 13:52:07,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 13:52:07,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 13:52:07,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 13:52:07,179 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 13:52:07,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 13:52:07,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 13:52:07,485 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 13:52:07,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 13:52:07,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 13:52:07,491 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 13:52:07,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 13:52:07,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdcee8cb/fabaad697ca8449d9d761e1e25509045/FLAGd10d8392c [2019-12-18 13:52:08,105 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 13:52:08,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-18 13:52:08,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdcee8cb/fabaad697ca8449d9d761e1e25509045/FLAGd10d8392c [2019-12-18 13:52:08,387 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bdcee8cb/fabaad697ca8449d9d761e1e25509045 [2019-12-18 13:52:08,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 13:52:08,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 13:52:08,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 13:52:08,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 13:52:08,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 13:52:08,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:52:08" (1/1) ... [2019-12-18 13:52:08,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a840ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:08, skipping insertion in model container [2019-12-18 13:52:08,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:52:08" (1/1) ... [2019-12-18 13:52:08,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 13:52:08,479 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 13:52:09,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:52:09,023 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 13:52:09,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 13:52:09,197 INFO L208 MainTranslator]: Completed translation [2019-12-18 13:52:09,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09 WrapperNode [2019-12-18 13:52:09,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 13:52:09,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 13:52:09,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 13:52:09,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 13:52:09,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 13:52:09,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 13:52:09,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 13:52:09,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 13:52:09,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... [2019-12-18 13:52:09,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 13:52:09,328 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 13:52:09,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 13:52:09,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 13:52:09,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 13:52:09,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 13:52:09,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 13:52:09,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 13:52:09,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 13:52:09,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 13:52:09,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 13:52:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 13:52:09,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 13:52:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 13:52:09,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 13:52:09,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 13:52:09,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 13:52:09,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 13:52:09,391 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 13:52:10,173 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 13:52:10,174 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 13:52:10,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:52:10 BoogieIcfgContainer [2019-12-18 13:52:10,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 13:52:10,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 13:52:10,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 13:52:10,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 13:52:10,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:52:08" (1/3) ... [2019-12-18 13:52:10,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76955b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:52:10, skipping insertion in model container [2019-12-18 13:52:10,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:52:09" (2/3) ... [2019-12-18 13:52:10,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76955b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:52:10, skipping insertion in model container [2019-12-18 13:52:10,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:52:10" (3/3) ... [2019-12-18 13:52:10,188 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc.i [2019-12-18 13:52:10,200 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 13:52:10,200 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 13:52:10,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 13:52:10,221 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 13:52:10,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,281 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,282 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,289 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,289 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,298 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,356 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,365 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 13:52:10,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 13:52:10,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 13:52:10,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 13:52:10,415 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 13:52:10,415 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 13:52:10,415 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 13:52:10,415 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 13:52:10,415 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 13:52:10,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 13:52:10,430 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 13:52:10,432 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:52:10,528 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:52:10,528 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:52:10,555 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:52:10,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 13:52:10,637 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 13:52:10,637 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 13:52:10,648 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 13:52:10,669 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 13:52:10,670 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 13:52:16,328 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 13:52:16,454 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 13:52:16,791 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 13:52:16,791 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 13:52:16,795 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 13:52:34,884 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 13:52:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 13:52:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 13:52:34,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:52:34,892 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 13:52:34,892 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:52:34,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:52:34,897 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 13:52:34,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:52:34,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125462288] [2019-12-18 13:52:34,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:52:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:52:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:52:35,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125462288] [2019-12-18 13:52:35,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:52:35,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 13:52:35,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312035902] [2019-12-18 13:52:35,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:52:35,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:52:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:52:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:52:35,129 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 13:52:36,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:52:36,640 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 13:52:36,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:52:36,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 13:52:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:52:40,211 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 13:52:40,211 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 13:52:40,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:52:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 13:52:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 13:52:46,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 13:52:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 13:52:47,041 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 13:52:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:52:47,041 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 13:52:47,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:52:47,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 13:52:47,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 13:52:47,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:52:47,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:52:47,047 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:52:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:52:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 13:52:47,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:52:47,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305899752] [2019-12-18 13:52:47,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:52:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:52:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:52:47,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305899752] [2019-12-18 13:52:47,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:52:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:52:47,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211352495] [2019-12-18 13:52:47,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:52:47,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:52:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:52:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:52:47,151 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 13:52:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:52:51,887 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 13:52:51,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:52:51,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 13:52:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:52:52,576 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 13:52:52,576 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 13:52:52,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:52:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 13:53:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 13:53:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 13:53:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 13:53:07,566 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 13:53:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:07,566 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 13:53:07,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 13:53:07,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 13:53:07,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:07,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:07,573 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:07,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:07,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 13:53:07,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:07,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940591753] [2019-12-18 13:53:07,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:07,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:07,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940591753] [2019-12-18 13:53:07,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:07,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:07,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880114611] [2019-12-18 13:53:07,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:07,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:07,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:07,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:07,674 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 13:53:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:07,792 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 13:53:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:07,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 13:53:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:07,876 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 13:53:07,877 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 13:53:07,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:08,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 13:53:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 13:53:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 13:53:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 13:53:08,477 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 13:53:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:08,478 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 13:53:08,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 13:53:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:53:08,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:08,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:08,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:08,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:08,482 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 13:53:08,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:08,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646645880] [2019-12-18 13:53:08,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:08,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:08,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646645880] [2019-12-18 13:53:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:08,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459361946] [2019-12-18 13:53:08,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:08,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:08,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:08,620 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 13:53:09,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:09,126 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 13:53:09,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:53:09,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:53:09,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:09,246 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 13:53:09,246 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 13:53:09,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:10,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 13:53:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 13:53:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 13:53:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 13:53:11,299 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 13:53:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:11,300 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 13:53:11,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 13:53:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 13:53:11,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:11,311 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] [2019-12-18 13:53:11,311 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:11,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:11,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 13:53:11,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:11,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141412076] [2019-12-18 13:53:11,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:11,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:11,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141412076] [2019-12-18 13:53:11,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:11,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:11,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557019194] [2019-12-18 13:53:11,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:11,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:11,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:11,405 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 13:53:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:12,281 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 13:53:12,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:53:12,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 13:53:12,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:12,412 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 13:53:12,412 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 13:53:12,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:53:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 13:53:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 13:53:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 13:53:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 13:53:15,551 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 13:53:15,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:15,551 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 13:53:15,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 13:53:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 13:53:15,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:15,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:15,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:15,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 13:53:15,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:15,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723843801] [2019-12-18 13:53:15,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:15,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723843801] [2019-12-18 13:53:15,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:15,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688617031] [2019-12-18 13:53:15,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:15,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:15,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:15,631 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 13:53:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:15,700 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 13:53:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:15,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 13:53:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:15,721 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 13:53:15,721 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 13:53:15,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:15,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 13:53:15,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 13:53:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 13:53:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 13:53:15,944 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 13:53:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:15,944 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 13:53:15,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:15,944 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 13:53:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 13:53:15,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:15,955 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] [2019-12-18 13:53:15,955 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 13:53:15,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:15,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175690690] [2019-12-18 13:53:15,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:16,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175690690] [2019-12-18 13:53:16,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:16,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:16,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432369732] [2019-12-18 13:53:16,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:16,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:16,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:16,086 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 13:53:16,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:16,653 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 13:53:16,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:53:16,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 13:53:16,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:16,683 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 13:53:16,683 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 13:53:16,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:53:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 13:53:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 13:53:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 13:53:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 13:53:17,309 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 13:53:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:17,309 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 13:53:17,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 13:53:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 13:53:17,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:17,327 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] [2019-12-18 13:53:17,327 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:17,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 13:53:17,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:17,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319355984] [2019-12-18 13:53:17,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:17,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319355984] [2019-12-18 13:53:17,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:17,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:17,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691185520] [2019-12-18 13:53:17,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:17,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:17,425 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 7 states. [2019-12-18 13:53:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:18,558 INFO L93 Difference]: Finished difference Result 24589 states and 72044 transitions. [2019-12-18 13:53:18,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 13:53:18,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 13:53:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:18,604 INFO L225 Difference]: With dead ends: 24589 [2019-12-18 13:53:18,604 INFO L226 Difference]: Without dead ends: 24589 [2019-12-18 13:53:18,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 13:53:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24589 states. [2019-12-18 13:53:18,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24589 to 16666. [2019-12-18 13:53:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 13:53:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 13:53:18,910 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 13:53:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:18,911 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 13:53:18,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 13:53:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 13:53:18,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:18,934 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] [2019-12-18 13:53:18,934 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:18,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 13:53:18,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:18,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148557417] [2019-12-18 13:53:18,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:18,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:18,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148557417] [2019-12-18 13:53:18,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:18,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:19,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335542606] [2019-12-18 13:53:19,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:19,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:19,001 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 5 states. [2019-12-18 13:53:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:19,071 INFO L93 Difference]: Finished difference Result 15541 states and 47563 transitions. [2019-12-18 13:53:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:53:19,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 13:53:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:19,095 INFO L225 Difference]: With dead ends: 15541 [2019-12-18 13:53:19,095 INFO L226 Difference]: Without dead ends: 15541 [2019-12-18 13:53:19,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2019-12-18 13:53:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 15044. [2019-12-18 13:53:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15044 states. [2019-12-18 13:53:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15044 states to 15044 states and 46220 transitions. [2019-12-18 13:53:19,330 INFO L78 Accepts]: Start accepts. Automaton has 15044 states and 46220 transitions. Word has length 39 [2019-12-18 13:53:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:19,330 INFO L462 AbstractCegarLoop]: Abstraction has 15044 states and 46220 transitions. [2019-12-18 13:53:19,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 15044 states and 46220 transitions. [2019-12-18 13:53:19,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:19,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:19,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:19,351 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:19,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:19,351 INFO L82 PathProgramCache]: Analyzing trace with hash -411911737, now seen corresponding path program 1 times [2019-12-18 13:53:19,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:19,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024596390] [2019-12-18 13:53:19,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:19,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024596390] [2019-12-18 13:53:19,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:19,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:19,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694030611] [2019-12-18 13:53:19,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:19,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:19,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:19,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:19,440 INFO L87 Difference]: Start difference. First operand 15044 states and 46220 transitions. Second operand 3 states. [2019-12-18 13:53:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:19,574 INFO L93 Difference]: Finished difference Result 22609 states and 69550 transitions. [2019-12-18 13:53:19,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:19,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:53:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:19,614 INFO L225 Difference]: With dead ends: 22609 [2019-12-18 13:53:19,614 INFO L226 Difference]: Without dead ends: 22609 [2019-12-18 13:53:19,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22609 states. [2019-12-18 13:53:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22609 to 16710. [2019-12-18 13:53:19,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 13:53:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 52163 transitions. [2019-12-18 13:53:19,919 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 52163 transitions. Word has length 64 [2019-12-18 13:53:19,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:19,919 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 52163 transitions. [2019-12-18 13:53:19,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:19,919 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 52163 transitions. [2019-12-18 13:53:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:20,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:20,207 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:20,207 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 190415677, now seen corresponding path program 1 times [2019-12-18 13:53:20,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:20,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182657106] [2019-12-18 13:53:20,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:20,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182657106] [2019-12-18 13:53:20,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:20,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:20,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784015515] [2019-12-18 13:53:20,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:20,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:20,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:20,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:20,302 INFO L87 Difference]: Start difference. First operand 16710 states and 52163 transitions. Second operand 4 states. [2019-12-18 13:53:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:20,430 INFO L93 Difference]: Finished difference Result 31544 states and 98598 transitions. [2019-12-18 13:53:20,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:20,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-18 13:53:20,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:20,459 INFO L225 Difference]: With dead ends: 31544 [2019-12-18 13:53:20,459 INFO L226 Difference]: Without dead ends: 15723 [2019-12-18 13:53:20,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:20,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15723 states. [2019-12-18 13:53:20,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15723 to 15723. [2019-12-18 13:53:20,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15723 states. [2019-12-18 13:53:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15723 states to 15723 states and 48991 transitions. [2019-12-18 13:53:20,694 INFO L78 Accepts]: Start accepts. Automaton has 15723 states and 48991 transitions. Word has length 64 [2019-12-18 13:53:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:20,694 INFO L462 AbstractCegarLoop]: Abstraction has 15723 states and 48991 transitions. [2019-12-18 13:53:20,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 15723 states and 48991 transitions. [2019-12-18 13:53:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:20,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:20,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:20,712 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 2 times [2019-12-18 13:53:20,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:20,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016988596] [2019-12-18 13:53:20,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:20,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016988596] [2019-12-18 13:53:20,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:20,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:20,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858760434] [2019-12-18 13:53:20,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:20,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:20,807 INFO L87 Difference]: Start difference. First operand 15723 states and 48991 transitions. Second operand 7 states. [2019-12-18 13:53:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:21,305 INFO L93 Difference]: Finished difference Result 46938 states and 144585 transitions. [2019-12-18 13:53:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:53:21,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:21,353 INFO L225 Difference]: With dead ends: 46938 [2019-12-18 13:53:21,353 INFO L226 Difference]: Without dead ends: 33282 [2019-12-18 13:53:21,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:53:21,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33282 states. [2019-12-18 13:53:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33282 to 18382. [2019-12-18 13:53:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18382 states. [2019-12-18 13:53:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18382 states to 18382 states and 57406 transitions. [2019-12-18 13:53:21,753 INFO L78 Accepts]: Start accepts. Automaton has 18382 states and 57406 transitions. Word has length 64 [2019-12-18 13:53:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:21,753 INFO L462 AbstractCegarLoop]: Abstraction has 18382 states and 57406 transitions. [2019-12-18 13:53:21,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 18382 states and 57406 transitions. [2019-12-18 13:53:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:21,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:21,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:21,775 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:21,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 3 times [2019-12-18 13:53:21,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:21,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121138437] [2019-12-18 13:53:21,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121138437] [2019-12-18 13:53:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065510803] [2019-12-18 13:53:21,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:21,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:21,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:21,884 INFO L87 Difference]: Start difference. First operand 18382 states and 57406 transitions. Second operand 7 states. [2019-12-18 13:53:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:22,386 INFO L93 Difference]: Finished difference Result 51331 states and 159915 transitions. [2019-12-18 13:53:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:53:22,387 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:22,445 INFO L225 Difference]: With dead ends: 51331 [2019-12-18 13:53:22,445 INFO L226 Difference]: Without dead ends: 39815 [2019-12-18 13:53:22,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:53:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39815 states. [2019-12-18 13:53:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39815 to 21811. [2019-12-18 13:53:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-18 13:53:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 68616 transitions. [2019-12-18 13:53:23,069 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 68616 transitions. Word has length 64 [2019-12-18 13:53:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:23,069 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 68616 transitions. [2019-12-18 13:53:23,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 68616 transitions. [2019-12-18 13:53:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:23,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:23,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:23,107 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1026171661, now seen corresponding path program 4 times [2019-12-18 13:53:23,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:23,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656468494] [2019-12-18 13:53:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:23,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656468494] [2019-12-18 13:53:23,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:23,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658720052] [2019-12-18 13:53:23,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:23,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:23,186 INFO L87 Difference]: Start difference. First operand 21811 states and 68616 transitions. Second operand 7 states. [2019-12-18 13:53:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:23,698 INFO L93 Difference]: Finished difference Result 45057 states and 140142 transitions. [2019-12-18 13:53:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:53:23,699 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 13:53:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:23,762 INFO L225 Difference]: With dead ends: 45057 [2019-12-18 13:53:23,762 INFO L226 Difference]: Without dead ends: 40843 [2019-12-18 13:53:23,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:53:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40843 states. [2019-12-18 13:53:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40843 to 22027. [2019-12-18 13:53:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22027 states. [2019-12-18 13:53:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22027 states to 22027 states and 69303 transitions. [2019-12-18 13:53:24,238 INFO L78 Accepts]: Start accepts. Automaton has 22027 states and 69303 transitions. Word has length 64 [2019-12-18 13:53:24,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:24,238 INFO L462 AbstractCegarLoop]: Abstraction has 22027 states and 69303 transitions. [2019-12-18 13:53:24,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:24,238 INFO L276 IsEmpty]: Start isEmpty. Operand 22027 states and 69303 transitions. [2019-12-18 13:53:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:24,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:24,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:24,263 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:24,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 5 times [2019-12-18 13:53:24,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:24,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006655031] [2019-12-18 13:53:24,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:24,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006655031] [2019-12-18 13:53:24,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:24,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:24,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116520063] [2019-12-18 13:53:24,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:24,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:24,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:24,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:24,370 INFO L87 Difference]: Start difference. First operand 22027 states and 69303 transitions. Second operand 5 states. [2019-12-18 13:53:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:24,981 INFO L93 Difference]: Finished difference Result 34201 states and 104680 transitions. [2019-12-18 13:53:24,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:53:24,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 13:53:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:25,043 INFO L225 Difference]: With dead ends: 34201 [2019-12-18 13:53:25,043 INFO L226 Difference]: Without dead ends: 34033 [2019-12-18 13:53:25,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:25,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34033 states. [2019-12-18 13:53:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34033 to 28062. [2019-12-18 13:53:25,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28062 states. [2019-12-18 13:53:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28062 states to 28062 states and 87165 transitions. [2019-12-18 13:53:25,649 INFO L78 Accepts]: Start accepts. Automaton has 28062 states and 87165 transitions. Word has length 64 [2019-12-18 13:53:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:25,649 INFO L462 AbstractCegarLoop]: Abstraction has 28062 states and 87165 transitions. [2019-12-18 13:53:25,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 28062 states and 87165 transitions. [2019-12-18 13:53:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:25,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:25,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:25,679 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash -738203667, now seen corresponding path program 6 times [2019-12-18 13:53:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:25,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613088736] [2019-12-18 13:53:25,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:25,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613088736] [2019-12-18 13:53:25,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:25,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:53:25,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884985615] [2019-12-18 13:53:25,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:25,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:25,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:25,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:25,763 INFO L87 Difference]: Start difference. First operand 28062 states and 87165 transitions. Second operand 5 states. [2019-12-18 13:53:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:26,297 INFO L93 Difference]: Finished difference Result 30014 states and 92644 transitions. [2019-12-18 13:53:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:53:26,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-18 13:53:26,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:26,374 INFO L225 Difference]: With dead ends: 30014 [2019-12-18 13:53:26,374 INFO L226 Difference]: Without dead ends: 30014 [2019-12-18 13:53:26,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30014 states. [2019-12-18 13:53:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30014 to 28475. [2019-12-18 13:53:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28475 states. [2019-12-18 13:53:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28475 states to 28475 states and 88433 transitions. [2019-12-18 13:53:27,096 INFO L78 Accepts]: Start accepts. Automaton has 28475 states and 88433 transitions. Word has length 64 [2019-12-18 13:53:27,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:27,097 INFO L462 AbstractCegarLoop]: Abstraction has 28475 states and 88433 transitions. [2019-12-18 13:53:27,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28475 states and 88433 transitions. [2019-12-18 13:53:27,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:27,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:27,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:27,147 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:27,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2028716035, now seen corresponding path program 7 times [2019-12-18 13:53:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:27,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748660550] [2019-12-18 13:53:27,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:27,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748660550] [2019-12-18 13:53:27,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:27,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:27,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489388224] [2019-12-18 13:53:27,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:27,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:27,277 INFO L87 Difference]: Start difference. First operand 28475 states and 88433 transitions. Second operand 6 states. [2019-12-18 13:53:28,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:28,175 INFO L93 Difference]: Finished difference Result 48040 states and 146628 transitions. [2019-12-18 13:53:28,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:53:28,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-18 13:53:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:28,244 INFO L225 Difference]: With dead ends: 48040 [2019-12-18 13:53:28,244 INFO L226 Difference]: Without dead ends: 47747 [2019-12-18 13:53:28,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:28,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47747 states. [2019-12-18 13:53:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47747 to 36218. [2019-12-18 13:53:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36218 states. [2019-12-18 13:53:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36218 states to 36218 states and 112422 transitions. [2019-12-18 13:53:29,076 INFO L78 Accepts]: Start accepts. Automaton has 36218 states and 112422 transitions. Word has length 64 [2019-12-18 13:53:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:29,076 INFO L462 AbstractCegarLoop]: Abstraction has 36218 states and 112422 transitions. [2019-12-18 13:53:29,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:29,076 INFO L276 IsEmpty]: Start isEmpty. Operand 36218 states and 112422 transitions. [2019-12-18 13:53:29,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 13:53:29,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:29,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:29,115 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:29,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:29,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2089785517, now seen corresponding path program 8 times [2019-12-18 13:53:29,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:29,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234750430] [2019-12-18 13:53:29,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:29,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234750430] [2019-12-18 13:53:29,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:29,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:29,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122021090] [2019-12-18 13:53:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:29,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:29,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:29,233 INFO L87 Difference]: Start difference. First operand 36218 states and 112422 transitions. Second operand 3 states. [2019-12-18 13:53:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:29,402 INFO L93 Difference]: Finished difference Result 36218 states and 112421 transitions. [2019-12-18 13:53:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:29,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 13:53:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:29,484 INFO L225 Difference]: With dead ends: 36218 [2019-12-18 13:53:29,484 INFO L226 Difference]: Without dead ends: 36218 [2019-12-18 13:53:29,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36218 states. [2019-12-18 13:53:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36218 to 31693. [2019-12-18 13:53:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31693 states. [2019-12-18 13:53:30,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31693 states to 31693 states and 99497 transitions. [2019-12-18 13:53:30,378 INFO L78 Accepts]: Start accepts. Automaton has 31693 states and 99497 transitions. Word has length 64 [2019-12-18 13:53:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:30,378 INFO L462 AbstractCegarLoop]: Abstraction has 31693 states and 99497 transitions. [2019-12-18 13:53:30,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:30,378 INFO L276 IsEmpty]: Start isEmpty. Operand 31693 states and 99497 transitions. [2019-12-18 13:53:30,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:30,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:30,416 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:30,416 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:30,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1914914851, now seen corresponding path program 1 times [2019-12-18 13:53:30,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:30,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118809796] [2019-12-18 13:53:30,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:30,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:30,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118809796] [2019-12-18 13:53:30,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:30,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:30,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457143988] [2019-12-18 13:53:30,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:30,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:30,514 INFO L87 Difference]: Start difference. First operand 31693 states and 99497 transitions. Second operand 6 states. [2019-12-18 13:53:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:30,967 INFO L93 Difference]: Finished difference Result 33466 states and 104373 transitions. [2019-12-18 13:53:30,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:53:30,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 13:53:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:31,030 INFO L225 Difference]: With dead ends: 33466 [2019-12-18 13:53:31,030 INFO L226 Difference]: Without dead ends: 33466 [2019-12-18 13:53:31,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 13:53:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33466 states. [2019-12-18 13:53:31,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33466 to 31726. [2019-12-18 13:53:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31726 states. [2019-12-18 13:53:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31726 states to 31726 states and 99597 transitions. [2019-12-18 13:53:31,727 INFO L78 Accepts]: Start accepts. Automaton has 31726 states and 99597 transitions. Word has length 65 [2019-12-18 13:53:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:31,728 INFO L462 AbstractCegarLoop]: Abstraction has 31726 states and 99597 transitions. [2019-12-18 13:53:31,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 31726 states and 99597 transitions. [2019-12-18 13:53:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 13:53:31,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:31,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:31,765 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:31,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:31,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1796094165, now seen corresponding path program 2 times [2019-12-18 13:53:31,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:31,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583059062] [2019-12-18 13:53:31,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:31,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:31,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583059062] [2019-12-18 13:53:31,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:31,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:31,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003016464] [2019-12-18 13:53:31,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:31,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:31,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:31,872 INFO L87 Difference]: Start difference. First operand 31726 states and 99597 transitions. Second operand 4 states. [2019-12-18 13:53:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:32,071 INFO L93 Difference]: Finished difference Result 36708 states and 114465 transitions. [2019-12-18 13:53:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:32,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 13:53:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:32,124 INFO L225 Difference]: With dead ends: 36708 [2019-12-18 13:53:32,124 INFO L226 Difference]: Without dead ends: 36708 [2019-12-18 13:53:32,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36708 states. [2019-12-18 13:53:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36708 to 32458. [2019-12-18 13:53:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32458 states. [2019-12-18 13:53:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32458 states to 32458 states and 102138 transitions. [2019-12-18 13:53:32,689 INFO L78 Accepts]: Start accepts. Automaton has 32458 states and 102138 transitions. Word has length 65 [2019-12-18 13:53:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:32,689 INFO L462 AbstractCegarLoop]: Abstraction has 32458 states and 102138 transitions. [2019-12-18 13:53:32,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 32458 states and 102138 transitions. [2019-12-18 13:53:32,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:32,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:32,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:32,728 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:32,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:32,728 INFO L82 PathProgramCache]: Analyzing trace with hash 2043933972, now seen corresponding path program 1 times [2019-12-18 13:53:32,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:32,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448731507] [2019-12-18 13:53:32,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:32,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448731507] [2019-12-18 13:53:32,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:32,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:32,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499517389] [2019-12-18 13:53:32,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:53:32,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:53:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:53:32,773 INFO L87 Difference]: Start difference. First operand 32458 states and 102138 transitions. Second operand 4 states. [2019-12-18 13:53:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:33,123 INFO L93 Difference]: Finished difference Result 46235 states and 145876 transitions. [2019-12-18 13:53:33,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:53:33,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-18 13:53:33,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:33,193 INFO L225 Difference]: With dead ends: 46235 [2019-12-18 13:53:33,193 INFO L226 Difference]: Without dead ends: 46235 [2019-12-18 13:53:33,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46235 states. [2019-12-18 13:53:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46235 to 34368. [2019-12-18 13:53:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34368 states. [2019-12-18 13:53:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34368 states to 34368 states and 109106 transitions. [2019-12-18 13:53:34,067 INFO L78 Accepts]: Start accepts. Automaton has 34368 states and 109106 transitions. Word has length 66 [2019-12-18 13:53:34,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:34,068 INFO L462 AbstractCegarLoop]: Abstraction has 34368 states and 109106 transitions. [2019-12-18 13:53:34,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:53:34,068 INFO L276 IsEmpty]: Start isEmpty. Operand 34368 states and 109106 transitions. [2019-12-18 13:53:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:34,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:34,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:34,109 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:34,109 INFO L82 PathProgramCache]: Analyzing trace with hash -421528917, now seen corresponding path program 1 times [2019-12-18 13:53:34,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:34,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231214508] [2019-12-18 13:53:34,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:34,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231214508] [2019-12-18 13:53:34,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:34,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:34,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707732708] [2019-12-18 13:53:34,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:34,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:34,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:34,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:34,192 INFO L87 Difference]: Start difference. First operand 34368 states and 109106 transitions. Second operand 7 states. [2019-12-18 13:53:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:34,745 INFO L93 Difference]: Finished difference Result 74263 states and 232352 transitions. [2019-12-18 13:53:34,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:53:34,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 13:53:34,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:34,854 INFO L225 Difference]: With dead ends: 74263 [2019-12-18 13:53:34,854 INFO L226 Difference]: Without dead ends: 67399 [2019-12-18 13:53:34,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:53:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67399 states. [2019-12-18 13:53:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67399 to 34400. [2019-12-18 13:53:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34400 states. [2019-12-18 13:53:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34400 states to 34400 states and 109224 transitions. [2019-12-18 13:53:35,649 INFO L78 Accepts]: Start accepts. Automaton has 34400 states and 109224 transitions. Word has length 66 [2019-12-18 13:53:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:35,649 INFO L462 AbstractCegarLoop]: Abstraction has 34400 states and 109224 transitions. [2019-12-18 13:53:35,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 34400 states and 109224 transitions. [2019-12-18 13:53:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:35,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:35,691 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:35,691 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash -935765541, now seen corresponding path program 2 times [2019-12-18 13:53:35,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:35,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445010352] [2019-12-18 13:53:35,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:35,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445010352] [2019-12-18 13:53:35,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:35,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:53:35,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725611093] [2019-12-18 13:53:35,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:53:35,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:35,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:53:35,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:53:35,904 INFO L87 Difference]: Start difference. First operand 34400 states and 109224 transitions. Second operand 7 states. [2019-12-18 13:53:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:36,892 INFO L93 Difference]: Finished difference Result 46043 states and 144984 transitions. [2019-12-18 13:53:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 13:53:36,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 13:53:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:37,208 INFO L225 Difference]: With dead ends: 46043 [2019-12-18 13:53:37,208 INFO L226 Difference]: Without dead ends: 46035 [2019-12-18 13:53:37,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 13:53:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46035 states. [2019-12-18 13:53:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46035 to 33798. [2019-12-18 13:53:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33798 states. [2019-12-18 13:53:37,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33798 states to 33798 states and 105357 transitions. [2019-12-18 13:53:37,801 INFO L78 Accepts]: Start accepts. Automaton has 33798 states and 105357 transitions. Word has length 66 [2019-12-18 13:53:37,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:37,801 INFO L462 AbstractCegarLoop]: Abstraction has 33798 states and 105357 transitions. [2019-12-18 13:53:37,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:53:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 33798 states and 105357 transitions. [2019-12-18 13:53:37,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:37,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:37,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:37,841 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:37,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1405357775, now seen corresponding path program 1 times [2019-12-18 13:53:37,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:37,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148685857] [2019-12-18 13:53:37,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:37,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148685857] [2019-12-18 13:53:37,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:37,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:53:37,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700657712] [2019-12-18 13:53:37,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:37,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:37,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:37,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:37,884 INFO L87 Difference]: Start difference. First operand 33798 states and 105357 transitions. Second operand 3 states. [2019-12-18 13:53:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:38,156 INFO L93 Difference]: Finished difference Result 45096 states and 139312 transitions. [2019-12-18 13:53:38,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:38,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:53:38,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:38,223 INFO L225 Difference]: With dead ends: 45096 [2019-12-18 13:53:38,223 INFO L226 Difference]: Without dead ends: 45096 [2019-12-18 13:53:38,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:38,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45096 states. [2019-12-18 13:53:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45096 to 33807. [2019-12-18 13:53:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33807 states. [2019-12-18 13:53:38,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33807 states to 33807 states and 105484 transitions. [2019-12-18 13:53:38,822 INFO L78 Accepts]: Start accepts. Automaton has 33807 states and 105484 transitions. Word has length 66 [2019-12-18 13:53:38,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:38,823 INFO L462 AbstractCegarLoop]: Abstraction has 33807 states and 105484 transitions. [2019-12-18 13:53:38,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:38,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33807 states and 105484 transitions. [2019-12-18 13:53:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:38,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:38,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:38,861 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash -710564475, now seen corresponding path program 2 times [2019-12-18 13:53:38,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:38,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057596029] [2019-12-18 13:53:38,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:38,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057596029] [2019-12-18 13:53:38,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:38,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:53:38,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271336795] [2019-12-18 13:53:38,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:53:38,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:38,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:53:38,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:38,955 INFO L87 Difference]: Start difference. First operand 33807 states and 105484 transitions. Second operand 6 states. [2019-12-18 13:53:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:39,876 INFO L93 Difference]: Finished difference Result 52314 states and 164400 transitions. [2019-12-18 13:53:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 13:53:39,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 13:53:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:39,989 INFO L225 Difference]: With dead ends: 52314 [2019-12-18 13:53:39,990 INFO L226 Difference]: Without dead ends: 52314 [2019-12-18 13:53:39,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:53:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52314 states. [2019-12-18 13:53:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52314 to 35339. [2019-12-18 13:53:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35339 states. [2019-12-18 13:53:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35339 states to 35339 states and 110434 transitions. [2019-12-18 13:53:40,980 INFO L78 Accepts]: Start accepts. Automaton has 35339 states and 110434 transitions. Word has length 66 [2019-12-18 13:53:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:40,980 INFO L462 AbstractCegarLoop]: Abstraction has 35339 states and 110434 transitions. [2019-12-18 13:53:40,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:53:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 35339 states and 110434 transitions. [2019-12-18 13:53:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 13:53:41,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:41,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:41,021 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:41,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1257941510, now seen corresponding path program 1 times [2019-12-18 13:53:41,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:41,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102962570] [2019-12-18 13:53:41,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:41,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102962570] [2019-12-18 13:53:41,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:41,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:53:41,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890330276] [2019-12-18 13:53:41,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:53:41,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:41,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:53:41,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:41,083 INFO L87 Difference]: Start difference. First operand 35339 states and 110434 transitions. Second operand 3 states. [2019-12-18 13:53:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:41,222 INFO L93 Difference]: Finished difference Result 27190 states and 83925 transitions. [2019-12-18 13:53:41,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:53:41,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 13:53:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:41,274 INFO L225 Difference]: With dead ends: 27190 [2019-12-18 13:53:41,274 INFO L226 Difference]: Without dead ends: 27190 [2019-12-18 13:53:41,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:53:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27190 states. [2019-12-18 13:53:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27190 to 25917. [2019-12-18 13:53:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25917 states. [2019-12-18 13:53:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25917 states to 25917 states and 79982 transitions. [2019-12-18 13:53:41,681 INFO L78 Accepts]: Start accepts. Automaton has 25917 states and 79982 transitions. Word has length 66 [2019-12-18 13:53:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:41,681 INFO L462 AbstractCegarLoop]: Abstraction has 25917 states and 79982 transitions. [2019-12-18 13:53:41,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:53:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 25917 states and 79982 transitions. [2019-12-18 13:53:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:41,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:41,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:41,710 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1833873751, now seen corresponding path program 1 times [2019-12-18 13:53:41,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:41,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900718410] [2019-12-18 13:53:41,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:41,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900718410] [2019-12-18 13:53:41,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:41,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:53:41,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613739998] [2019-12-18 13:53:41,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 13:53:41,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:41,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 13:53:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 13:53:41,934 INFO L87 Difference]: Start difference. First operand 25917 states and 79982 transitions. Second operand 11 states. [2019-12-18 13:53:43,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:43,746 INFO L93 Difference]: Finished difference Result 55131 states and 170342 transitions. [2019-12-18 13:53:43,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 13:53:43,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 13:53:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:43,808 INFO L225 Difference]: With dead ends: 55131 [2019-12-18 13:53:43,808 INFO L226 Difference]: Without dead ends: 42777 [2019-12-18 13:53:43,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 13:53:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42777 states. [2019-12-18 13:53:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42777 to 25886. [2019-12-18 13:53:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25886 states. [2019-12-18 13:53:44,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25886 states to 25886 states and 79323 transitions. [2019-12-18 13:53:44,518 INFO L78 Accepts]: Start accepts. Automaton has 25886 states and 79323 transitions. Word has length 67 [2019-12-18 13:53:44,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:44,518 INFO L462 AbstractCegarLoop]: Abstraction has 25886 states and 79323 transitions. [2019-12-18 13:53:44,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 13:53:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25886 states and 79323 transitions. [2019-12-18 13:53:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:44,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:44,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:44,545 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1914364325, now seen corresponding path program 2 times [2019-12-18 13:53:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438422809] [2019-12-18 13:53:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:44,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438422809] [2019-12-18 13:53:44,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:44,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:53:44,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139097536] [2019-12-18 13:53:44,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 13:53:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 13:53:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:53:44,741 INFO L87 Difference]: Start difference. First operand 25886 states and 79323 transitions. Second operand 12 states. [2019-12-18 13:53:45,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:45,935 INFO L93 Difference]: Finished difference Result 43357 states and 132924 transitions. [2019-12-18 13:53:45,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 13:53:45,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 13:53:45,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:45,996 INFO L225 Difference]: With dead ends: 43357 [2019-12-18 13:53:45,997 INFO L226 Difference]: Without dead ends: 42503 [2019-12-18 13:53:45,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 13:53:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42503 states. [2019-12-18 13:53:46,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42503 to 25356. [2019-12-18 13:53:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25356 states. [2019-12-18 13:53:46,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25356 states to 25356 states and 77865 transitions. [2019-12-18 13:53:46,505 INFO L78 Accepts]: Start accepts. Automaton has 25356 states and 77865 transitions. Word has length 67 [2019-12-18 13:53:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:46,505 INFO L462 AbstractCegarLoop]: Abstraction has 25356 states and 77865 transitions. [2019-12-18 13:53:46,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 13:53:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 25356 states and 77865 transitions. [2019-12-18 13:53:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:46,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:46,534 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:46,534 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1791716501, now seen corresponding path program 3 times [2019-12-18 13:53:46,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:46,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677708385] [2019-12-18 13:53:46,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:46,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:46,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677708385] [2019-12-18 13:53:46,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:46,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 13:53:46,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974066107] [2019-12-18 13:53:46,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:53:46,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:46,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:53:46,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:53:46,723 INFO L87 Difference]: Start difference. First operand 25356 states and 77865 transitions. Second operand 10 states. [2019-12-18 13:53:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:47,917 INFO L93 Difference]: Finished difference Result 36221 states and 108843 transitions. [2019-12-18 13:53:47,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 13:53:47,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:53:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:47,967 INFO L225 Difference]: With dead ends: 36221 [2019-12-18 13:53:47,967 INFO L226 Difference]: Without dead ends: 35993 [2019-12-18 13:53:47,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:53:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2019-12-18 13:53:48,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 27274. [2019-12-18 13:53:48,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27274 states. [2019-12-18 13:53:48,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27274 states to 27274 states and 83334 transitions. [2019-12-18 13:53:48,734 INFO L78 Accepts]: Start accepts. Automaton has 27274 states and 83334 transitions. Word has length 67 [2019-12-18 13:53:48,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:48,734 INFO L462 AbstractCegarLoop]: Abstraction has 27274 states and 83334 transitions. [2019-12-18 13:53:48,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:53:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 27274 states and 83334 transitions. [2019-12-18 13:53:48,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:48,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:48,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:48,765 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:48,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:48,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1799686927, now seen corresponding path program 1 times [2019-12-18 13:53:48,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:48,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163146719] [2019-12-18 13:53:48,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:48,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163146719] [2019-12-18 13:53:48,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:48,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 13:53:48,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032099042] [2019-12-18 13:53:48,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 13:53:48,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 13:53:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 13:53:48,911 INFO L87 Difference]: Start difference. First operand 27274 states and 83334 transitions. Second operand 10 states. [2019-12-18 13:53:51,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:51,005 INFO L93 Difference]: Finished difference Result 56883 states and 175396 transitions. [2019-12-18 13:53:51,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 13:53:51,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 13:53:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:51,090 INFO L225 Difference]: With dead ends: 56883 [2019-12-18 13:53:51,090 INFO L226 Difference]: Without dead ends: 56883 [2019-12-18 13:53:51,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2019-12-18 13:53:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56883 states. [2019-12-18 13:53:51,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56883 to 28861. [2019-12-18 13:53:51,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28861 states. [2019-12-18 13:53:51,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28861 states to 28861 states and 88463 transitions. [2019-12-18 13:53:51,778 INFO L78 Accepts]: Start accepts. Automaton has 28861 states and 88463 transitions. Word has length 67 [2019-12-18 13:53:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:51,778 INFO L462 AbstractCegarLoop]: Abstraction has 28861 states and 88463 transitions. [2019-12-18 13:53:51,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 13:53:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28861 states and 88463 transitions. [2019-12-18 13:53:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:51,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:51,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:51,812 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:51,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:51,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1038037876, now seen corresponding path program 1 times [2019-12-18 13:53:51,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:51,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847167889] [2019-12-18 13:53:51,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:53:51,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:53:51,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847167889] [2019-12-18 13:53:51,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:53:51,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:53:51,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245300231] [2019-12-18 13:53:51,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:53:51,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:53:51,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:53:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:53:51,910 INFO L87 Difference]: Start difference. First operand 28861 states and 88463 transitions. Second operand 5 states. [2019-12-18 13:53:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:53:52,116 INFO L93 Difference]: Finished difference Result 28706 states and 87742 transitions. [2019-12-18 13:53:52,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:53:52,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 13:53:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:53:52,170 INFO L225 Difference]: With dead ends: 28706 [2019-12-18 13:53:52,171 INFO L226 Difference]: Without dead ends: 28706 [2019-12-18 13:53:52,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:53:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28706 states. [2019-12-18 13:53:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28706 to 22922. [2019-12-18 13:53:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22922 states. [2019-12-18 13:53:52,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22922 states to 22922 states and 69455 transitions. [2019-12-18 13:53:52,592 INFO L78 Accepts]: Start accepts. Automaton has 22922 states and 69455 transitions. Word has length 67 [2019-12-18 13:53:52,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:53:52,592 INFO L462 AbstractCegarLoop]: Abstraction has 22922 states and 69455 transitions. [2019-12-18 13:53:52,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:53:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 22922 states and 69455 transitions. [2019-12-18 13:53:52,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 13:53:52,619 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:53:52,619 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:53:52,619 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:53:52,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:53:52,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 1 times [2019-12-18 13:53:52,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:53:52,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827955034] [2019-12-18 13:53:52,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:53:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:53:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:53:52,766 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:53:52,767 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:53:52,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26| 1)) (= v_~z$w_buff0_used~0_958 0) (= v_~x~0_72 0) (= v_~z$r_buff0_thd2~0_111 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= v_~z$r_buff1_thd0~0_129 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1385~0.base_26| 4)) (= v_~z$w_buff1_used~0_531 0) (= v_~y~0_19 0) (= |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_39 0) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_104 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_26|) |v_ULTIMATE.start_main_~#t1385~0.offset_19| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_53) (= (select .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_26|) 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1385~0.base_26|) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_24) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_13 0) (= v_~z~0_174 0) (= 0 v_~__unbuffered_cnt~0_91) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~weak$$choice2~0_107 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_85|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_53, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ~z$flush_delayed~0=v_~z$flush_delayed~0_24, ULTIMATE.start_main_~#t1385~0.offset=|v_ULTIMATE.start_main_~#t1385~0.offset_19|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_72, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_23|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_129, ~y~0=v_~y~0_19, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_19|, ULTIMATE.start_main_~#t1385~0.base=|v_ULTIMATE.start_main_~#t1385~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_174, ~weak$$choice2~0=v_~weak$$choice2~0_107, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1387~0.offset, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1387~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1386~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1385~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1385~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 13:53:52,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9|) |v_ULTIMATE.start_main_~#t1386~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9| 1)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1386~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1386~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1386~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1386~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_9|, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_~#t1386~0.offset] because there is no mapped edge [2019-12-18 13:53:52,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1302662032|) (= 0 (mod ~z$w_buff1_used~0_Out-1302662032 256)) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1302662032| P0Thread1of1ForFork0_~arg.offset_Out-1302662032) (= ~z$w_buff0~0_Out-1302662032 1) (= 1 ~z$w_buff0_used~0_Out-1302662032) (= ~z$w_buff1_used~0_Out-1302662032 ~z$w_buff0_used~0_In-1302662032) (= |P0Thread1of1ForFork0_#in~arg.base_In-1302662032| P0Thread1of1ForFork0_~arg.base_Out-1302662032) (= ~z$w_buff1~0_Out-1302662032 ~z$w_buff0~0_In-1302662032) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1302662032 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1302662032|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1302662032|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1302662032, ~z$w_buff0~0=~z$w_buff0~0_In-1302662032, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1302662032|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1302662032|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1302662032, ~z$w_buff0~0=~z$w_buff0~0_Out-1302662032, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1302662032, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1302662032, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1302662032|, ~z$w_buff1~0=~z$w_buff1~0_Out-1302662032, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1302662032, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1302662032|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1302662032} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 13:53:52,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1387~0.base_11|) (= |v_ULTIMATE.start_main_~#t1387~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t1387~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11|) |v_ULTIMATE.start_main_~#t1387~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1387~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1387~0.offset, #length, ULTIMATE.start_main_~#t1387~0.base] because there is no mapped edge [2019-12-18 13:53:52,775 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In-654900442 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-654900442| |P1Thread1of1ForFork1_#t~ite10_Out-654900442|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-654900442 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-654900442| ~z~0_In-654900442) (or .cse1 .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-654900442| ~z$w_buff1~0_In-654900442) (not .cse2) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-654900442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-654900442, ~z$w_buff1~0=~z$w_buff1~0_In-654900442, ~z~0=~z~0_In-654900442} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-654900442|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-654900442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-654900442, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-654900442|, ~z$w_buff1~0=~z$w_buff1~0_In-654900442, ~z~0=~z~0_In-654900442} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 13:53:52,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1705545434 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1705545434 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1705545434|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1705545434| ~z$w_buff0_used~0_In1705545434)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1705545434, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1705545434} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1705545434, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1705545434|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1705545434} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 13:53:52,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-384856963 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-384856963 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-384856963 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-384856963 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out-384856963| ~z$w_buff1_used~0_In-384856963)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out-384856963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-384856963, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-384856963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-384856963, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-384856963} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-384856963, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-384856963, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-384856963, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-384856963|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-384856963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 13:53:52,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In184088645 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In184088645 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out184088645| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out184088645| ~z$r_buff0_thd2~0_In184088645)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In184088645, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In184088645} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In184088645, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out184088645|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In184088645} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 13:53:52,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2110076485 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-2110076485| |P2Thread1of1ForFork2_#t~ite23_Out-2110076485|) (= ~z$w_buff1~0_In-2110076485 |P2Thread1of1ForFork2_#t~ite24_Out-2110076485|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2110076485 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-2110076485 256)) .cse1) (and (= 0 (mod ~z$w_buff1_used~0_In-2110076485 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-2110076485 256)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite24_Out-2110076485| |P2Thread1of1ForFork2_#t~ite23_Out-2110076485|) (= ~z$w_buff1~0_In-2110076485 |P2Thread1of1ForFork2_#t~ite23_Out-2110076485|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-2110076485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110076485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2110076485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2110076485, ~z$w_buff1~0=~z$w_buff1~0_In-2110076485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2110076485, ~weak$$choice2~0=~weak$$choice2~0_In-2110076485} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-2110076485|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-2110076485|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2110076485, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2110076485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2110076485, ~z$w_buff1~0=~z$w_buff1~0_In-2110076485, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2110076485, ~weak$$choice2~0=~weak$$choice2~0_In-2110076485} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:53:52,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2115435012 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out-2115435012| |P2Thread1of1ForFork2_#t~ite27_Out-2115435012|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-2115435012 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-2115435012 256)) .cse0) (and .cse0 (= (mod ~z$w_buff1_used~0_In-2115435012 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-2115435012 256)))) (= |P2Thread1of1ForFork2_#t~ite26_Out-2115435012| ~z$w_buff0_used~0_In-2115435012) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-2115435012| ~z$w_buff0_used~0_In-2115435012) (= |P2Thread1of1ForFork2_#t~ite26_In-2115435012| |P2Thread1of1ForFork2_#t~ite26_Out-2115435012|) (not .cse1)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-2115435012|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115435012, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2115435012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115435012, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2115435012, ~weak$$choice2~0=~weak$$choice2~0_In-2115435012} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-2115435012|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2115435012, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2115435012, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2115435012, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2115435012, ~weak$$choice2~0=~weak$$choice2~0_In-2115435012, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-2115435012|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 13:53:52,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In43253077 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In43253077 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In43253077 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In43253077 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out43253077| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out43253077| ~z$r_buff1_thd2~0_In43253077)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In43253077, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In43253077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43253077, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In43253077} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In43253077, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In43253077, ~z$w_buff1_used~0=~z$w_buff1_used~0_In43253077, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out43253077|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In43253077} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 13:53:52,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 13:53:52,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-414568735 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-414568735| |P2Thread1of1ForFork2_#t~ite29_Out-414568735|) (= ~z$w_buff1_used~0_In-414568735 |P2Thread1of1ForFork2_#t~ite30_Out-414568735|)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-414568735| ~z$w_buff1_used~0_In-414568735) (= |P2Thread1of1ForFork2_#t~ite29_Out-414568735| |P2Thread1of1ForFork2_#t~ite30_Out-414568735|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-414568735 256)))) (or (and (= 0 (mod ~z$r_buff1_thd3~0_In-414568735 256)) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-414568735 256)) (and (= (mod ~z$w_buff1_used~0_In-414568735 256) 0) .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-414568735, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-414568735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-414568735, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-414568735, ~weak$$choice2~0=~weak$$choice2~0_In-414568735, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-414568735|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-414568735|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-414568735, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-414568735, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-414568735, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-414568735, ~weak$$choice2~0=~weak$$choice2~0_In-414568735, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-414568735|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 13:53:52,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:53:52,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 13:53:52,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2105602393 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2105602393 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2105602393 |P0Thread1of1ForFork0_#t~ite5_Out-2105602393|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2105602393|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105602393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2105602393} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2105602393|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2105602393, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2105602393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 13:53:52,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2121067564 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In2121067564 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2121067564 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In2121067564 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out2121067564| 0)) (and (= ~z$w_buff1_used~0_In2121067564 |P0Thread1of1ForFork0_#t~ite6_Out2121067564|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2121067564, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121067564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121067564, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121067564} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2121067564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2121067564, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In2121067564, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2121067564, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2121067564} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 13:53:52,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-688372474 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-688372474 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-688372474 ~z$r_buff0_thd1~0_In-688372474) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out-688372474 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-688372474, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-688372474} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-688372474, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-688372474|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-688372474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 13:53:52,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1151941120 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1151941120 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1151941120 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1151941120 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In-1151941120 |P0Thread1of1ForFork0_#t~ite8_Out-1151941120|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1151941120|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151941120, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1151941120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151941120, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1151941120} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151941120, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1151941120|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1151941120, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151941120, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1151941120} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 13:53:52,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:53:52,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-237183942 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-237183942 256) 0)) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-237183942| |P2Thread1of1ForFork2_#t~ite38_Out-237183942|))) (or (and .cse0 (= ~z~0_In-237183942 |P2Thread1of1ForFork2_#t~ite38_Out-237183942|) (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= ~z$w_buff1~0_In-237183942 |P2Thread1of1ForFork2_#t~ite38_Out-237183942|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-237183942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-237183942, ~z$w_buff1~0=~z$w_buff1~0_In-237183942, ~z~0=~z~0_In-237183942} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-237183942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-237183942, ~z$w_buff1~0=~z$w_buff1~0_In-237183942, ~z~0=~z~0_In-237183942, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-237183942|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-237183942|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 13:53:52,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-258218712 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-258218712 256)))) (or (and (= ~z$w_buff0_used~0_In-258218712 |P2Thread1of1ForFork2_#t~ite40_Out-258218712|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-258218712|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-258218712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-258218712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-258218712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-258218712, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-258218712|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 13:53:52,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In786688965 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In786688965 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In786688965 256))) (.cse1 (= (mod ~z$r_buff1_thd3~0_In786688965 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out786688965| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out786688965| ~z$w_buff1_used~0_In786688965)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In786688965, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In786688965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In786688965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In786688965} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out786688965|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In786688965, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In786688965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In786688965, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In786688965} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 13:53:52,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In948498375 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In948498375 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out948498375|) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In948498375 |P2Thread1of1ForFork2_#t~ite42_Out948498375|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In948498375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In948498375} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out948498375|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In948498375, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In948498375} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 13:53:52,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-946731244 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-946731244 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-946731244 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-946731244 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-946731244| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-946731244 |P2Thread1of1ForFork2_#t~ite43_Out-946731244|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-946731244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-946731244, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946731244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-946731244} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-946731244, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-946731244, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-946731244|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-946731244, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-946731244} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 13:53:52,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 13:53:52,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:53:52,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-1579598219| |ULTIMATE.start_main_#t~ite48_Out-1579598219|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1579598219 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1579598219 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1579598219| ~z$w_buff1~0_In-1579598219) (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1579598219| ~z~0_In-1579598219) .cse0 (or .cse1 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1579598219, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1579598219, ~z$w_buff1~0=~z$w_buff1~0_In-1579598219, ~z~0=~z~0_In-1579598219} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1579598219, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1579598219|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1579598219, ~z$w_buff1~0=~z$w_buff1~0_In-1579598219, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1579598219|, ~z~0=~z~0_In-1579598219} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 13:53:52,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1202693381 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1202693381 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1202693381|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1202693381 |ULTIMATE.start_main_#t~ite49_Out-1202693381|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202693381, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202693381} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1202693381, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1202693381, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1202693381|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 13:53:52,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1586594896 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1586594896 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1586594896 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1586594896 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1586594896| 0)) (and (= |ULTIMATE.start_main_#t~ite50_Out-1586594896| ~z$w_buff1_used~0_In-1586594896) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1586594896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586594896, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1586594896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1586594896} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1586594896|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1586594896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586594896, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1586594896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1586594896} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 13:53:52,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1676151212 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1676151212 256)))) (or (and (= ~z$r_buff0_thd0~0_In1676151212 |ULTIMATE.start_main_#t~ite51_Out1676151212|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1676151212|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676151212, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676151212} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1676151212, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1676151212|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1676151212} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 13:53:52,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1478967818 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1478967818 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1478967818 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1478967818 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1478967818| ~z$r_buff1_thd0~0_In-1478967818)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-1478967818| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478967818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478967818, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1478967818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1478967818} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1478967818|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1478967818, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1478967818, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1478967818, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1478967818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 13:53:52,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_21 0) (= 0 v_~__unbuffered_p2_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_23) (= |v_ULTIMATE.start_main_#t~ite52_50| v_~z$r_buff1_thd0~0_94) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~x~0_47 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_50|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_49|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_94, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_28, ~x~0=v_~x~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:53:52,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:53:52 BasicIcfg [2019-12-18 13:53:52,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:53:52,907 INFO L168 Benchmark]: Toolchain (without parser) took 104507.50 ms. Allocated memory was 137.9 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 100.1 MB in the beginning and 858.2 MB in the end (delta: -758.1 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,908 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 794.69 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.39 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,915 INFO L168 Benchmark]: Boogie Preprocessor took 60.34 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,916 INFO L168 Benchmark]: RCFGBuilder took 848.80 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 100.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,916 INFO L168 Benchmark]: TraceAbstraction took 102726.76 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.7 MB in the beginning and 858.2 MB in the end (delta: -758.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-18 13:53:52,918 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 794.69 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 99.9 MB in the beginning and 155.0 MB in the end (delta: -55.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.39 ms. Allocated memory is still 200.8 MB. Free memory was 155.0 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.34 ms. Allocated memory is still 200.8 MB. Free memory was 152.3 MB in the beginning and 150.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 848.80 ms. Allocated memory is still 200.8 MB. Free memory was 150.3 MB in the beginning and 100.4 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102726.76 ms. Allocated memory was 200.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.7 MB in the beginning and 858.2 MB in the end (delta: -758.4 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7186 VarBasedMoverChecksPositive, 380 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1385, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1386, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 102.3s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6346 SDtfs, 8173 SDslu, 20003 SDs, 0 SdLazy, 10271 SolverSat, 397 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 60 SyntacticMatches, 23 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred 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: 42.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 302358 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1693 NumberOfCodeBlocks, 1693 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1595 ConstructedInterpolants, 0 QuantifiedInterpolants, 353227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...