/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:59:57,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:59:57,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:59:57,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:59:57,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:59:57,176 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:59:57,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:59:57,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:59:57,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:59:57,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:59:57,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:59:57,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:59:57,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:59:57,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:59:57,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:59:57,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:59:57,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:59:57,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:59:57,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:59:57,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:59:57,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:59:57,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:59:57,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:59:57,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:59:57,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:59:57,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:59:57,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:59:57,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:59:57,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:59:57,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:59:57,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:59:57,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:59:57,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:59:57,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:59:57,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:59:57,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:59:57,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:59:57,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:59:57,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:59:57,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:59:57,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:59:57,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:59:57,244 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:59:57,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:59:57,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:59:57,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:59:57,246 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:59:57,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:59:57,246 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:59:57,247 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:59:57,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:59:57,248 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:59:57,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:59:57,248 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:59:57,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:59:57,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:59:57,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:59:57,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:59:57,249 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:59:57,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:59:57,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:59:57,250 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:59:57,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:59:57,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:59:57,250 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:59:57,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:59:57,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:59:57,251 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:59:57,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:59:57,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:59:57,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:59:57,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:59:57,581 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:59:57,583 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:59:57,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 22:59:57,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a061b6bb/b38429c22e6a41acba1de79eb1d6ec04/FLAG27b99b74a [2019-12-27 22:59:58,209 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:59:58,210 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc.i [2019-12-27 22:59:58,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a061b6bb/b38429c22e6a41acba1de79eb1d6ec04/FLAG27b99b74a [2019-12-27 22:59:58,477 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a061b6bb/b38429c22e6a41acba1de79eb1d6ec04 [2019-12-27 22:59:58,488 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:59:58,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:59:58,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:59:58,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:59:58,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:59:58,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:59:58" (1/1) ... [2019-12-27 22:59:58,500 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:58, skipping insertion in model container [2019-12-27 22:59:58,500 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:59:58" (1/1) ... [2019-12-27 22:59:58,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:59:58,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:59:59,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:59:59,193 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:59:59,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:59:59,370 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:59:59,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59 WrapperNode [2019-12-27 22:59:59,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:59:59,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:59:59,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:59:59,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:59:59,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:59:59,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:59:59,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:59:59,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:59:59,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (1/1) ... [2019-12-27 22:59:59,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:59:59,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:59:59,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:59:59,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:59:59,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (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 22:59:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:59:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:59:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:59:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:59:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:59:59,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:59:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:59:59,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:59:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:59:59,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:59:59,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:59:59,552 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 23:00:00,218 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:00:00,219 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:00:00,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:00 BoogieIcfgContainer [2019-12-27 23:00:00,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:00:00,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:00:00,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:00:00,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:00:00,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:59:58" (1/3) ... [2019-12-27 23:00:00,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2524e615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:00, skipping insertion in model container [2019-12-27 23:00:00,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:59:59" (2/3) ... [2019-12-27 23:00:00,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2524e615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:00, skipping insertion in model container [2019-12-27 23:00:00,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:00" (3/3) ... [2019-12-27 23:00:00,229 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc.i [2019-12-27 23:00:00,240 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:00:00,240 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:00:00,248 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:00:00,249 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:00:00,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,288 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,289 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,307 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,308 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,309 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,310 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,313 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,313 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,314 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,314 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,315 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,315 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,316 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,317 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,318 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,332 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,333 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,334 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,336 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,337 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,338 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:00,356 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:00:00,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:00:00,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:00:00,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:00:00,378 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:00:00,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:00:00,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:00:00,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:00:00,394 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:00:00,410 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 23:00:00,412 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:00,530 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:00,530 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:00,544 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 23:00:00,557 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:00,631 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:00,631 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:00,639 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 23:00:00,655 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 23:00:00,656 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:00:03,609 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 23:00:03,789 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-27 23:00:03,789 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 23:00:03,792 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-27 23:00:04,123 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-27 23:00:04,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-27 23:00:04,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:00:04,132 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:04,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:00:04,133 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-27 23:00:04,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:04,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145434916] [2019-12-27 23:00:04,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:04,380 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 23:00:04,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145434916] [2019-12-27 23:00:04,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:04,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:00:04,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967359931] [2019-12-27 23:00:04,386 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:04,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:04,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:00:04,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:04,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:04,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:04,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:04,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:04,426 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-27 23:00:04,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:04,713 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 23:00:04,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:04,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 23:00:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:04,815 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 23:00:04,816 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 23:00:04,829 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 23:00:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 23:00:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 23:00:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 23:00:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 23:00:05,210 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 23:00:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:05,211 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 23:00:05,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 23:00:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 23:00:05,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:05,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:05,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:05,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-27 23:00:05,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:05,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102567096] [2019-12-27 23:00:05,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:05,341 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 23:00:05,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102567096] [2019-12-27 23:00:05,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:05,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:05,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1267449270] [2019-12-27 23:00:05,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:05,345 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:05,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 23:00:05,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:05,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:05,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:05,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:05,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:05,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:05,353 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 23:00:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:05,401 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 23:00:05,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:05,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 23:00:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:05,409 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 23:00:05,409 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 23:00:05,410 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 23:00:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 23:00:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 23:00:05,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 23:00:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 23:00:05,442 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 23:00:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:05,442 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 23:00:05,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 23:00:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:05,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:05,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:05,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:05,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:05,450 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-27 23:00:05,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:05,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609929423] [2019-12-27 23:00:05,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:05,587 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 23:00:05,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609929423] [2019-12-27 23:00:05,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:05,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:05,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948787622] [2019-12-27 23:00:05,591 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:05,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:05,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:05,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:05,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:05,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:05,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:05,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:05,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:05,676 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 5 states. [2019-12-27 23:00:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:05,827 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 23:00:05,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:05,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:05,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:05,837 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 23:00:05,838 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:00:05,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:00:05,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 23:00:05,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 23:00:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 23:00:05,887 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 23:00:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:05,888 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 23:00:05,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 23:00:05,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:05,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:05,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:05,890 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:05,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:05,890 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-27 23:00:05,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:05,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586392676] [2019-12-27 23:00:05,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:06,023 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 23:00:06,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586392676] [2019-12-27 23:00:06,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:06,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:06,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1638044906] [2019-12-27 23:00:06,024 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:06,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:06,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:06,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:06,055 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:06,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:06,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:06,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:06,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:06,056 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 5 states. [2019-12-27 23:00:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:06,256 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 23:00:06,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:06,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:06,267 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 23:00:06,267 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 23:00:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:00:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 23:00:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 23:00:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 23:00:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 23:00:06,311 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 23:00:06,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:06,314 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 23:00:06,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:06,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 23:00:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:06,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:06,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:06,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:06,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:06,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-27 23:00:06,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:06,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444514465] [2019-12-27 23:00:06,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:06,404 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 23:00:06,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444514465] [2019-12-27 23:00:06,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:06,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:06,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340943326] [2019-12-27 23:00:06,405 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:06,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:06,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:06,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:06,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:06,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:06,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:06,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:06,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:06,428 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 5 states. [2019-12-27 23:00:06,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:06,648 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 23:00:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:06,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:06,660 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 23:00:06,660 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 23:00:06,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 23:00:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 23:00:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 23:00:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 23:00:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 23:00:06,700 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 23:00:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:06,701 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 23:00:06,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 23:00:06,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:00:06,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:06,704 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] [2019-12-27 23:00:06,704 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:06,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-27 23:00:06,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:06,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838927859] [2019-12-27 23:00:06,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:06,751 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 23:00:06,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838927859] [2019-12-27 23:00:06,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:06,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:06,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1395544298] [2019-12-27 23:00:06,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:06,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:06,768 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 23:00:06,768 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:06,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:06,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:06,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:06,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:06,785 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-27 23:00:06,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:06,812 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 23:00:06,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:06,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 23:00:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:06,817 INFO L225 Difference]: With dead ends: 772 [2019-12-27 23:00:06,817 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 23:00:06,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:06,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 23:00:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 23:00:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 23:00:06,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 23:00:06,834 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 23:00:06,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:06,834 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 23:00:06,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:06,834 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 23:00:06,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:06,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:06,837 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] [2019-12-27 23:00:06,837 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-27 23:00:06,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:06,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849858029] [2019-12-27 23:00:06,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:06,902 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 23:00:06,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849858029] [2019-12-27 23:00:06,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:06,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:06,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [147597601] [2019-12-27 23:00:06,904 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:06,913 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:07,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 132 transitions. [2019-12-27 23:00:07,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:07,024 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:00:07,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:07,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:00:07,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:00:07,026 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 4 states. [2019-12-27 23:00:07,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:07,048 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 23:00:07,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:07,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 23:00:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:07,051 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 23:00:07,051 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 23:00:07,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 23:00:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 23:00:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 23:00:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 23:00:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 23:00:07,062 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 23:00:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:07,062 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 23:00:07,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:00:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 23:00:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:07,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:07,066 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] [2019-12-27 23:00:07,067 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:07,067 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-27 23:00:07,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:07,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200011961] [2019-12-27 23:00:07,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:07,166 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 23:00:07,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200011961] [2019-12-27 23:00:07,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:07,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:00:07,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1282804605] [2019-12-27 23:00:07,168 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:07,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:07,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 118 transitions. [2019-12-27 23:00:07,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:07,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:07,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:00:07,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:07,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:00:07,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:00:07,400 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 9 states. [2019-12-27 23:00:08,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:08,847 INFO L93 Difference]: Finished difference Result 1932 states and 4318 transitions. [2019-12-27 23:00:08,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:00:08,848 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 23:00:08,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:08,857 INFO L225 Difference]: With dead ends: 1932 [2019-12-27 23:00:08,857 INFO L226 Difference]: Without dead ends: 1257 [2019-12-27 23:00:08,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 23:00:08,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-27 23:00:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 615. [2019-12-27 23:00:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-27 23:00:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1397 transitions. [2019-12-27 23:00:08,876 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1397 transitions. Word has length 41 [2019-12-27 23:00:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:08,877 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 1397 transitions. [2019-12-27 23:00:08,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:00:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1397 transitions. [2019-12-27 23:00:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:08,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:08,879 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] [2019-12-27 23:00:08,880 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-27 23:00:08,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:08,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125225] [2019-12-27 23:00:08,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:09,004 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 23:00:09,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125225] [2019-12-27 23:00:09,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:09,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 23:00:09,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1931592510] [2019-12-27 23:00:09,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:09,014 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:09,043 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 127 transitions. [2019-12-27 23:00:09,044 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:09,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 23:00:09,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 23:00:09,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 23:00:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-27 23:00:09,268 INFO L87 Difference]: Start difference. First operand 615 states and 1397 transitions. Second operand 13 states. [2019-12-27 23:00:11,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:11,487 INFO L93 Difference]: Finished difference Result 1424 states and 2873 transitions. [2019-12-27 23:00:11,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:00:11,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-12-27 23:00:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:11,495 INFO L225 Difference]: With dead ends: 1424 [2019-12-27 23:00:11,495 INFO L226 Difference]: Without dead ends: 1424 [2019-12-27 23:00:11,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=1013, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 23:00:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-12-27 23:00:11,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 770. [2019-12-27 23:00:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 23:00:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1651 transitions. [2019-12-27 23:00:11,522 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1651 transitions. Word has length 41 [2019-12-27 23:00:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:11,522 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1651 transitions. [2019-12-27 23:00:11,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 23:00:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1651 transitions. [2019-12-27 23:00:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:11,525 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:11,525 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] [2019-12-27 23:00:11,525 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:11,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:11,526 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-27 23:00:11,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:11,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76269867] [2019-12-27 23:00:11,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:11,652 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 23:00:11,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76269867] [2019-12-27 23:00:11,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:11,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:00:11,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787226128] [2019-12-27 23:00:11,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:11,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:11,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 98 transitions. [2019-12-27 23:00:11,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:11,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:11,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:00:11,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:11,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:00:11,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:00:11,826 INFO L87 Difference]: Start difference. First operand 770 states and 1651 transitions. Second operand 11 states. [2019-12-27 23:00:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:13,500 INFO L93 Difference]: Finished difference Result 2176 states and 4403 transitions. [2019-12-27 23:00:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:00:13,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-27 23:00:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:13,514 INFO L225 Difference]: With dead ends: 2176 [2019-12-27 23:00:13,515 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 23:00:13,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=590, Invalid=1860, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:00:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 23:00:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 736. [2019-12-27 23:00:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:00:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1541 transitions. [2019-12-27 23:00:13,553 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1541 transitions. Word has length 41 [2019-12-27 23:00:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:13,555 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1541 transitions. [2019-12-27 23:00:13,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:00:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1541 transitions. [2019-12-27 23:00:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:13,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:13,558 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] [2019-12-27 23:00:13,559 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-27 23:00:13,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:13,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423993721] [2019-12-27 23:00:13,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:13,695 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 23:00:13,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423993721] [2019-12-27 23:00:13,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:13,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:00:13,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1229024476] [2019-12-27 23:00:13,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:13,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:13,790 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 83 transitions. [2019-12-27 23:00:13,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:13,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:13,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:00:13,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:13,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:00:13,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:00:13,850 INFO L87 Difference]: Start difference. First operand 736 states and 1541 transitions. Second operand 7 states. [2019-12-27 23:00:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:14,551 INFO L93 Difference]: Finished difference Result 1078 states and 2198 transitions. [2019-12-27 23:00:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:00:14,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 23:00:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:14,556 INFO L225 Difference]: With dead ends: 1078 [2019-12-27 23:00:14,556 INFO L226 Difference]: Without dead ends: 1078 [2019-12-27 23:00:14,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 23:00:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-12-27 23:00:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 769. [2019-12-27 23:00:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-27 23:00:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1614 transitions. [2019-12-27 23:00:14,573 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1614 transitions. Word has length 41 [2019-12-27 23:00:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:14,574 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1614 transitions. [2019-12-27 23:00:14,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:00:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1614 transitions. [2019-12-27 23:00:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:14,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:14,576 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] [2019-12-27 23:00:14,576 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:14,576 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-27 23:00:14,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:14,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576317842] [2019-12-27 23:00:14,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:14,635 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 23:00:14,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576317842] [2019-12-27 23:00:14,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:14,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:14,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774011732] [2019-12-27 23:00:14,637 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:14,645 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:14,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 97 transitions. [2019-12-27 23:00:14,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:14,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:14,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:14,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:14,676 INFO L87 Difference]: Start difference. First operand 769 states and 1614 transitions. Second operand 3 states. [2019-12-27 23:00:14,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:14,688 INFO L93 Difference]: Finished difference Result 769 states and 1612 transitions. [2019-12-27 23:00:14,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:14,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 23:00:14,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:14,691 INFO L225 Difference]: With dead ends: 769 [2019-12-27 23:00:14,691 INFO L226 Difference]: Without dead ends: 769 [2019-12-27 23:00:14,691 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 23:00:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-27 23:00:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 635. [2019-12-27 23:00:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-27 23:00:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1353 transitions. [2019-12-27 23:00:14,704 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1353 transitions. Word has length 41 [2019-12-27 23:00:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:14,705 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1353 transitions. [2019-12-27 23:00:14,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1353 transitions. [2019-12-27 23:00:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:00:14,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:14,707 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] [2019-12-27 23:00:14,707 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 23:00:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-27 23:00:14,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:14,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703908582] [2019-12-27 23:00:14,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:14,791 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:00:14,791 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:00:14,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_24) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= |v_ULTIMATE.start_main_~#t2561~0.offset_16| 0) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2561~0.base_20| 4)) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_20|) 0) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2561~0.base_20| 1)) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2561~0.base_20|) |v_ULTIMATE.start_main_~#t2561~0.offset_16| 0))) (= 0 v_~__unbuffered_cnt~0_16) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2561~0.base_20|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_21|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_16|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ULTIMATE.start_main_~#t2561~0.offset=|v_ULTIMATE.start_main_~#t2561~0.offset_16|, #length=|v_#length_15|, ~y~0=v_~y~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2561~0.base=|v_ULTIMATE.start_main_~#t2561~0.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2561~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2561~0.base, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 23:00:14,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2562~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2562~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t2562~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2562~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2562~0.base_11|) |v_ULTIMATE.start_main_~#t2562~0.offset_9| 1)) |v_#memory_int_5|) (= 0 |v_ULTIMATE.start_main_~#t2562~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2562~0.base=|v_ULTIMATE.start_main_~#t2562~0.base_11|, ULTIMATE.start_main_~#t2562~0.offset=|v_ULTIMATE.start_main_~#t2562~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2562~0.base, ULTIMATE.start_main_~#t2562~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 23:00:14,797 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~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 23:00:14,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1695804289 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-1695804289| ~x$w_buff0~0_In-1695804289) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1695804289 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1695804289 256)) .cse0) (and .cse0 (= (mod ~x$w_buff1_used~0_In-1695804289 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In-1695804289 256)))) .cse1 (= |P0Thread1of1ForFork1_#t~ite8_Out-1695804289| |P0Thread1of1ForFork1_#t~ite9_Out-1695804289|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite8_In-1695804289| |P0Thread1of1ForFork1_#t~ite8_Out-1695804289|) (= |P0Thread1of1ForFork1_#t~ite9_Out-1695804289| ~x$w_buff0~0_In-1695804289)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1695804289, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1695804289, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1695804289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695804289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1695804289, ~weak$$choice2~0=~weak$$choice2~0_In-1695804289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695804289} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1695804289, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1695804289, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1695804289|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1695804289|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1695804289, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1695804289, ~weak$$choice2~0=~weak$$choice2~0_In-1695804289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1695804289} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 23:00:14,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 23:00:14,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 23:00:14,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1063237181 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1063237181 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1063237181|) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-1063237181| ~x$w_buff0_used~0_In-1063237181)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1063237181, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1063237181} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1063237181, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1063237181|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1063237181} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 23:00:14,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-867215643 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-867215643 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-867215643 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-867215643 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-867215643| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-867215643| ~x$w_buff1_used~0_In-867215643) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-867215643, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-867215643, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-867215643, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-867215643} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-867215643, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-867215643, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-867215643, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-867215643|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-867215643} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 23:00:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In2012737730 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In2012737730 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out2012737730) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In2012737730 ~x$r_buff0_thd2~0_Out2012737730) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2012737730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2012737730} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out2012737730|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2012737730, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2012737730} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 23:00:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd2~0_In1990402695 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1990402695 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1990402695 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1990402695 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out1990402695| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out1990402695| ~x$r_buff1_thd2~0_In1990402695) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1990402695, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990402695, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990402695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990402695} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1990402695|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1990402695, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1990402695, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1990402695, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1990402695} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 23:00:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, 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 23:00:14,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 23:00:14,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite35_Out778625327| |ULTIMATE.start_main_#t~ite34_Out778625327|)) (.cse1 (= (mod ~x$w_buff1_used~0_In778625327 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In778625327 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite34_Out778625327| ~x~0_In778625327)) (and .cse0 (= ~x$w_buff1~0_In778625327 |ULTIMATE.start_main_#t~ite34_Out778625327|) (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In778625327, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778625327, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In778625327, ~x~0=~x~0_In778625327} OutVars{~x$w_buff1~0=~x$w_buff1~0_In778625327, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out778625327|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In778625327, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In778625327, ~x~0=~x~0_In778625327, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out778625327|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 23:00:14,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In476630751 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In476630751 256)))) (or (and (= ~x$w_buff0_used~0_In476630751 |ULTIMATE.start_main_#t~ite36_Out476630751|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out476630751|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In476630751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In476630751} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In476630751, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out476630751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In476630751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 23:00:14,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-822831766 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-822831766 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-822831766 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-822831766 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-822831766|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-822831766 |ULTIMATE.start_main_#t~ite37_Out-822831766|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-822831766, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-822831766, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-822831766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-822831766} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-822831766, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-822831766, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-822831766|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-822831766, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-822831766} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 23:00:14,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-392077906 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-392077906 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-392077906| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-392077906| ~x$r_buff0_thd0~0_In-392077906) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392077906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392077906} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-392077906, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-392077906|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392077906} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 23:00:14,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In134145954 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In134145954 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In134145954 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In134145954 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out134145954|)) (and (= ~x$r_buff1_thd0~0_In134145954 |ULTIMATE.start_main_#t~ite39_Out134145954|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In134145954, ~x$w_buff1_used~0=~x$w_buff1_used~0_In134145954, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In134145954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In134145954} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In134145954, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out134145954|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In134145954, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In134145954, ~x$w_buff0_used~0=~x$w_buff0_used~0_In134145954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 23:00:14,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 23:00:14,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:00:14 BasicIcfg [2019-12-27 23:00:14,895 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:00:14,898 INFO L168 Benchmark]: Toolchain (without parser) took 16408.08 ms. Allocated memory was 145.2 MB in the beginning and 436.7 MB in the end (delta: 291.5 MB). Free memory was 100.8 MB in the beginning and 144.2 MB in the end (delta: -43.4 MB). Peak memory consumption was 248.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,899 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,900 INFO L168 Benchmark]: CACSL2BoogieTranslator took 879.55 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 157.5 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,901 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.04 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,907 INFO L168 Benchmark]: Boogie Preprocessor took 35.57 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,908 INFO L168 Benchmark]: RCFGBuilder took 753.95 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 111.9 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,909 INFO L168 Benchmark]: TraceAbstraction took 14673.56 ms. Allocated memory was 203.9 MB in the beginning and 436.7 MB in the end (delta: 232.8 MB). Free memory was 111.9 MB in the beginning and 144.2 MB in the end (delta: -32.2 MB). Peak memory consumption was 200.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:14,913 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.49 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 879.55 ms. Allocated memory was 145.2 MB in the beginning and 203.9 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 157.5 MB in the end (delta: -57.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.04 ms. Allocated memory is still 203.9 MB. Free memory was 157.5 MB in the beginning and 154.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.57 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.95 ms. Allocated memory is still 203.9 MB. Free memory was 152.9 MB in the beginning and 111.9 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14673.56 ms. Allocated memory was 203.9 MB in the beginning and 436.7 MB in the end (delta: 232.8 MB). Free memory was 111.9 MB in the beginning and 144.2 MB in the end (delta: -32.2 MB). Peak memory consumption was 200.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2561, ((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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L792] FCALL, FORK 0 pthread_create(&t2562, ((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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] 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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L732] 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) [L767] 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 [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L733] 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)) [L734] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L734] 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)) [L735] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L735] 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)) [L736] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L736] 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)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L798] 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) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1386 SDtfs, 2397 SDslu, 3332 SDs, 0 SdLazy, 3438 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 37 SyntacticMatches, 8 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 3392 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 34968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...