/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_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 23:00:17,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 23:00:17,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 23:00:17,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 23:00:17,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 23:00:17,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 23:00:17,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 23:00:17,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 23:00:17,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 23:00:17,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 23:00:17,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 23:00:17,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 23:00:17,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 23:00:17,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 23:00:17,298 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 23:00:17,299 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 23:00:17,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 23:00:17,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 23:00:17,302 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 23:00:17,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 23:00:17,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 23:00:17,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 23:00:17,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 23:00:17,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 23:00:17,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 23:00:17,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 23:00:17,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 23:00:17,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 23:00:17,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 23:00:17,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 23:00:17,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 23:00:17,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 23:00:17,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 23:00:17,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 23:00:17,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 23:00:17,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 23:00:17,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 23:00:17,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 23:00:17,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 23:00:17,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 23:00:17,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 23:00:17,322 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 23:00:17,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 23:00:17,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 23:00:17,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 23:00:17,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 23:00:17,347 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 23:00:17,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 23:00:17,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 23:00:17,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 23:00:17,348 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 23:00:17,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 23:00:17,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 23:00:17,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 23:00:17,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 23:00:17,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 23:00:17,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 23:00:17,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 23:00:17,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 23:00:17,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 23:00:17,350 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 23:00:17,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 23:00:17,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 23:00:17,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 23:00:17,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 23:00:17,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 23:00:17,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 23:00:17,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 23:00:17,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 23:00:17,352 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 23:00:17,352 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 23:00:17,352 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 23:00:17,352 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 23:00:17,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 23:00:17,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 23:00:17,658 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 23:00:17,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 23:00:17,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 23:00:17,665 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 23:00:17,665 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_pso.oepc.i [2019-12-27 23:00:17,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7faee2a/441ec25bdc5146799345eaf799cee568/FLAGd931e2935 [2019-12-27 23:00:18,292 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 23:00:18,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_pso.oepc.i [2019-12-27 23:00:18,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7faee2a/441ec25bdc5146799345eaf799cee568/FLAGd931e2935 [2019-12-27 23:00:18,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac7faee2a/441ec25bdc5146799345eaf799cee568 [2019-12-27 23:00:18,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 23:00:18,557 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 23:00:18,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 23:00:18,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 23:00:18,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 23:00:18,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:18" (1/1) ... [2019-12-27 23:00:18,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:18, skipping insertion in model container [2019-12-27 23:00:18,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 11:00:18" (1/1) ... [2019-12-27 23:00:18,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 23:00:18,617 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 23:00:19,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:00:19,110 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 23:00:19,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 23:00:19,260 INFO L208 MainTranslator]: Completed translation [2019-12-27 23:00:19,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19 WrapperNode [2019-12-27 23:00:19,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 23:00:19,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 23:00:19,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 23:00:19,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 23:00:19,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 23:00:19,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 23:00:19,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 23:00:19,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 23:00:19,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (1/1) ... [2019-12-27 23:00:19,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 23:00:19,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 23:00:19,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 23:00:19,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 23:00:19,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (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 23:00:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 23:00:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 23:00:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 23:00:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 23:00:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 23:00:19,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 23:00:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 23:00:19,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 23:00:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 23:00:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 23:00:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 23:00:19,466 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:20,150 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 23:00:20,151 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 23:00:20,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:20 BoogieIcfgContainer [2019-12-27 23:00:20,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 23:00:20,154 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 23:00:20,154 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 23:00:20,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 23:00:20,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 11:00:18" (1/3) ... [2019-12-27 23:00:20,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d221185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:20, skipping insertion in model container [2019-12-27 23:00:20,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 11:00:19" (2/3) ... [2019-12-27 23:00:20,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d221185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 11:00:20, skipping insertion in model container [2019-12-27 23:00:20,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 11:00:20" (3/3) ... [2019-12-27 23:00:20,167 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_pso.oepc.i [2019-12-27 23:00:20,178 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 23:00:20,178 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 23:00:20,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 23:00:20,191 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 23:00:20,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,259 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:20,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,271 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,272 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:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,277 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,278 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 23:00:20,298 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 23:00:20,319 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 23:00:20,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 23:00:20,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 23:00:20,320 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 23:00:20,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 23:00:20,320 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 23:00:20,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 23:00:20,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 23:00:20,354 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 23:00:20,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:20,440 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:20,440 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:20,454 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:20,471 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 23:00:20,513 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 23:00:20,513 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 23:00:20,518 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:20,531 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 23:00:20,532 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 23:00:23,511 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 23:00:23,615 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 23:00:23,698 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-27 23:00:23,698 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-27 23:00:23,701 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-27 23:00:24,061 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-27 23:00:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-27 23:00:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 23:00:24,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:24,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 23:00:24,072 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:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:24,079 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-27 23:00:24,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:24,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316083407] [2019-12-27 23:00:24,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:24,312 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:24,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316083407] [2019-12-27 23:00:24,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:24,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 23:00:24,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389612330] [2019-12-27 23:00:24,316 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:24,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:24,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 23:00:24,334 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:24,338 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:24,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:24,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:24,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:24,356 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-27 23:00:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:24,593 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 23:00:24,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:24,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 23:00:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:24,754 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 23:00:24,755 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 23:00:24,756 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:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 23:00:25,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 23:00:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 23:00:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 23:00:25,117 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 23:00:25,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,117 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 23:00:25,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:25,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 23:00:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 23:00:25,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,121 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:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-27 23:00:25,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095438013] [2019-12-27 23:00:25,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:25,176 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:25,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095438013] [2019-12-27 23:00:25,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:25,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:25,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1658721792] [2019-12-27 23:00:25,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:25,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:25,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 23:00:25,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:25,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:25,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:25,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:25,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:25,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:25,184 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 23:00:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:25,210 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 23:00:25,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:25,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 23:00:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:25,218 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 23:00:25,219 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 23:00:25,219 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:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 23:00:25,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 23:00:25,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 23:00:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 23:00:25,252 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 23:00:25,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,252 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 23:00:25,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 23:00:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:25,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,255 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:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-27 23:00:25,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809349310] [2019-12-27 23:00:25,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:25,343 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:25,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809349310] [2019-12-27 23:00:25,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:25,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:25,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1922561803] [2019-12-27 23:00:25,344 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:25,346 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:25,354 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:25,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:25,404 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:25,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:25,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:25,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:25,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:25,406 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 5 states. [2019-12-27 23:00:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:25,511 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 23:00:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:25,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:25,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:25,523 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 23:00:25,524 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 23:00:25,524 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:25,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 23:00:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 23:00:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 23:00:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 23:00:25,565 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 23:00:25,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,566 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 23:00:25,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:25,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 23:00:25,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:25,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,568 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:25,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,568 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-27 23:00:25,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970282395] [2019-12-27 23:00:25,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:25,659 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:25,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970282395] [2019-12-27 23:00:25,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:25,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:25,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1944640524] [2019-12-27 23:00:25,661 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:25,662 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:25,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:25,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:25,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:25,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:25,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:25,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:25,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:25,682 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 5 states. [2019-12-27 23:00:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:25,918 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 23:00:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:25,919 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:25,929 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 23:00:25,929 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 23:00:25,930 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:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 23:00:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 23:00:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 23:00:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 23:00:25,976 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 23:00:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:25,978 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 23:00:25,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 23:00:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 23:00:25,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:25,981 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:25,982 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:25,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:25,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-27 23:00:25,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:25,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670627651] [2019-12-27 23:00:25,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,089 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:26,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670627651] [2019-12-27 23:00:26,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:26,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1376445295] [2019-12-27 23:00:26,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:26,093 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:26,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 23:00:26,097 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:26,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:26,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:26,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,127 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 5 states. [2019-12-27 23:00:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,401 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 23:00:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 23:00:26,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 23:00:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:26,412 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 23:00:26,413 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 23:00:26,413 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:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 23:00:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 23:00:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 23:00:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 23:00:26,458 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 23:00:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:26,458 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 23:00:26,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 23:00:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 23:00:26,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:26,461 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:26,462 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:26,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-27 23:00:26,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:26,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867696945] [2019-12-27 23:00:26,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,536 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:26,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867696945] [2019-12-27 23:00:26,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 23:00:26,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462657206] [2019-12-27 23:00:26,537 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:26,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:26,552 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 23:00:26,552 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,575 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 23:00:26,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 23:00:26,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 23:00:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 23:00:26,576 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-27 23:00:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,603 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 23:00:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:26,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 23:00:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:26,608 INFO L225 Difference]: With dead ends: 772 [2019-12-27 23:00:26,608 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 23:00:26,608 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:26,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 23:00:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 23:00:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 23:00:26,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 23:00:26,626 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 23:00:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:26,627 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 23:00:26,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 23:00:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 23:00:26,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:26,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:26,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 23:00:26,630 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:26,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-27 23:00:26,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:26,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189042149] [2019-12-27 23:00:26,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,738 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:26,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189042149] [2019-12-27 23:00:26,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:26,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [79222866] [2019-12-27 23:00:26,739 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:26,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:26,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 132 transitions. [2019-12-27 23:00:26,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:26,802 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:26,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 23:00:26,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 23:00:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 23:00:26,803 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 4 states. [2019-12-27 23:00:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:26,824 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 23:00:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 23:00:26,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 23:00:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:26,828 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 23:00:26,828 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 23:00:26,829 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:26,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 23:00:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 23:00:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 23:00:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 23:00:26,842 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 23:00:26,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:26,843 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 23:00:26,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 23:00:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 23:00:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:26,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:26,845 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:26,845 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:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-27 23:00:26,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:26,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438149291] [2019-12-27 23:00:26,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:26,998 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:26,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438149291] [2019-12-27 23:00:26,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:26,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 23:00:26,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2844500] [2019-12-27 23:00:26,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:27,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:27,047 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 118 transitions. [2019-12-27 23:00:27,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:27,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:27,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 23:00:27,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:27,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 23:00:27,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 23:00:27,258 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 9 states. [2019-12-27 23:00:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:28,710 INFO L93 Difference]: Finished difference Result 1932 states and 4318 transitions. [2019-12-27 23:00:28,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 23:00:28,711 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 23:00:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:28,719 INFO L225 Difference]: With dead ends: 1932 [2019-12-27 23:00:28,719 INFO L226 Difference]: Without dead ends: 1257 [2019-12-27 23:00:28,720 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:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-12-27 23:00:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 615. [2019-12-27 23:00:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-27 23:00:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1397 transitions. [2019-12-27 23:00:28,740 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1397 transitions. Word has length 41 [2019-12-27 23:00:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:28,741 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 1397 transitions. [2019-12-27 23:00:28,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 23:00:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1397 transitions. [2019-12-27 23:00:28,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:28,743 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:28,743 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:28,743 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:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-27 23:00:28,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:28,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327333648] [2019-12-27 23:00:28,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:28,911 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:28,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327333648] [2019-12-27 23:00:28,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:28,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:00:28,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62783232] [2019-12-27 23:00:28,912 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:28,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:28,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 127 transitions. [2019-12-27 23:00:28,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:29,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 23:00:29,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 23:00:29,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:29,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 23:00:29,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-27 23:00:29,227 INFO L87 Difference]: Start difference. First operand 615 states and 1397 transitions. Second operand 16 states. [2019-12-27 23:00:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:32,112 INFO L93 Difference]: Finished difference Result 1393 states and 2825 transitions. [2019-12-27 23:00:32,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 23:00:32,113 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-12-27 23:00:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:32,122 INFO L225 Difference]: With dead ends: 1393 [2019-12-27 23:00:32,122 INFO L226 Difference]: Without dead ends: 1393 [2019-12-27 23:00:32,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 23:00:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-12-27 23:00:32,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 770. [2019-12-27 23:00:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 23:00:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1651 transitions. [2019-12-27 23:00:32,146 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1651 transitions. Word has length 41 [2019-12-27 23:00:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:32,146 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1651 transitions. [2019-12-27 23:00:32,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 23:00:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1651 transitions. [2019-12-27 23:00:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:32,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:32,149 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:32,149 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:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-27 23:00:32,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:32,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727950504] [2019-12-27 23:00:32,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:32,299 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:32,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727950504] [2019-12-27 23:00:32,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:32,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 23:00:32,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1677754282] [2019-12-27 23:00:32,300 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:32,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:32,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 98 transitions. [2019-12-27 23:00:32,336 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:32,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 23:00:32,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 23:00:32,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:32,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 23:00:32,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 23:00:32,398 INFO L87 Difference]: Start difference. First operand 770 states and 1651 transitions. Second operand 11 states. [2019-12-27 23:00:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:34,131 INFO L93 Difference]: Finished difference Result 2176 states and 4403 transitions. [2019-12-27 23:00:34,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 23:00:34,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-27 23:00:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:34,139 INFO L225 Difference]: With dead ends: 2176 [2019-12-27 23:00:34,140 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 23:00:34,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=590, Invalid=1860, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 23:00:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 23:00:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 736. [2019-12-27 23:00:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 23:00:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1541 transitions. [2019-12-27 23:00:34,165 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1541 transitions. Word has length 41 [2019-12-27 23:00:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:34,165 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1541 transitions. [2019-12-27 23:00:34,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 23:00:34,166 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1541 transitions. [2019-12-27 23:00:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:34,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:34,168 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:34,168 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:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-27 23:00:34,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:34,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630380760] [2019-12-27 23:00:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:34,291 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:34,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630380760] [2019-12-27 23:00:34,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:34,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 23:00:34,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1452106668] [2019-12-27 23:00:34,292 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:34,306 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:34,373 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 83 transitions. [2019-12-27 23:00:34,373 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:34,407 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 23:00:34,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 23:00:34,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:34,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 23:00:34,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 23:00:34,408 INFO L87 Difference]: Start difference. First operand 736 states and 1541 transitions. Second operand 7 states. [2019-12-27 23:00:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:35,105 INFO L93 Difference]: Finished difference Result 1078 states and 2198 transitions. [2019-12-27 23:00:35,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 23:00:35,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 23:00:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:35,108 INFO L225 Difference]: With dead ends: 1078 [2019-12-27 23:00:35,109 INFO L226 Difference]: Without dead ends: 1078 [2019-12-27 23:00:35,109 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:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2019-12-27 23:00:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 769. [2019-12-27 23:00:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-27 23:00:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1614 transitions. [2019-12-27 23:00:35,125 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1614 transitions. Word has length 41 [2019-12-27 23:00:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:35,126 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1614 transitions. [2019-12-27 23:00:35,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 23:00:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1614 transitions. [2019-12-27 23:00:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 23:00:35,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:35,128 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:35,128 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:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-27 23:00:35,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:35,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891069357] [2019-12-27 23:00:35,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 23:00:35,184 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:35,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891069357] [2019-12-27 23:00:35,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 23:00:35,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 23:00:35,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1207828895] [2019-12-27 23:00:35,185 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 23:00:35,193 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 23:00:35,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 97 transitions. [2019-12-27 23:00:35,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 23:00:35,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 23:00:35,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 23:00:35,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 23:00:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 23:00:35,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 23:00:35,223 INFO L87 Difference]: Start difference. First operand 769 states and 1614 transitions. Second operand 3 states. [2019-12-27 23:00:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 23:00:35,240 INFO L93 Difference]: Finished difference Result 769 states and 1612 transitions. [2019-12-27 23:00:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 23:00:35,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 23:00:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 23:00:35,243 INFO L225 Difference]: With dead ends: 769 [2019-12-27 23:00:35,243 INFO L226 Difference]: Without dead ends: 769 [2019-12-27 23:00:35,244 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:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-27 23:00:35,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 635. [2019-12-27 23:00:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-27 23:00:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1353 transitions. [2019-12-27 23:00:35,257 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1353 transitions. Word has length 41 [2019-12-27 23:00:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 23:00:35,257 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1353 transitions. [2019-12-27 23:00:35,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 23:00:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1353 transitions. [2019-12-27 23:00:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 23:00:35,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 23:00:35,259 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:35,260 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:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 23:00:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-27 23:00:35,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 23:00:35,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394936042] [2019-12-27 23:00:35,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 23:00:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 23:00:35,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 23:00:35,367 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 23:00:35,371 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) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2565~0.base_20|) |v_ULTIMATE.start_main_~#t2565~0.offset_16| 0)) |v_#memory_int_11|) (= 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) (= |v_ULTIMATE.start_main_~#t2565~0.offset_16| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2565~0.base_20| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 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|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t2565~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) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2565~0.base_20|) (= 0 v_~x$read_delayed_var~0.offset_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t2565~0.base_20|) 0) (= 0 v_~__unbuffered_cnt~0_16) (< 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_~#t2565~0.base=|v_ULTIMATE.start_main_~#t2565~0.base_20|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~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, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_16|, #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_~#t2565~0.offset=|v_ULTIMATE.start_main_~#t2565~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, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_21|, ~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|, ~__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_~#t2565~0.base, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2566~0.offset, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2565~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, ULTIMATE.start_main_~#t2566~0.base, ~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, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 23:00:35,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t2566~0.base_11| 4) |v_#length_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2566~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2566~0.offset_9|) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2566~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2566~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2566~0.base_11|) |v_ULTIMATE.start_main_~#t2566~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#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|, ULTIMATE.start_main_~#t2566~0.offset=|v_ULTIMATE.start_main_~#t2566~0.offset_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2566~0.base=|v_ULTIMATE.start_main_~#t2566~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t2566~0.offset, #length, ULTIMATE.start_main_~#t2566~0.base] because there is no mapped edge [2019-12-27 23:00:35,373 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:35,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In109217519 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out109217519| ~x$w_buff0~0_In109217519) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In109217519| |P0Thread1of1ForFork1_#t~ite8_Out109217519|)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out109217519| ~x$w_buff0~0_In109217519) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In109217519 256)))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In109217519 256) 0)) (and (= (mod ~x$r_buff1_thd1~0_In109217519 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In109217519 256)))) (= |P0Thread1of1ForFork1_#t~ite9_Out109217519| |P0Thread1of1ForFork1_#t~ite8_Out109217519|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In109217519, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In109217519, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In109217519|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In109217519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In109217519, ~weak$$choice2~0=~weak$$choice2~0_In109217519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In109217519} OutVars{~x$w_buff0~0=~x$w_buff0~0_In109217519, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In109217519, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out109217519|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out109217519|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In109217519, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In109217519, ~weak$$choice2~0=~weak$$choice2~0_In109217519, ~x$w_buff0_used~0=~x$w_buff0_used~0_In109217519} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 23:00:35,380 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:35,381 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:35,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1324674759 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1324674759 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out1324674759| ~x$w_buff0_used~0_In1324674759) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out1324674759| 0) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1324674759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1324674759} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1324674759, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1324674759|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1324674759} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 23:00:35,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-897520384 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-897520384 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-897520384 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-897520384 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite29_Out-897520384| ~x$w_buff1_used~0_In-897520384)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-897520384| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-897520384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-897520384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-897520384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-897520384} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-897520384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-897520384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-897520384, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-897520384|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-897520384} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 23:00:35,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1830474644 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1830474644 256)))) (or (and (= ~x$r_buff0_thd2~0_In1830474644 ~x$r_buff0_thd2~0_Out1830474644) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out1830474644)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1830474644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1830474644} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1830474644|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1830474644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1830474644} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 23:00:35,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-761879005 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-761879005 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-761879005 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-761879005 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-761879005| ~x$r_buff1_thd2~0_In-761879005) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out-761879005| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-761879005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-761879005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-761879005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-761879005} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-761879005|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-761879005, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-761879005, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-761879005, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-761879005} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 23:00:35,384 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:35,384 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:35,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-420460955 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In-420460955 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite35_Out-420460955| |ULTIMATE.start_main_#t~ite34_Out-420460955|))) (or (and .cse0 (= ~x~0_In-420460955 |ULTIMATE.start_main_#t~ite34_Out-420460955|) (or .cse1 .cse2)) (and (= ~x$w_buff1~0_In-420460955 |ULTIMATE.start_main_#t~ite34_Out-420460955|) (not .cse1) (not .cse2) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-420460955, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420460955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420460955, ~x~0=~x~0_In-420460955} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-420460955, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-420460955|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-420460955, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-420460955, ~x~0=~x~0_In-420460955, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-420460955|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 23:00:35,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1799763664 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-1799763664 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite36_Out-1799763664|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1799763664 |ULTIMATE.start_main_#t~ite36_Out-1799763664|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1799763664, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799763664} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1799763664, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1799763664|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1799763664} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 23:00:35,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-699948699 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-699948699 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-699948699 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-699948699 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out-699948699|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-699948699 |ULTIMATE.start_main_#t~ite37_Out-699948699|) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-699948699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-699948699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-699948699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-699948699} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-699948699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-699948699, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-699948699|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-699948699, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-699948699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 23:00:35,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In381519488 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In381519488 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out381519488|)) (and (= ~x$r_buff0_thd0~0_In381519488 |ULTIMATE.start_main_#t~ite38_Out381519488|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In381519488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In381519488} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In381519488, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out381519488|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In381519488} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 23:00:35,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-746416113 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-746416113 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-746416113 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-746416113 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-746416113 |ULTIMATE.start_main_#t~ite39_Out-746416113|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-746416113|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746416113, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-746416113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-746416113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746416113} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-746416113, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-746416113|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-746416113, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-746416113, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-746416113} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 23:00:35,388 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:35,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 11:00:35 BasicIcfg [2019-12-27 23:00:35,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 23:00:35,467 INFO L168 Benchmark]: Toolchain (without parser) took 16909.28 ms. Allocated memory was 145.8 MB in the beginning and 435.7 MB in the end (delta: 289.9 MB). Free memory was 102.1 MB in the beginning and 161.5 MB in the end (delta: -59.4 MB). Peak memory consumption was 230.5 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,467 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,468 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.74 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 158.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,469 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 155.4 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:35,470 INFO L168 Benchmark]: Boogie Preprocessor took 53.88 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,470 INFO L168 Benchmark]: RCFGBuilder took 773.47 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 112.7 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,471 INFO L168 Benchmark]: TraceAbstraction took 15311.07 ms. Allocated memory was 202.9 MB in the beginning and 435.7 MB in the end (delta: 232.8 MB). Free memory was 112.0 MB in the beginning and 161.5 MB in the end (delta: -49.4 MB). Peak memory consumption was 183.3 MB. Max. memory is 7.1 GB. [2019-12-27 23:00:35,475 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 702.74 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 158.1 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 202.9 MB. Free memory was 157.4 MB in the beginning and 155.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.88 ms. Allocated memory is still 202.9 MB. Free memory was 155.4 MB in the beginning and 152.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 773.47 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 112.7 MB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15311.07 ms. Allocated memory was 202.9 MB in the beginning and 435.7 MB in the end (delta: 232.8 MB). Free memory was 112.0 MB in the beginning and 161.5 MB in the end (delta: -49.4 MB). Peak memory consumption was 183.3 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(&t2565, ((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(&t2566, ((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: 15.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1380 SDtfs, 2239 SDslu, 3763 SDs, 0 SdLazy, 3898 SolverSat, 319 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.2s 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, 3361 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 36408 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...