/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:47:51,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:47:51,104 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:47:51,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:47:51,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:47:51,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:47:51,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:47:51,136 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:47:51,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:47:51,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:47:51,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:47:51,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:47:51,146 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:47:51,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:47:51,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:47:51,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:47:51,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:47:51,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:47:51,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:47:51,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:47:51,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:47:51,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:47:51,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:47:51,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:47:51,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:47:51,170 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:47:51,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:47:51,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:47:51,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:47:51,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:47:51,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:47:51,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:47:51,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:47:51,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:47:51,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:47:51,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:47:51,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:47:51,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:47:51,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:47:51,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:47:51,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:47:51,182 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:47:51,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:47:51,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:47:51,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:47:51,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:47:51,212 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:47:51,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:47:51,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:47:51,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:47:51,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:47:51,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:47:51,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:47:51,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:47:51,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:47:51,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:47:51,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:47:51,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:47:51,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:47:51,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:47:51,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:47:51,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:47:51,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:47:51,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:47:51,217 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:47:51,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:47:51,217 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:47:51,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:47:51,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:47:51,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:47:51,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:47:51,528 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:47:51,528 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:47:51,529 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 18:47:51,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d3b424e/da8550918fd5429b8fb4871f3ad7dc84/FLAG83154ff96 [2019-12-27 18:47:52,104 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:47:52,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_pso.oepc.i [2019-12-27 18:47:52,125 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d3b424e/da8550918fd5429b8fb4871f3ad7dc84/FLAG83154ff96 [2019-12-27 18:47:52,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7d3b424e/da8550918fd5429b8fb4871f3ad7dc84 [2019-12-27 18:47:52,453 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:47:52,455 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:47:52,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:47:52,456 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:47:52,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:47:52,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:47:52" (1/1) ... [2019-12-27 18:47:52,462 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1e95ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:52, skipping insertion in model container [2019-12-27 18:47:52,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:47:52" (1/1) ... [2019-12-27 18:47:52,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:47:52,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:47:53,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:47:53,115 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:47:53,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:47:53,253 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:47:53,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53 WrapperNode [2019-12-27 18:47:53,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:47:53,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:47:53,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:47:53,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:47:53,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:47:53,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:47:53,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:47:53,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:47:53,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... [2019-12-27 18:47:53,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:47:53,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:47:53,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:47:53,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:47:53,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:47:53,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:47:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:47:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:47:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:47:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:47:53,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:47:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:47:53,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:47:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:47:53,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:47:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:47:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:47:53,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:47:53,424 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:47:54,156 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:47:54,157 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:47:54,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:47:54 BoogieIcfgContainer [2019-12-27 18:47:54,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:47:54,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:47:54,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:47:54,164 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:47:54,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:47:52" (1/3) ... [2019-12-27 18:47:54,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee9b441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:47:54, skipping insertion in model container [2019-12-27 18:47:54,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:47:53" (2/3) ... [2019-12-27 18:47:54,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee9b441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:47:54, skipping insertion in model container [2019-12-27 18:47:54,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:47:54" (3/3) ... [2019-12-27 18:47:54,171 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_pso.oepc.i [2019-12-27 18:47:54,182 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:47:54,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:47:54,194 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:47:54,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:47:54,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,238 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,290 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,298 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,308 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,309 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,309 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,310 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,311 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,315 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,316 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,321 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,322 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,322 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,323 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,324 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,325 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,326 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:47:54,340 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:47:54,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:47:54,356 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:47:54,356 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:47:54,356 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:47:54,356 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:47:54,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:47:54,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:47:54,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:47:54,371 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 18:47:54,373 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:47:54,478 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:47:54,479 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:47:54,495 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:47:54,517 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:47:54,572 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:47:54,572 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:47:54,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:47:54,599 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:47:54,600 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:47:59,972 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:48:00,114 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:48:00,136 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-27 18:48:00,136 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:48:00,140 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:48:11,452 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-27 18:48:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-27 18:48:11,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:48:11,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:11,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:48:11,462 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:11,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-27 18:48:11,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:11,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813487556] [2019-12-27 18:48:11,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:11,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813487556] [2019-12-27 18:48:11,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:11,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:48:11,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1026688146] [2019-12-27 18:48:11,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:11,695 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:11,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:48:11,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:11,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:11,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:11,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:11,730 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-27 18:48:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:12,909 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-27 18:48:12,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:12,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:48:12,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:13,605 INFO L225 Difference]: With dead ends: 82272 [2019-12-27 18:48:13,605 INFO L226 Difference]: Without dead ends: 77232 [2019-12-27 18:48:13,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:19,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-27 18:48:21,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-27 18:48:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-27 18:48:24,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-27 18:48:24,166 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-27 18:48:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:24,166 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-27 18:48:24,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-27 18:48:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:24,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:24,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:24,175 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:24,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:24,176 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-27 18:48:24,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:24,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686842121] [2019-12-27 18:48:24,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:24,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686842121] [2019-12-27 18:48:24,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:24,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:24,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109041206] [2019-12-27 18:48:24,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:24,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:24,304 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:48:24,304 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:24,305 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:24,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:48:24,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:24,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:48:24,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:24,307 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-27 18:48:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:25,181 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-27 18:48:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:48:25,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:48:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:29,344 INFO L225 Difference]: With dead ends: 119112 [2019-12-27 18:48:29,345 INFO L226 Difference]: Without dead ends: 119007 [2019-12-27 18:48:29,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:48:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-27 18:48:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-27 18:48:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-27 18:48:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-27 18:48:36,350 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-27 18:48:36,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:36,352 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-27 18:48:36,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:48:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-27 18:48:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:36,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:36,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:36,356 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-27 18:48:36,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:36,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245007199] [2019-12-27 18:48:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:36,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245007199] [2019-12-27 18:48:36,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:36,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:36,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1984255317] [2019-12-27 18:48:36,414 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:36,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:36,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:48:36,417 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:36,417 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:36,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:36,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:36,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:36,419 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-27 18:48:36,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:36,546 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-27 18:48:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:36,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:48:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:36,624 INFO L225 Difference]: With dead ends: 27724 [2019-12-27 18:48:36,625 INFO L226 Difference]: Without dead ends: 27724 [2019-12-27 18:48:36,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-27 18:48:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-27 18:48:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-27 18:48:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-27 18:48:37,200 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-27 18:48:37,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:37,201 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-27 18:48:37,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-27 18:48:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:48:37,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:37,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:37,204 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-27 18:48:37,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:37,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470084021] [2019-12-27 18:48:37,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:37,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470084021] [2019-12-27 18:48:37,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:37,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:37,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1118516494] [2019-12-27 18:48:37,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:37,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:37,324 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:48:37,324 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:37,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:48:37,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:48:37,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:37,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:48:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:37,409 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 7 states. [2019-12-27 18:48:38,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:38,308 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-27 18:48:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:48:38,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 18:48:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:38,407 INFO L225 Difference]: With dead ends: 40807 [2019-12-27 18:48:38,407 INFO L226 Difference]: Without dead ends: 40789 [2019-12-27 18:48:38,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:48:38,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-27 18:48:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-27 18:48:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-27 18:48:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-27 18:48:39,041 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-27 18:48:39,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:39,042 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-27 18:48:39,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:48:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-27 18:48:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:48:39,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:39,052 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-27 18:48:39,053 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-27 18:48:39,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:39,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530313692] [2019-12-27 18:48:39,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:39,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530313692] [2019-12-27 18:48:39,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:39,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:39,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921371213] [2019-12-27 18:48:39,216 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:39,219 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:39,231 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 98 transitions. [2019-12-27 18:48:39,232 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:39,291 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:48:39,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:48:39,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:48:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:39,292 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 8 states. [2019-12-27 18:48:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:41,109 INFO L93 Difference]: Finished difference Result 100259 states and 328974 transitions. [2019-12-27 18:48:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:48:41,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 18:48:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:41,310 INFO L225 Difference]: With dead ends: 100259 [2019-12-27 18:48:41,310 INFO L226 Difference]: Without dead ends: 100206 [2019-12-27 18:48:41,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:48:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100206 states. [2019-12-27 18:48:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100206 to 46973. [2019-12-27 18:48:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46973 states. [2019-12-27 18:48:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46973 states to 46973 states and 156335 transitions. [2019-12-27 18:48:42,468 INFO L78 Accepts]: Start accepts. Automaton has 46973 states and 156335 transitions. Word has length 22 [2019-12-27 18:48:42,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:42,469 INFO L462 AbstractCegarLoop]: Abstraction has 46973 states and 156335 transitions. [2019-12-27 18:48:42,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:48:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 46973 states and 156335 transitions. [2019-12-27 18:48:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:48:42,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:42,484 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:42,484 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:42,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -350555304, now seen corresponding path program 2 times [2019-12-27 18:48:42,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:42,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153757426] [2019-12-27 18:48:42,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:42,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153757426] [2019-12-27 18:48:42,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:42,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:42,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [503857700] [2019-12-27 18:48:42,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:42,564 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:42,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:48:42,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:42,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:48:42,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:48:42,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:48:42,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:42,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:48:42,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:42,628 INFO L87 Difference]: Start difference. First operand 46973 states and 156335 transitions. Second operand 8 states. [2019-12-27 18:48:44,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:44,030 INFO L93 Difference]: Finished difference Result 71463 states and 232688 transitions. [2019-12-27 18:48:44,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:48:44,030 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 18:48:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:44,157 INFO L225 Difference]: With dead ends: 71463 [2019-12-27 18:48:44,157 INFO L226 Difference]: Without dead ends: 71441 [2019-12-27 18:48:44,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:48:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71441 states. [2019-12-27 18:48:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71441 to 42319. [2019-12-27 18:48:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42319 states. [2019-12-27 18:48:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42319 states to 42319 states and 141589 transitions. [2019-12-27 18:48:45,173 INFO L78 Accepts]: Start accepts. Automaton has 42319 states and 141589 transitions. Word has length 22 [2019-12-27 18:48:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:45,174 INFO L462 AbstractCegarLoop]: Abstraction has 42319 states and 141589 transitions. [2019-12-27 18:48:45,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:48:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 42319 states and 141589 transitions. [2019-12-27 18:48:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:48:45,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:45,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:45,189 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:45,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-27 18:48:45,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:45,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022116389] [2019-12-27 18:48:45,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:45,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:45,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022116389] [2019-12-27 18:48:45,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:45,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:45,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394312943] [2019-12-27 18:48:45,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:45,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:45,464 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:48:45,464 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:45,465 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:45,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:48:45,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:45,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:48:45,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:45,466 INFO L87 Difference]: Start difference. First operand 42319 states and 141589 transitions. Second operand 4 states. [2019-12-27 18:48:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:45,558 INFO L93 Difference]: Finished difference Result 17250 states and 53903 transitions. [2019-12-27 18:48:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:48:45,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:48:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:45,586 INFO L225 Difference]: With dead ends: 17250 [2019-12-27 18:48:45,587 INFO L226 Difference]: Without dead ends: 17250 [2019-12-27 18:48:45,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17250 states. [2019-12-27 18:48:45,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17250 to 16816. [2019-12-27 18:48:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16816 states. [2019-12-27 18:48:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16816 states to 16816 states and 52590 transitions. [2019-12-27 18:48:45,835 INFO L78 Accepts]: Start accepts. Automaton has 16816 states and 52590 transitions. Word has length 25 [2019-12-27 18:48:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:45,835 INFO L462 AbstractCegarLoop]: Abstraction has 16816 states and 52590 transitions. [2019-12-27 18:48:45,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:48:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 16816 states and 52590 transitions. [2019-12-27 18:48:45,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:48:45,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:45,858 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-27 18:48:45,858 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:45,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-27 18:48:45,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:45,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395850507] [2019-12-27 18:48:45,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:45,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395850507] [2019-12-27 18:48:45,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:45,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:45,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1485535524] [2019-12-27 18:48:45,931 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:45,938 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:45,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 18:48:45,964 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:45,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:45,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:45,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:45,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:45,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:45,966 INFO L87 Difference]: Start difference. First operand 16816 states and 52590 transitions. Second operand 3 states. [2019-12-27 18:48:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:46,083 INFO L93 Difference]: Finished difference Result 30574 states and 95374 transitions. [2019-12-27 18:48:46,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:46,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:48:46,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:46,109 INFO L225 Difference]: With dead ends: 30574 [2019-12-27 18:48:46,109 INFO L226 Difference]: Without dead ends: 16877 [2019-12-27 18:48:46,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2019-12-27 18:48:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 16618. [2019-12-27 18:48:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2019-12-27 18:48:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 50842 transitions. [2019-12-27 18:48:46,348 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 50842 transitions. Word has length 39 [2019-12-27 18:48:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:46,348 INFO L462 AbstractCegarLoop]: Abstraction has 16618 states and 50842 transitions. [2019-12-27 18:48:46,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 50842 transitions. [2019-12-27 18:48:46,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:48:46,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:46,379 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] [2019-12-27 18:48:46,380 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:46,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:46,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-27 18:48:46,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:46,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483678237] [2019-12-27 18:48:46,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:46,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483678237] [2019-12-27 18:48:46,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:46,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:46,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241421828] [2019-12-27 18:48:46,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:46,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:46,527 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 176 transitions. [2019-12-27 18:48:46,528 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:46,545 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:48:46,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:48:46,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:46,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:48:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:48:46,546 INFO L87 Difference]: Start difference. First operand 16618 states and 50842 transitions. Second operand 6 states. [2019-12-27 18:48:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:46,723 INFO L93 Difference]: Finished difference Result 15189 states and 47148 transitions. [2019-12-27 18:48:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:48:46,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:48:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:46,755 INFO L225 Difference]: With dead ends: 15189 [2019-12-27 18:48:46,756 INFO L226 Difference]: Without dead ends: 12770 [2019-12-27 18:48:46,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:46,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2019-12-27 18:48:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 11833. [2019-12-27 18:48:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11833 states. [2019-12-27 18:48:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11833 states to 11833 states and 37636 transitions. [2019-12-27 18:48:47,036 INFO L78 Accepts]: Start accepts. Automaton has 11833 states and 37636 transitions. Word has length 40 [2019-12-27 18:48:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:47,036 INFO L462 AbstractCegarLoop]: Abstraction has 11833 states and 37636 transitions. [2019-12-27 18:48:47,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:48:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 11833 states and 37636 transitions. [2019-12-27 18:48:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:47,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:47,061 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] [2019-12-27 18:48:47,061 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:47,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:47,062 INFO L82 PathProgramCache]: Analyzing trace with hash 612716425, now seen corresponding path program 1 times [2019-12-27 18:48:47,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:47,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861257509] [2019-12-27 18:48:47,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:47,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861257509] [2019-12-27 18:48:47,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:47,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:47,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157487767] [2019-12-27 18:48:47,120 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:47,136 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:47,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 18:48:47,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:47,458 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:48:47,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:47,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:47,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:47,459 INFO L87 Difference]: Start difference. First operand 11833 states and 37636 transitions. Second operand 3 states. [2019-12-27 18:48:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:47,556 INFO L93 Difference]: Finished difference Result 14492 states and 44945 transitions. [2019-12-27 18:48:47,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:47,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:48:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:47,583 INFO L225 Difference]: With dead ends: 14492 [2019-12-27 18:48:47,583 INFO L226 Difference]: Without dead ends: 14492 [2019-12-27 18:48:47,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2019-12-27 18:48:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 10563. [2019-12-27 18:48:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10563 states. [2019-12-27 18:48:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 32977 transitions. [2019-12-27 18:48:47,771 INFO L78 Accepts]: Start accepts. Automaton has 10563 states and 32977 transitions. Word has length 54 [2019-12-27 18:48:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:47,771 INFO L462 AbstractCegarLoop]: Abstraction has 10563 states and 32977 transitions. [2019-12-27 18:48:47,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 10563 states and 32977 transitions. [2019-12-27 18:48:47,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:47,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:47,784 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] [2019-12-27 18:48:47,784 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:47,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:47,784 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-27 18:48:47,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:47,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85344777] [2019-12-27 18:48:47,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:47,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85344777] [2019-12-27 18:48:47,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:47,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:48:47,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1188851695] [2019-12-27 18:48:47,866 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:47,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:48,062 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 18:48:48,063 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:48,155 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:48:48,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:48:48,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:48:48,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:48,156 INFO L87 Difference]: Start difference. First operand 10563 states and 32977 transitions. Second operand 8 states. [2019-12-27 18:48:49,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:49,417 INFO L93 Difference]: Finished difference Result 69168 states and 212624 transitions. [2019-12-27 18:48:49,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 18:48:49,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 18:48:49,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:49,498 INFO L225 Difference]: With dead ends: 69168 [2019-12-27 18:48:49,498 INFO L226 Difference]: Without dead ends: 49095 [2019-12-27 18:48:49,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:48:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49095 states. [2019-12-27 18:48:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49095 to 17341. [2019-12-27 18:48:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17341 states. [2019-12-27 18:48:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17341 states to 17341 states and 54573 transitions. [2019-12-27 18:48:50,247 INFO L78 Accepts]: Start accepts. Automaton has 17341 states and 54573 transitions. Word has length 54 [2019-12-27 18:48:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:50,248 INFO L462 AbstractCegarLoop]: Abstraction has 17341 states and 54573 transitions. [2019-12-27 18:48:50,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:48:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17341 states and 54573 transitions. [2019-12-27 18:48:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:50,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:50,267 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] [2019-12-27 18:48:50,268 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-27 18:48:50,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:50,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970988200] [2019-12-27 18:48:50,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:50,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970988200] [2019-12-27 18:48:50,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:50,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:48:50,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190652143] [2019-12-27 18:48:50,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:50,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:50,577 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 381 transitions. [2019-12-27 18:48:50,577 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:50,590 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:48:50,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:48:50,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:48:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:50,592 INFO L87 Difference]: Start difference. First operand 17341 states and 54573 transitions. Second operand 7 states. [2019-12-27 18:48:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:51,251 INFO L93 Difference]: Finished difference Result 45504 states and 140069 transitions. [2019-12-27 18:48:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:48:51,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:48:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:51,327 INFO L225 Difference]: With dead ends: 45504 [2019-12-27 18:48:51,327 INFO L226 Difference]: Without dead ends: 33941 [2019-12-27 18:48:51,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:48:51,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33941 states. [2019-12-27 18:48:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33941 to 20537. [2019-12-27 18:48:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20537 states. [2019-12-27 18:48:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20537 states to 20537 states and 64676 transitions. [2019-12-27 18:48:51,856 INFO L78 Accepts]: Start accepts. Automaton has 20537 states and 64676 transitions. Word has length 54 [2019-12-27 18:48:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 20537 states and 64676 transitions. [2019-12-27 18:48:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:48:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 20537 states and 64676 transitions. [2019-12-27 18:48:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:51,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:51,882 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] [2019-12-27 18:48:51,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-27 18:48:51,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:51,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616405788] [2019-12-27 18:48:51,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:51,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616405788] [2019-12-27 18:48:51,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:51,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:48:51,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1481688662] [2019-12-27 18:48:51,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:52,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:52,158 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 277 transitions. [2019-12-27 18:48:52,159 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:52,593 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-27 18:48:52,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:48:52,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:48:52,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:52,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:48:52,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:48:52,694 INFO L87 Difference]: Start difference. First operand 20537 states and 64676 transitions. Second operand 11 states. [2019-12-27 18:48:56,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:56,283 INFO L93 Difference]: Finished difference Result 102067 states and 310412 transitions. [2019-12-27 18:48:56,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:48:56,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 18:48:56,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:56,411 INFO L225 Difference]: With dead ends: 102067 [2019-12-27 18:48:56,411 INFO L226 Difference]: Without dead ends: 80441 [2019-12-27 18:48:56,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:48:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80441 states. [2019-12-27 18:48:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80441 to 22410. [2019-12-27 18:48:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22410 states. [2019-12-27 18:48:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22410 states to 22410 states and 70911 transitions. [2019-12-27 18:48:57,626 INFO L78 Accepts]: Start accepts. Automaton has 22410 states and 70911 transitions. Word has length 54 [2019-12-27 18:48:57,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:57,626 INFO L462 AbstractCegarLoop]: Abstraction has 22410 states and 70911 transitions. [2019-12-27 18:48:57,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:48:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 22410 states and 70911 transitions. [2019-12-27 18:48:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:57,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:57,661 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] [2019-12-27 18:48:57,661 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-27 18:48:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872286927] [2019-12-27 18:48:57,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:57,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872286927] [2019-12-27 18:48:57,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:57,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:57,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169169831] [2019-12-27 18:48:57,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:57,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:57,841 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 254 transitions. [2019-12-27 18:48:57,841 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:57,845 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:48:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:57,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:57,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:57,846 INFO L87 Difference]: Start difference. First operand 22410 states and 70911 transitions. Second operand 3 states. [2019-12-27 18:48:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:57,943 INFO L93 Difference]: Finished difference Result 23994 states and 73760 transitions. [2019-12-27 18:48:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:57,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:48:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:57,976 INFO L225 Difference]: With dead ends: 23994 [2019-12-27 18:48:57,976 INFO L226 Difference]: Without dead ends: 23994 [2019-12-27 18:48:57,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:58,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2019-12-27 18:48:58,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 18165. [2019-12-27 18:48:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-12-27 18:48:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 56191 transitions. [2019-12-27 18:48:58,296 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 56191 transitions. Word has length 54 [2019-12-27 18:48:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:58,296 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 56191 transitions. [2019-12-27 18:48:58,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 56191 transitions. [2019-12-27 18:48:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:58,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:58,316 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] [2019-12-27 18:48:58,316 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-27 18:48:58,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:58,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980245081] [2019-12-27 18:48:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:58,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980245081] [2019-12-27 18:48:58,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:58,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:48:58,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2034203090] [2019-12-27 18:48:58,402 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:58,417 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:58,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 315 transitions. [2019-12-27 18:48:58,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:58,600 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:48:58,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:48:58,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:48:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:58,601 INFO L87 Difference]: Start difference. First operand 18165 states and 56191 transitions. Second operand 7 states. [2019-12-27 18:48:59,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:59,025 INFO L93 Difference]: Finished difference Result 36930 states and 110528 transitions. [2019-12-27 18:48:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:48:59,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:48:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:59,096 INFO L225 Difference]: With dead ends: 36930 [2019-12-27 18:48:59,096 INFO L226 Difference]: Without dead ends: 31428 [2019-12-27 18:48:59,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:48:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31428 states. [2019-12-27 18:48:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31428 to 18321. [2019-12-27 18:48:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18321 states. [2019-12-27 18:48:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 56621 transitions. [2019-12-27 18:48:59,840 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 56621 transitions. Word has length 54 [2019-12-27 18:48:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:59,841 INFO L462 AbstractCegarLoop]: Abstraction has 18321 states and 56621 transitions. [2019-12-27 18:48:59,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:48:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 56621 transitions. [2019-12-27 18:48:59,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:48:59,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:59,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] [2019-12-27 18:48:59,861 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:48:59,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-27 18:48:59,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:59,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158402228] [2019-12-27 18:48:59,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:48:59,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158402228] [2019-12-27 18:48:59,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:59,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:59,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [864809984] [2019-12-27 18:48:59,992 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:00,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:00,254 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 18:49:00,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:00,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:00,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:00,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:00,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:00,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:00,257 INFO L87 Difference]: Start difference. First operand 18321 states and 56621 transitions. Second operand 3 states. [2019-12-27 18:49:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:00,352 INFO L93 Difference]: Finished difference Result 15568 states and 47089 transitions. [2019-12-27 18:49:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:00,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:49:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:00,382 INFO L225 Difference]: With dead ends: 15568 [2019-12-27 18:49:00,383 INFO L226 Difference]: Without dead ends: 15568 [2019-12-27 18:49:00,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-12-27 18:49:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 15026. [2019-12-27 18:49:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15026 states. [2019-12-27 18:49:00,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15026 states to 15026 states and 45411 transitions. [2019-12-27 18:49:00,666 INFO L78 Accepts]: Start accepts. Automaton has 15026 states and 45411 transitions. Word has length 54 [2019-12-27 18:49:00,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:00,666 INFO L462 AbstractCegarLoop]: Abstraction has 15026 states and 45411 transitions. [2019-12-27 18:49:00,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 15026 states and 45411 transitions. [2019-12-27 18:49:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:49:00,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:00,681 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] [2019-12-27 18:49:00,681 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:00,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:00,681 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-27 18:49:00,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:00,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413609929] [2019-12-27 18:49:00,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:00,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413609929] [2019-12-27 18:49:00,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:00,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:00,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1043560548] [2019-12-27 18:49:00,787 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:00,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:00,944 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 258 transitions. [2019-12-27 18:49:00,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:00,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:00,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:00,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:00,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:00,946 INFO L87 Difference]: Start difference. First operand 15026 states and 45411 transitions. Second operand 3 states. [2019-12-27 18:49:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:01,035 INFO L93 Difference]: Finished difference Result 15026 states and 45409 transitions. [2019-12-27 18:49:01,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:01,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:49:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:01,070 INFO L225 Difference]: With dead ends: 15026 [2019-12-27 18:49:01,070 INFO L226 Difference]: Without dead ends: 15026 [2019-12-27 18:49:01,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15026 states. [2019-12-27 18:49:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15026 to 13497. [2019-12-27 18:49:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-12-27 18:49:01,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 41162 transitions. [2019-12-27 18:49:01,476 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 41162 transitions. Word has length 55 [2019-12-27 18:49:01,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:01,477 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 41162 transitions. [2019-12-27 18:49:01,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:01,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 41162 transitions. [2019-12-27 18:49:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:49:01,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:01,498 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] [2019-12-27 18:49:01,498 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:49:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-27 18:49:01,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:01,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81131707] [2019-12-27 18:49:01,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:01,687 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:49:01,687 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:49:01,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2519~0.base_30|) |v_ULTIMATE.start_main_~#t2519~0.offset_17| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2519~0.base_30|) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2519~0.base_30| 4)) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 |v_ULTIMATE.start_main_~#t2519~0.offset_17|) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30|) 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$r_buff1_thd1~0_390 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2519~0.base_30| 1)) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_~#t2519~0.base=|v_ULTIMATE.start_main_~#t2519~0.base_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ULTIMATE.start_main_~#t2519~0.offset=|v_ULTIMATE.start_main_~#t2519~0.offset_17|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_24|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_24|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2519~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2519~0.offset, ULTIMATE.start_main_~#t2521~0.base, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2520~0.base, ULTIMATE.start_main_~#t2521~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2520~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:49:01,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2520~0.base_13| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2520~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13| 1)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2520~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2520~0.offset_11| 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2520~0.base_13|) |v_ULTIMATE.start_main_~#t2520~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t2520~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2520~0.offset=|v_ULTIMATE.start_main_~#t2520~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2520~0.base=|v_ULTIMATE.start_main_~#t2520~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2520~0.offset, ULTIMATE.start_main_~#t2520~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 18:49:01,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:49:01,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2521~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2521~0.base_13|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2521~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13| 1) |v_#valid_32|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2521~0.base_13|) |v_ULTIMATE.start_main_~#t2521~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2521~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2521~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2521~0.offset=|v_ULTIMATE.start_main_~#t2521~0.offset_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2521~0.base=|v_ULTIMATE.start_main_~#t2521~0.base_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2521~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2521~0.base, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:49:01,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1737176795 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1737176795 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1737176795| ~x~0_In-1737176795)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1737176795| ~x$w_buff1~0_In-1737176795) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1737176795, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1737176795, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1737176795, ~x~0=~x~0_In-1737176795} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1737176795|, ~x$w_buff1~0=~x$w_buff1~0_In-1737176795, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1737176795, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1737176795, ~x~0=~x~0_In-1737176795} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:49:01,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:49:01,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-111216896 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-111216896 256)))) (or (and (= ~x$w_buff0_used~0_In-111216896 |P2Thread1of1ForFork1_#t~ite34_Out-111216896|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-111216896|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-111216896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111216896} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-111216896|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-111216896, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111216896} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:49:01,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-852629737 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-852629737 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-852629737 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-852629737 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-852629737| ~x$w_buff1_used~0_In-852629737) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-852629737| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-852629737, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-852629737, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-852629737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-852629737} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-852629737|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-852629737, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-852629737, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-852629737, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-852629737} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:49:01,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-2068623291 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2068623291 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-2068623291|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd3~0_In-2068623291 |P2Thread1of1ForFork1_#t~ite36_Out-2068623291|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2068623291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068623291} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-2068623291|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2068623291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068623291} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:49:01,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1558919758 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1558919758 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1558919758 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1558919758 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1558919758| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite37_Out-1558919758| ~x$r_buff1_thd3~0_In-1558919758) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1558919758, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1558919758, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1558919758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1558919758} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1558919758|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1558919758, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1558919758, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1558919758, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1558919758} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:49:01,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:49:01,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-73348436 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out-73348436| |P0Thread1of1ForFork2_#t~ite12_Out-73348436|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-73348436 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-73348436 256) 0) .cse0) (and (= 0 (mod ~x$r_buff1_thd1~0_In-73348436 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-73348436 256)))) .cse1 (= |P0Thread1of1ForFork2_#t~ite11_Out-73348436| ~x$w_buff1~0_In-73348436)) (and (= |P0Thread1of1ForFork2_#t~ite11_In-73348436| |P0Thread1of1ForFork2_#t~ite11_Out-73348436|) (not .cse1) (= ~x$w_buff1~0_In-73348436 |P0Thread1of1ForFork2_#t~ite12_Out-73348436|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73348436, ~x$w_buff1~0=~x$w_buff1~0_In-73348436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73348436, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73348436, ~weak$$choice2~0=~weak$$choice2~0_In-73348436, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In-73348436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73348436} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-73348436, ~x$w_buff1~0=~x$w_buff1~0_In-73348436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-73348436, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-73348436, ~weak$$choice2~0=~weak$$choice2~0_In-73348436, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out-73348436|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out-73348436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-73348436} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:49:01,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1010675527 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In-1010675527| |P0Thread1of1ForFork2_#t~ite14_Out-1010675527|) (= ~x$w_buff0_used~0_In-1010675527 |P0Thread1of1ForFork2_#t~ite15_Out-1010675527|)) (and (= ~x$w_buff0_used~0_In-1010675527 |P0Thread1of1ForFork2_#t~ite14_Out-1010675527|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1010675527 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1010675527 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1010675527 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1010675527 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite15_Out-1010675527| |P0Thread1of1ForFork2_#t~ite14_Out-1010675527|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1010675527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1010675527, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1010675527, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1010675527|, ~weak$$choice2~0=~weak$$choice2~0_In-1010675527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1010675527} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1010675527, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1010675527, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1010675527|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1010675527, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1010675527|, ~weak$$choice2~0=~weak$$choice2~0_In-1010675527, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1010675527} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:49:01,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:49:01,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-65995321 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-65995321| ~x$r_buff1_thd1~0_In-65995321) (= |P0Thread1of1ForFork2_#t~ite23_In-65995321| |P0Thread1of1ForFork2_#t~ite23_Out-65995321|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-65995321| |P0Thread1of1ForFork2_#t~ite23_Out-65995321|) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-65995321| ~x$r_buff1_thd1~0_In-65995321) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-65995321 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-65995321 256)) (and (= (mod ~x$w_buff1_used~0_In-65995321 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In-65995321 256) 0) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-65995321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-65995321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-65995321, ~weak$$choice2~0=~weak$$choice2~0_In-65995321, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-65995321|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65995321} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-65995321, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-65995321, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-65995321, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-65995321|, ~weak$$choice2~0=~weak$$choice2~0_In-65995321, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-65995321|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-65995321} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:49:01,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:49:01,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1728837885 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1728837885 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1728837885 |P1Thread1of1ForFork0_#t~ite28_Out1728837885|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1728837885|) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1728837885, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728837885} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1728837885, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1728837885|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1728837885} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:49:01,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1255254455 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1255254455 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In1255254455 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1255254455 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1255254455|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1255254455| ~x$w_buff1_used~0_In1255254455) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1255254455, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1255254455, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1255254455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1255254455} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1255254455, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1255254455, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1255254455, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1255254455|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1255254455} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:49:01,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1628043037 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1628043037 256) 0))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1628043037) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_In1628043037 ~x$r_buff0_thd2~0_Out1628043037)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1628043037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1628043037} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1628043037|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1628043037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1628043037} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:49:01,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-363900650 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-363900650 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-363900650 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-363900650 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-363900650| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-363900650| ~x$r_buff1_thd2~0_In-363900650)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-363900650, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-363900650, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-363900650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363900650} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-363900650|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-363900650, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-363900650, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-363900650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-363900650} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:49:01,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:49:01,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:49:01,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite41_Out1287142951| |ULTIMATE.start_main_#t~ite42_Out1287142951|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1287142951 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1287142951 256)))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In1287142951 |ULTIMATE.start_main_#t~ite41_Out1287142951|) .cse2) (and (= |ULTIMATE.start_main_#t~ite41_Out1287142951| ~x~0_In1287142951) .cse2 (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1287142951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1287142951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1287142951, ~x~0=~x~0_In1287142951} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1287142951|, ~x$w_buff1~0=~x$w_buff1~0_In1287142951, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1287142951, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1287142951, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1287142951|, ~x~0=~x~0_In1287142951} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:49:01,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In179807262 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In179807262 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out179807262|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out179807262| ~x$w_buff0_used~0_In179807262) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In179807262, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179807262} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In179807262, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out179807262|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In179807262} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:49:01,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In665034882 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In665034882 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In665034882 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In665034882 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out665034882| ~x$w_buff1_used~0_In665034882)) (and (= |ULTIMATE.start_main_#t~ite44_Out665034882| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665034882, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665034882, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665034882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665034882} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In665034882, ~x$w_buff1_used~0=~x$w_buff1_used~0_In665034882, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In665034882, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out665034882|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In665034882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:49:01,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In992523715 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In992523715 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In992523715 |ULTIMATE.start_main_#t~ite45_Out992523715|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out992523715| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In992523715, ~x$w_buff0_used~0=~x$w_buff0_used~0_In992523715} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In992523715, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out992523715|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In992523715} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:49:01,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In1262264244 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1262264244 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1262264244 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1262264244 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out1262264244| ~x$r_buff1_thd0~0_In1262264244) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite46_Out1262264244| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1262264244, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1262264244, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1262264244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1262264244} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1262264244, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1262264244|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1262264244, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1262264244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1262264244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:49:01,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:49:01,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:49:01 BasicIcfg [2019-12-27 18:49:01,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:49:01,837 INFO L168 Benchmark]: Toolchain (without parser) took 69382.72 ms. Allocated memory was 145.8 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.6 MB in the beginning and 691.9 MB in the end (delta: -590.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,838 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 798.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,843 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.04 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,843 INFO L168 Benchmark]: Boogie Preprocessor took 36.18 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,846 INFO L168 Benchmark]: RCFGBuilder took 806.16 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 103.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,847 INFO L168 Benchmark]: TraceAbstraction took 67675.86 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 102.6 MB in the beginning and 691.9 MB in the end (delta: -589.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 18:49:01,853 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.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 798.89 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.4 MB in the beginning and 154.8 MB in the end (delta: -53.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.04 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.18 ms. Allocated memory is still 202.9 MB. Free memory was 152.1 MB in the beginning and 149.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.16 ms. Allocated memory is still 202.9 MB. Free memory was 149.5 MB in the beginning and 103.2 MB in the end (delta: 46.2 MB). Peak memory consumption was 46.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67675.86 ms. Allocated memory was 202.9 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 102.6 MB in the beginning and 691.9 MB in the end (delta: -589.3 MB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2519, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2520, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2521, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 67.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3424 SDtfs, 4374 SDslu, 8995 SDs, 0 SdLazy, 5181 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 72 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred 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: 26.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 228352 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...