/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/safe017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:33:12,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:33:12,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:33:12,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:33:12,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:33:12,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:33:12,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:33:12,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:33:12,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:33:12,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:33:12,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:33:12,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:33:12,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:33:12,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:33:12,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:33:12,051 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:33:12,052 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:33:12,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:33:12,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:33:12,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:33:12,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:33:12,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:33:12,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:33:12,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:33:12,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:33:12,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:33:12,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:33:12,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:33:12,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:33:12,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:33:12,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:33:12,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:33:12,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:33:12,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:33:12,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:33:12,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:33:12,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:33:12,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:33:12,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:33:12,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:33:12,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:33:12,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:33:12,115 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:33:12,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:33:12,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:33:12,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:33:12,118 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:33:12,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:33:12,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:33:12,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:33:12,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:33:12,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:33:12,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:33:12,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:33:12,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:33:12,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:33:12,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:33:12,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:33:12,121 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:33:12,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:33:12,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:33:12,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:33:12,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:33:12,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:12,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:33:12,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:33:12,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:33:12,123 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:33:12,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:33:12,124 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:33:12,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:33:12,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:33:12,125 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:33:12,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:33:12,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:33:12,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:33:12,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:33:12,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:33:12,411 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:33:12,412 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2019-12-27 22:33:12,474 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a184fb5c/a005e8318b2a4b02865a85b5a32c0b8f/FLAGb8aed13af [2019-12-27 22:33:13,030 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:33:13,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.opt.i [2019-12-27 22:33:13,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a184fb5c/a005e8318b2a4b02865a85b5a32c0b8f/FLAGb8aed13af [2019-12-27 22:33:13,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a184fb5c/a005e8318b2a4b02865a85b5a32c0b8f [2019-12-27 22:33:13,321 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:33:13,323 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:33:13,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:13,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:33:13,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:33:13,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:13" (1/1) ... [2019-12-27 22:33:13,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:13, skipping insertion in model container [2019-12-27 22:33:13,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:33:13" (1/1) ... [2019-12-27 22:33:13,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:33:13,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:33:13,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:13,896 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:33:13,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:33:14,040 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:33:14,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14 WrapperNode [2019-12-27 22:33:14,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:33:14,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:14,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:33:14,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:33:14,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:33:14,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:33:14,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:33:14,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:33:14,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,150 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... [2019-12-27 22:33:14,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:33:14,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:33:14,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:33:14,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:33:14,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:33:14,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:33:14,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:33:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:33:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:33:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:33:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:33:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:33:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:33:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:33:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:33:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:33:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:33:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:33:14,259 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 22:33:15,013 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:33:15,013 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:33:15,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:15 BoogieIcfgContainer [2019-12-27 22:33:15,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:33:15,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:33:15,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:33:15,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:33:15,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:33:13" (1/3) ... [2019-12-27 22:33:15,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:15, skipping insertion in model container [2019-12-27 22:33:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:33:14" (2/3) ... [2019-12-27 22:33:15,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:33:15, skipping insertion in model container [2019-12-27 22:33:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:33:15" (3/3) ... [2019-12-27 22:33:15,023 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_power.opt.i [2019-12-27 22:33:15,033 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:33:15,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:33:15,044 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:33:15,045 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:33:15,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,106 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,134 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,135 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,135 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,135 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,136 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,137 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,151 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,153 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,154 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,178 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:33:15,194 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:33:15,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:33:15,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:33:15,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:33:15,211 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:33:15,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:33:15,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:33:15,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:33:15,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:33:15,227 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 22:33:15,229 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:15,340 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:15,341 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:15,359 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:15,378 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 22:33:15,446 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 22:33:15,447 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:33:15,453 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:33:15,473 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:33:15,474 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:33:19,016 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 22:33:19,127 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 22:33:19,154 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81965 [2019-12-27 22:33:19,154 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 22:33:19,158 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 107 transitions [2019-12-27 22:33:38,192 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123932 states. [2019-12-27 22:33:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 123932 states. [2019-12-27 22:33:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:33:38,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:38,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:33:38,201 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:33:38,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:38,208 INFO L82 PathProgramCache]: Analyzing trace with hash 840548, now seen corresponding path program 1 times [2019-12-27 22:33:38,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:38,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797841490] [2019-12-27 22:33:38,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:38,457 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 22:33:38,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797841490] [2019-12-27 22:33:38,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:38,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:33:38,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [876593285] [2019-12-27 22:33:38,464 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:38,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:38,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:33:38,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:38,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:38,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:33:38,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:33:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:33:38,505 INFO L87 Difference]: Start difference. First operand 123932 states. Second operand 3 states. [2019-12-27 22:33:41,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:33:41,264 INFO L93 Difference]: Finished difference Result 123232 states and 527355 transitions. [2019-12-27 22:33:41,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:33:41,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:33:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:33:42,168 INFO L225 Difference]: With dead ends: 123232 [2019-12-27 22:33:42,168 INFO L226 Difference]: Without dead ends: 120684 [2019-12-27 22:33:42,170 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 22:33:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120684 states. [2019-12-27 22:33:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120684 to 120684. [2019-12-27 22:33:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120684 states. [2019-12-27 22:33:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120684 states to 120684 states and 516967 transitions. [2019-12-27 22:33:54,784 INFO L78 Accepts]: Start accepts. Automaton has 120684 states and 516967 transitions. Word has length 3 [2019-12-27 22:33:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:33:54,784 INFO L462 AbstractCegarLoop]: Abstraction has 120684 states and 516967 transitions. [2019-12-27 22:33:54,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:33:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 120684 states and 516967 transitions. [2019-12-27 22:33:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:33:54,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:33:54,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:33:54,791 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:33:54,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:33:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -693264508, now seen corresponding path program 1 times [2019-12-27 22:33:54,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:33:54,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487775211] [2019-12-27 22:33:54,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:33:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:33:54,894 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 22:33:54,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487775211] [2019-12-27 22:33:54,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:33:54,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:33:54,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1705815675] [2019-12-27 22:33:54,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:33:54,897 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:33:54,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:33:54,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:33:54,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:33:54,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:33:54,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:33:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:33:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:33:54,903 INFO L87 Difference]: Start difference. First operand 120684 states and 516967 transitions. Second operand 4 states. [2019-12-27 22:34:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:00,731 INFO L93 Difference]: Finished difference Result 188314 states and 770960 transitions. [2019-12-27 22:34:00,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:00,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:34:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:01,291 INFO L225 Difference]: With dead ends: 188314 [2019-12-27 22:34:01,291 INFO L226 Difference]: Without dead ends: 188265 [2019-12-27 22:34:01,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188265 states. [2019-12-27 22:34:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188265 to 173329. [2019-12-27 22:34:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173329 states. [2019-12-27 22:34:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173329 states to 173329 states and 717928 transitions. [2019-12-27 22:34:11,436 INFO L78 Accepts]: Start accepts. Automaton has 173329 states and 717928 transitions. Word has length 11 [2019-12-27 22:34:11,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:11,437 INFO L462 AbstractCegarLoop]: Abstraction has 173329 states and 717928 transitions. [2019-12-27 22:34:11,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 173329 states and 717928 transitions. [2019-12-27 22:34:11,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:11,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:11,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:11,445 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:11,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:11,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1884384651, now seen corresponding path program 1 times [2019-12-27 22:34:11,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:11,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827149775] [2019-12-27 22:34:11,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:11,532 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 22:34:11,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827149775] [2019-12-27 22:34:11,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:11,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:11,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [362637072] [2019-12-27 22:34:11,534 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:11,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:11,537 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:11,537 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:11,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:11,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:11,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:11,538 INFO L87 Difference]: Start difference. First operand 173329 states and 717928 transitions. Second operand 3 states. [2019-12-27 22:34:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:11,680 INFO L93 Difference]: Finished difference Result 34664 states and 112616 transitions. [2019-12-27 22:34:11,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:11,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:34:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:11,815 INFO L225 Difference]: With dead ends: 34664 [2019-12-27 22:34:11,815 INFO L226 Difference]: Without dead ends: 34664 [2019-12-27 22:34:11,816 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 22:34:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-27 22:34:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 34664. [2019-12-27 22:34:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34664 states. [2019-12-27 22:34:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34664 states to 34664 states and 112616 transitions. [2019-12-27 22:34:17,839 INFO L78 Accepts]: Start accepts. Automaton has 34664 states and 112616 transitions. Word has length 13 [2019-12-27 22:34:17,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:17,840 INFO L462 AbstractCegarLoop]: Abstraction has 34664 states and 112616 transitions. [2019-12-27 22:34:17,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:17,840 INFO L276 IsEmpty]: Start isEmpty. Operand 34664 states and 112616 transitions. [2019-12-27 22:34:17,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:34:17,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:17,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:17,841 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:17,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2074529167, now seen corresponding path program 1 times [2019-12-27 22:34:17,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:17,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670819032] [2019-12-27 22:34:17,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:17,937 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 22:34:17,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670819032] [2019-12-27 22:34:17,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:17,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:17,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1649974826] [2019-12-27 22:34:17,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:17,942 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:17,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:34:17,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:17,946 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:17,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:34:17,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:17,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:34:17,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:34:17,947 INFO L87 Difference]: Start difference. First operand 34664 states and 112616 transitions. Second operand 4 states. [2019-12-27 22:34:18,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:18,401 INFO L93 Difference]: Finished difference Result 46077 states and 146183 transitions. [2019-12-27 22:34:18,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:18,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:34:18,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:18,505 INFO L225 Difference]: With dead ends: 46077 [2019-12-27 22:34:18,505 INFO L226 Difference]: Without dead ends: 46070 [2019-12-27 22:34:18,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46070 states. [2019-12-27 22:34:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46070 to 40619. [2019-12-27 22:34:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40619 states. [2019-12-27 22:34:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40619 states to 40619 states and 130997 transitions. [2019-12-27 22:34:19,667 INFO L78 Accepts]: Start accepts. Automaton has 40619 states and 130997 transitions. Word has length 13 [2019-12-27 22:34:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:19,668 INFO L462 AbstractCegarLoop]: Abstraction has 40619 states and 130997 transitions. [2019-12-27 22:34:19,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:34:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40619 states and 130997 transitions. [2019-12-27 22:34:19,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:34:19,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:19,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:19,672 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:19,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:19,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1372726712, now seen corresponding path program 1 times [2019-12-27 22:34:19,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:19,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424434680] [2019-12-27 22:34:19,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:19,773 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 22:34:19,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424434680] [2019-12-27 22:34:19,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:19,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:19,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528592381] [2019-12-27 22:34:19,774 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:19,777 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:19,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 22:34:19,782 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:19,831 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:19,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:19,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:19,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:19,832 INFO L87 Difference]: Start difference. First operand 40619 states and 130997 transitions. Second operand 6 states. [2019-12-27 22:34:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:20,771 INFO L93 Difference]: Finished difference Result 54297 states and 171188 transitions. [2019-12-27 22:34:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:34:20,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 22:34:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:20,856 INFO L225 Difference]: With dead ends: 54297 [2019-12-27 22:34:20,856 INFO L226 Difference]: Without dead ends: 54284 [2019-12-27 22:34:20,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-12-27 22:34:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 40933. [2019-12-27 22:34:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40933 states. [2019-12-27 22:34:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40933 states to 40933 states and 131862 transitions. [2019-12-27 22:34:21,648 INFO L78 Accepts]: Start accepts. Automaton has 40933 states and 131862 transitions. Word has length 19 [2019-12-27 22:34:21,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:21,649 INFO L462 AbstractCegarLoop]: Abstraction has 40933 states and 131862 transitions. [2019-12-27 22:34:21,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40933 states and 131862 transitions. [2019-12-27 22:34:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:34:21,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:21,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:21,663 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1682135623, now seen corresponding path program 1 times [2019-12-27 22:34:21,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:21,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649241986] [2019-12-27 22:34:21,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:21,719 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 22:34:21,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649241986] [2019-12-27 22:34:21,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:21,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:21,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [849842922] [2019-12-27 22:34:21,720 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:21,725 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:21,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 22:34:21,735 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:21,757 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:21,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:34:21,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:34:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:34:21,758 INFO L87 Difference]: Start difference. First operand 40933 states and 131862 transitions. Second operand 5 states. [2019-12-27 22:34:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:21,810 INFO L93 Difference]: Finished difference Result 7502 states and 20469 transitions. [2019-12-27 22:34:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:34:21,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 22:34:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:21,822 INFO L225 Difference]: With dead ends: 7502 [2019-12-27 22:34:21,822 INFO L226 Difference]: Without dead ends: 7502 [2019-12-27 22:34:21,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 22:34:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7502 states. [2019-12-27 22:34:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7502 to 7390. [2019-12-27 22:34:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7390 states. [2019-12-27 22:34:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 20149 transitions. [2019-12-27 22:34:22,231 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 20149 transitions. Word has length 25 [2019-12-27 22:34:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:22,231 INFO L462 AbstractCegarLoop]: Abstraction has 7390 states and 20149 transitions. [2019-12-27 22:34:22,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:34:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 20149 transitions. [2019-12-27 22:34:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:34:22,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:22,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:22,243 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:22,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:22,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2147477439, now seen corresponding path program 1 times [2019-12-27 22:34:22,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:22,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494402196] [2019-12-27 22:34:22,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:22,329 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 22:34:22,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494402196] [2019-12-27 22:34:22,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:22,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:34:22,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [837673483] [2019-12-27 22:34:22,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:22,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:22,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 22:34:22,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:22,394 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 22:34:22,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:22,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:22,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:22,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:22,395 INFO L87 Difference]: Start difference. First operand 7390 states and 20149 transitions. Second operand 6 states. [2019-12-27 22:34:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:22,455 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-27 22:34:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:22,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 22:34:22,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:22,464 INFO L225 Difference]: With dead ends: 5312 [2019-12-27 22:34:22,465 INFO L226 Difference]: Without dead ends: 5312 [2019-12-27 22:34:22,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:22,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-27 22:34:22,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-27 22:34:22,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-27 22:34:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-27 22:34:22,564 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-27 22:34:22,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:22,565 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-27 22:34:22,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-27 22:34:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:22,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:22,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:22,573 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -314622142, now seen corresponding path program 1 times [2019-12-27 22:34:22,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:22,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877955499] [2019-12-27 22:34:22,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:22,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877955499] [2019-12-27 22:34:22,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:22,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:34:22,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911096667] [2019-12-27 22:34:22,654 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:22,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:22,861 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:22,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:22,863 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:22,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:22,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:22,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:22,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:22,864 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 3 states. [2019-12-27 22:34:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:22,926 INFO L93 Difference]: Finished difference Result 4959 states and 14299 transitions. [2019-12-27 22:34:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:22,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:22,934 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:34:22,934 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:34:22,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:34:23,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:34:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:34:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14295 transitions. [2019-12-27 22:34:23,010 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14295 transitions. Word has length 65 [2019-12-27 22:34:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:23,011 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14295 transitions. [2019-12-27 22:34:23,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14295 transitions. [2019-12-27 22:34:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:23,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:23,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:23,019 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 143495123, now seen corresponding path program 1 times [2019-12-27 22:34:23,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:23,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614539577] [2019-12-27 22:34:23,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:23,135 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 22:34:23,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614539577] [2019-12-27 22:34:23,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:23,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:34:23,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [982072266] [2019-12-27 22:34:23,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:23,158 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:23,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 22:34:23,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:23,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:34:23,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:34:23,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:23,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:34:23,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:34:23,514 INFO L87 Difference]: Start difference. First operand 4955 states and 14295 transitions. Second operand 9 states. [2019-12-27 22:34:23,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:23,943 INFO L93 Difference]: Finished difference Result 7546 states and 21560 transitions. [2019-12-27 22:34:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:34:23,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 22:34:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:23,956 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:34:23,956 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:34:23,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:34:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:34:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:34:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:34:24,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18330 transitions. [2019-12-27 22:34:24,054 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18330 transitions. Word has length 65 [2019-12-27 22:34:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18330 transitions. [2019-12-27 22:34:24,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:34:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18330 transitions. [2019-12-27 22:34:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:24,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:24,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:24,064 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1279878861, now seen corresponding path program 2 times [2019-12-27 22:34:24,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:24,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574336409] [2019-12-27 22:34:24,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:24,326 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 22:34:24,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574336409] [2019-12-27 22:34:24,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:24,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:34:24,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277944074] [2019-12-27 22:34:24,328 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:24,349 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:24,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 558 transitions. [2019-12-27 22:34:24,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:24,825 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 22:34:24,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 22:34:24,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:24,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 22:34:24,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:34:24,826 INFO L87 Difference]: Start difference. First operand 6352 states and 18330 transitions. Second operand 14 states. [2019-12-27 22:34:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:27,178 INFO L93 Difference]: Finished difference Result 15419 states and 43654 transitions. [2019-12-27 22:34:27,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 22:34:27,179 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 22:34:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:27,199 INFO L225 Difference]: With dead ends: 15419 [2019-12-27 22:34:27,199 INFO L226 Difference]: Without dead ends: 15419 [2019-12-27 22:34:27,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:34:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15419 states. [2019-12-27 22:34:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15419 to 7035. [2019-12-27 22:34:27,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7035 states. [2019-12-27 22:34:27,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7035 states to 7035 states and 20389 transitions. [2019-12-27 22:34:27,372 INFO L78 Accepts]: Start accepts. Automaton has 7035 states and 20389 transitions. Word has length 65 [2019-12-27 22:34:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:27,373 INFO L462 AbstractCegarLoop]: Abstraction has 7035 states and 20389 transitions. [2019-12-27 22:34:27,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 22:34:27,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7035 states and 20389 transitions. [2019-12-27 22:34:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:34:27,386 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:27,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:27,387 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:27,387 INFO L82 PathProgramCache]: Analyzing trace with hash -817749225, now seen corresponding path program 3 times [2019-12-27 22:34:27,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:27,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501967556] [2019-12-27 22:34:27,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:27,510 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 22:34:27,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501967556] [2019-12-27 22:34:27,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:27,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:27,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661499712] [2019-12-27 22:34:27,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:27,534 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:27,970 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 540 transitions. [2019-12-27 22:34:27,970 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:27,971 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:34:27,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:27,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:27,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:27,972 INFO L87 Difference]: Start difference. First operand 7035 states and 20389 transitions. Second operand 3 states. [2019-12-27 22:34:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:28,045 INFO L93 Difference]: Finished difference Result 7035 states and 20388 transitions. [2019-12-27 22:34:28,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:28,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:34:28,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:28,055 INFO L225 Difference]: With dead ends: 7035 [2019-12-27 22:34:28,056 INFO L226 Difference]: Without dead ends: 7035 [2019-12-27 22:34:28,056 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 22:34:28,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7035 states. [2019-12-27 22:34:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7035 to 4684. [2019-12-27 22:34:28,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4684 states. [2019-12-27 22:34:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4684 states to 4684 states and 13831 transitions. [2019-12-27 22:34:28,140 INFO L78 Accepts]: Start accepts. Automaton has 4684 states and 13831 transitions. Word has length 65 [2019-12-27 22:34:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:28,140 INFO L462 AbstractCegarLoop]: Abstraction has 4684 states and 13831 transitions. [2019-12-27 22:34:28,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4684 states and 13831 transitions. [2019-12-27 22:34:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:34:28,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:28,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:28,147 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1536074806, now seen corresponding path program 1 times [2019-12-27 22:34:28,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:28,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775584707] [2019-12-27 22:34:28,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:28,218 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 22:34:28,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775584707] [2019-12-27 22:34:28,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:28,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:28,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [398966410] [2019-12-27 22:34:28,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:28,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:28,437 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 492 transitions. [2019-12-27 22:34:28,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:28,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:28,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:34:28,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:34:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:34:28,475 INFO L87 Difference]: Start difference. First operand 4684 states and 13831 transitions. Second operand 6 states. [2019-12-27 22:34:28,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:28,702 INFO L93 Difference]: Finished difference Result 5625 states and 15973 transitions. [2019-12-27 22:34:28,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:34:28,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 22:34:28,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:28,710 INFO L225 Difference]: With dead ends: 5625 [2019-12-27 22:34:28,711 INFO L226 Difference]: Without dead ends: 5625 [2019-12-27 22:34:28,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:34:28,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2019-12-27 22:34:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 3864. [2019-12-27 22:34:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2019-12-27 22:34:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 11147 transitions. [2019-12-27 22:34:28,774 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 11147 transitions. Word has length 66 [2019-12-27 22:34:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:28,775 INFO L462 AbstractCegarLoop]: Abstraction has 3864 states and 11147 transitions. [2019-12-27 22:34:28,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:34:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 11147 transitions. [2019-12-27 22:34:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:34:28,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:28,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:28,780 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:28,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1372470305, now seen corresponding path program 1 times [2019-12-27 22:34:28,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:28,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18017988] [2019-12-27 22:34:28,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:28,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:28,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18017988] [2019-12-27 22:34:28,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:28,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:34:28,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1403706454] [2019-12-27 22:34:28,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:28,885 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:29,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 421 transitions. [2019-12-27 22:34:29,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:29,087 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:34:29,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:34:29,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:29,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:34:29,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:34:29,088 INFO L87 Difference]: Start difference. First operand 3864 states and 11147 transitions. Second operand 3 states. [2019-12-27 22:34:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:29,110 INFO L93 Difference]: Finished difference Result 3692 states and 10434 transitions. [2019-12-27 22:34:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:34:29,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 22:34:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:29,114 INFO L225 Difference]: With dead ends: 3692 [2019-12-27 22:34:29,114 INFO L226 Difference]: Without dead ends: 3692 [2019-12-27 22:34:29,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 4 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 22:34:29,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2019-12-27 22:34:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 2990. [2019-12-27 22:34:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2990 states. [2019-12-27 22:34:29,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 8464 transitions. [2019-12-27 22:34:29,163 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 8464 transitions. Word has length 67 [2019-12-27 22:34:29,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:29,163 INFO L462 AbstractCegarLoop]: Abstraction has 2990 states and 8464 transitions. [2019-12-27 22:34:29,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:34:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 8464 transitions. [2019-12-27 22:34:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:29,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:29,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:29,167 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1708175791, now seen corresponding path program 1 times [2019-12-27 22:34:29,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:29,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114850903] [2019-12-27 22:34:29,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:34:30,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114850903] [2019-12-27 22:34:30,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:30,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-27 22:34:30,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939263192] [2019-12-27 22:34:30,005 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:30,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:30,405 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 472 transitions. [2019-12-27 22:34:30,405 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:30,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:30,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:34:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:31,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:34:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:31,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 22:34:31,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:31,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:31,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:32,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:34:32,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:32,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:34:32,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:34:32,432 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 57 times. [2019-12-27 22:34:32,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-27 22:34:32,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:32,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-27 22:34:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=2013, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 22:34:32,435 INFO L87 Difference]: Start difference. First operand 2990 states and 8464 transitions. Second operand 48 states. [2019-12-27 22:34:46,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:46,334 INFO L93 Difference]: Finished difference Result 15804 states and 43785 transitions. [2019-12-27 22:34:46,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-27 22:34:46,335 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 68 [2019-12-27 22:34:46,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:46,354 INFO L225 Difference]: With dead ends: 15804 [2019-12-27 22:34:46,354 INFO L226 Difference]: Without dead ends: 15771 [2019-12-27 22:34:46,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 26 SyntacticMatches, 14 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3169 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1221, Invalid=8679, Unknown=0, NotChecked=0, Total=9900 [2019-12-27 22:34:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15771 states. [2019-12-27 22:34:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15771 to 4054. [2019-12-27 22:34:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4054 states. [2019-12-27 22:34:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4054 states to 4054 states and 11345 transitions. [2019-12-27 22:34:46,483 INFO L78 Accepts]: Start accepts. Automaton has 4054 states and 11345 transitions. Word has length 68 [2019-12-27 22:34:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:46,483 INFO L462 AbstractCegarLoop]: Abstraction has 4054 states and 11345 transitions. [2019-12-27 22:34:46,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-27 22:34:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4054 states and 11345 transitions. [2019-12-27 22:34:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:46,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:46,489 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:46,489 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:46,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:46,489 INFO L82 PathProgramCache]: Analyzing trace with hash -987957935, now seen corresponding path program 2 times [2019-12-27 22:34:46,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:46,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496529115] [2019-12-27 22:34:46,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:34:46,848 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 22:34:46,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496529115] [2019-12-27 22:34:46,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:34:46,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:34:46,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111670599] [2019-12-27 22:34:46,849 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:34:46,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:34:47,370 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 412 transitions. [2019-12-27 22:34:47,371 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:34:47,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:34:47,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:34:47,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:34:47,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:34:47,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:34:47,523 INFO L87 Difference]: Start difference. First operand 4054 states and 11345 transitions. Second operand 16 states. [2019-12-27 22:34:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:34:48,267 INFO L93 Difference]: Finished difference Result 6964 states and 19539 transitions. [2019-12-27 22:34:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:34:48,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-27 22:34:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:34:48,277 INFO L225 Difference]: With dead ends: 6964 [2019-12-27 22:34:48,277 INFO L226 Difference]: Without dead ends: 6931 [2019-12-27 22:34:48,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-12-27 22:34:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6931 states. [2019-12-27 22:34:48,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6931 to 4145. [2019-12-27 22:34:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4145 states. [2019-12-27 22:34:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4145 states to 4145 states and 11627 transitions. [2019-12-27 22:34:48,351 INFO L78 Accepts]: Start accepts. Automaton has 4145 states and 11627 transitions. Word has length 68 [2019-12-27 22:34:48,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:34:48,351 INFO L462 AbstractCegarLoop]: Abstraction has 4145 states and 11627 transitions. [2019-12-27 22:34:48,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:34:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 4145 states and 11627 transitions. [2019-12-27 22:34:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:34:48,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:34:48,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:34:48,357 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:34:48,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:34:48,357 INFO L82 PathProgramCache]: Analyzing trace with hash 947098105, now seen corresponding path program 3 times [2019-12-27 22:34:48,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:34:48,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875149335] [2019-12-27 22:34:48,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:34:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:34:48,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:34:48,496 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:34:48,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$r_buff0_thd3~0_18 0) (= 0 v_~y$w_buff1~0_28) (= 0 v_~weak$$choice0~0_8) (= 0 v_~y$r_buff1_thd3~0_17) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff0_used~0_123 0) (= 0 v_~y$r_buff1_thd0~0_49) (= 0 v_~__unbuffered_cnt~0_20) (= v_~y$r_buff0_thd2~0_20 0) (= v_~y$read_delayed~0_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27|)) (= v_~y$w_buff1_used~0_75 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2180~0.base_27|) (= v_~y~0_30 0) (= v_~x~0_13 0) (= 0 |v_ULTIMATE.start_main_~#t2180~0.offset_20|) (= (store .cse0 |v_ULTIMATE.start_main_~#t2180~0.base_27| 1) |v_#valid_63|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2180~0.base_27| 4)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2180~0.base_27|) |v_ULTIMATE.start_main_~#t2180~0.offset_20| 0)) |v_#memory_int_21|) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard0~0_6 0) (= v_~y$mem_tmp~0_11 0) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_83 0) (= 0 v_~y$w_buff0~0_30) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd2~0_17) (= |v_#NULL.offset_5| 0) (= v_~__unbuffered_p2_EAX~0_9 0) (= v_~main$tmp_guard1~0_12 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_9|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_11|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_13|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_11|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_16|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_17, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_9, ULTIMATE.start_main_~#t2180~0.offset=|v_ULTIMATE.start_main_~#t2180~0.offset_20|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_23|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_49, ~x~0=v_~x~0_13, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_13|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_13|, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ULTIMATE.start_main_~#t2180~0.base=|v_ULTIMATE.start_main_~#t2180~0.base_27|, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_13|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_75} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2180~0.offset, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2182~0.offset, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2181~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2180~0.base, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:34:48,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L800-1-->L802: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2181~0.offset_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2181~0.base_11|) |v_ULTIMATE.start_main_~#t2181~0.offset_10| 1)) |v_#memory_int_11|) (not (= |v_ULTIMATE.start_main_~#t2181~0.base_11| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2181~0.base_11| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2181~0.base_11|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11|)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2181~0.base_11| 1) |v_#valid_37|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2181~0.base=|v_ULTIMATE.start_main_~#t2181~0.base_11|, ULTIMATE.start_main_~#t2181~0.offset=|v_ULTIMATE.start_main_~#t2181~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2181~0.base, ULTIMATE.start_main_~#t2181~0.offset] because there is no mapped edge [2019-12-27 22:34:48,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= 1 v_~y$w_buff0_used~0_85) (= 2 v_~y$w_buff0~0_16) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff1_used~0_48 v_~y$w_buff0_used~0_86) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_~y$w_buff0~0_17 v_~y$w_buff1~0_13) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= 0 (mod v_~y$w_buff1_used~0_48 256)) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff0~0=v_~y$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_85, ~y$w_buff1~0=v_~y$w_buff1~0_13, ~y$w_buff0~0=v_~y$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_48} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:34:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2182~0.offset_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2182~0.base_13|) |v_ULTIMATE.start_main_~#t2182~0.offset_11| 2)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2182~0.base_13| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2182~0.base_13|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2182~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2182~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2182~0.base=|v_ULTIMATE.start_main_~#t2182~0.base_13|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2182~0.offset=|v_ULTIMATE.start_main_~#t2182~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2182~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2182~0.offset] because there is no mapped edge [2019-12-27 22:34:48,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In790195448 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In790195448 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out790195448|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out790195448| ~y$w_buff0_used~0_In790195448)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In790195448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In790195448} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out790195448|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In790195448, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In790195448} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:34:48,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1982063002 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1982063002 256) 0))) (or (and (= ~y$w_buff1~0_In-1982063002 |P1Thread1of1ForFork1_#t~ite9_Out-1982063002|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-1982063002| ~y~0_In-1982063002) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1982063002, ~y$w_buff1~0=~y$w_buff1~0_In-1982063002, ~y~0=~y~0_In-1982063002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1982063002} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1982063002, ~y$w_buff1~0=~y$w_buff1~0_In-1982063002, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1982063002|, ~y~0=~y~0_In-1982063002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1982063002} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:34:48,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1321740765 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1321740765 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1321740765 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1321740765 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1321740765 |P0Thread1of1ForFork0_#t~ite6_Out-1321740765|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1321740765|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1321740765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321740765, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1321740765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1321740765} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1321740765|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1321740765, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1321740765, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1321740765, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1321740765} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:34:48,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1141581735 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1141581735 256) 0))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out-1141581735 0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1141581735 ~y$r_buff0_thd1~0_Out-1141581735) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1141581735, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1141581735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1141581735, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1141581735|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1141581735} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:34:48,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-1308189072 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1308189072 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1308189072 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1308189072 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1308189072| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1308189072| ~y$r_buff1_thd1~0_In-1308189072) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1308189072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1308189072, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1308189072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1308189072} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1308189072, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1308189072, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1308189072|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1308189072, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1308189072} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:34:48,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:34:48,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-556491398 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-556491398 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-556491398| ~y$w_buff1~0_In-556491398) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out-556491398| ~y~0_In-556491398)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-556491398, ~y$w_buff1~0=~y$w_buff1~0_In-556491398, ~y~0=~y~0_In-556491398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-556491398} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-556491398, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-556491398|, ~y$w_buff1~0=~y$w_buff1~0_In-556491398, ~y~0=~y~0_In-556491398, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-556491398} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:34:48,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_20) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:34:48,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 22:34:48,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1351954548 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1351954548 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1351954548| ~y$w_buff0_used~0_In-1351954548)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1351954548|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1351954548, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1351954548} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1351954548, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1351954548, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1351954548|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:34:48,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In351383348 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In351383348 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In351383348 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In351383348 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out351383348| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In351383348 |P1Thread1of1ForFork1_#t~ite12_Out351383348|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In351383348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In351383348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In351383348, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351383348} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In351383348, ~y$w_buff0_used~0=~y$w_buff0_used~0_In351383348, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In351383348, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out351383348|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In351383348} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:34:48,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1294730195 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1294730195 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out-1294730195| ~y$r_buff0_thd2~0_In-1294730195) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1294730195| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294730195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1294730195} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1294730195, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1294730195, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1294730195|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:34:48,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In184668048 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In184668048 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In184668048 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In184668048 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In184668048 |P1Thread1of1ForFork1_#t~ite14_Out184668048|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out184668048|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In184668048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184668048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In184668048, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184668048} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In184668048, ~y$w_buff0_used~0=~y$w_buff0_used~0_In184668048, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In184668048, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out184668048|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In184668048} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:34:48,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L761-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:34:48,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-865532930 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-865532930 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-865532930| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-865532930| ~y$w_buff0_used~0_In-865532930)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-865532930, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-865532930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-865532930, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-865532930, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-865532930|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:34:48,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In367042798 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In367042798 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In367042798 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In367042798 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out367042798| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite18_Out367042798| ~y$w_buff1_used~0_In367042798) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In367042798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In367042798, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In367042798, ~y$w_buff1_used~0=~y$w_buff1_used~0_In367042798} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In367042798, ~y$w_buff0_used~0=~y$w_buff0_used~0_In367042798, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In367042798, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out367042798|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In367042798} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:34:48,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1518150712 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1518150712 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out1518150712| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1518150712| ~y$r_buff0_thd3~0_In1518150712) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1518150712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1518150712} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1518150712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1518150712, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1518150712|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:34:48,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-781039056 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-781039056 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-781039056 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-781039056 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-781039056|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd3~0_In-781039056 |P2Thread1of1ForFork2_#t~ite20_Out-781039056|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-781039056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781039056, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-781039056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781039056} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-781039056, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-781039056, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-781039056|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-781039056, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-781039056} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:34:48,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~y$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:34:48,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:34:48,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1574038974 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1574038974 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1574038974| |ULTIMATE.start_main_#t~ite25_Out1574038974|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out1574038974| ~y$w_buff1~0_In1574038974) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite24_Out1574038974| ~y~0_In1574038974) (or .cse2 .cse0) .cse1))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1574038974, ~y~0=~y~0_In1574038974, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1574038974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1574038974} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1574038974, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1574038974|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1574038974|, ~y~0=~y~0_In1574038974, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1574038974, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1574038974} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 22:34:48,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-653481406 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-653481406 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-653481406|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out-653481406| ~y$w_buff0_used~0_In-653481406)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-653481406, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-653481406} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-653481406, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-653481406, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-653481406|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:34:48,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1963843197 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1963843197 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1963843197 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1963843197 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1963843197| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out1963843197| ~y$w_buff1_used~0_In1963843197)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1963843197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1963843197, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963843197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963843197} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1963843197, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1963843197, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1963843197|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1963843197, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1963843197} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:34:48,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-774892575 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-774892575 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-774892575| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-774892575 |ULTIMATE.start_main_#t~ite28_Out-774892575|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-774892575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-774892575} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-774892575|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-774892575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-774892575} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:34:48,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1191089355 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1191089355 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1191089355 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1191089355 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1191089355|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1191089355 |ULTIMATE.start_main_#t~ite29_Out1191089355|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1191089355, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1191089355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1191089355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191089355} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1191089355, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1191089355|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1191089355, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1191089355, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191089355} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:34:48,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L823-->L823-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1860564800 256)))) (or (and (= ~y$w_buff1~0_In1860564800 |ULTIMATE.start_main_#t~ite39_Out1860564800|) (not .cse0) (= |ULTIMATE.start_main_#t~ite38_In1860564800| |ULTIMATE.start_main_#t~ite38_Out1860564800|)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1860564800 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1860564800 256)) (and (= (mod ~y$r_buff1_thd0~0_In1860564800 256) 0) .cse1) (and .cse1 (= (mod ~y$w_buff1_used~0_In1860564800 256) 0)))) (= |ULTIMATE.start_main_#t~ite38_Out1860564800| ~y$w_buff1~0_In1860564800) (= |ULTIMATE.start_main_#t~ite38_Out1860564800| |ULTIMATE.start_main_#t~ite39_Out1860564800|) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1860564800, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1860564800, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1860564800, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In1860564800|, ~weak$$choice2~0=~weak$$choice2~0_In1860564800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1860564800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1860564800} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1860564800, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1860564800, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1860564800|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1860564800, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1860564800|, ~weak$$choice2~0=~weak$$choice2~0_In1860564800, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1860564800, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1860564800} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 22:34:48,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L824-->L824-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1869057116 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1869057116| ~y$w_buff0_used~0_In1869057116) (= |ULTIMATE.start_main_#t~ite41_Out1869057116| |ULTIMATE.start_main_#t~ite42_Out1869057116|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1869057116 256)))) (or (and (= (mod ~y$r_buff1_thd0~0_In1869057116 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In1869057116 256) 0) (and (= (mod ~y$w_buff1_used~0_In1869057116 256) 0) .cse0))) .cse1) (and (= ~y$w_buff0_used~0_In1869057116 |ULTIMATE.start_main_#t~ite42_Out1869057116|) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_In1869057116| |ULTIMATE.start_main_#t~ite41_Out1869057116|)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In1869057116|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1869057116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1869057116, ~weak$$choice2~0=~weak$$choice2~0_In1869057116, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1869057116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1869057116} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1869057116|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1869057116, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1869057116, ~weak$$choice2~0=~weak$$choice2~0_In1869057116, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1869057116|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1869057116, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1869057116} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:34:48,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_65 v_~y$r_buff0_thd0~0_64)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:34:48,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L829-->L832-1: Formula: (and (= 0 v_~y$flush_delayed~0_10) (= v_~y~0_25 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_11 256))) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:34:48,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:34:48,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:34:48 BasicIcfg [2019-12-27 22:34:48,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:34:48,678 INFO L168 Benchmark]: Toolchain (without parser) took 95355.93 ms. Allocated memory was 137.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.8 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,679 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.72 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 153.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,687 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.61 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,688 INFO L168 Benchmark]: Boogie Preprocessor took 39.67 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,689 INFO L168 Benchmark]: RCFGBuilder took 851.24 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,690 INFO L168 Benchmark]: TraceAbstraction took 93660.08 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 22:34:48,700 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 717.72 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 153.6 MB in the end (delta: -53.3 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.61 ms. Allocated memory is still 202.4 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.67 ms. Allocated memory is still 202.4 MB. Free memory was 150.9 MB in the beginning and 148.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 851.24 ms. Allocated memory is still 202.4 MB. Free memory was 148.2 MB in the beginning and 98.3 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 93660.08 ms. Allocated memory was 202.4 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 173 ProgramPointsBefore, 96 ProgramPointsAfterwards, 210 TransitionsBefore, 107 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 30 ChoiceCompositions, 5662 VarBasedMoverChecksPositive, 190 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81965 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2180, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2181, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2182, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 93.2s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2430 SDtfs, 3777 SDslu, 10318 SDs, 0 SdLazy, 14302 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 84 SyntacticMatches, 43 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3445 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173329occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 63113 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 635 ConstructedInterpolants, 0 QuantifiedInterpolants, 166418 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...