/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:58:46,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:58:46,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:58:46,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:58:46,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:58:46,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:58:46,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:58:46,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:58:46,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:58:46,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:58:46,983 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:58:46,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:58:46,984 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:58:46,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:58:46,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:58:46,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:58:46,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:58:46,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:58:46,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:58:46,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:58:46,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:58:46,995 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:58:46,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:58:46,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:58:47,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:58:47,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:58:47,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:58:47,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:58:47,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:58:47,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:58:47,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:58:47,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:58:47,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:58:47,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:58:47,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:58:47,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:58:47,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:58:47,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:58:47,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:58:47,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:58:47,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:58:47,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:58:47,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:58:47,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:58:47,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:58:47,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:58:47,031 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:58:47,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:58:47,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:58:47,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:58:47,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:58:47,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:58:47,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:58:47,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:58:47,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:58:47,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:58:47,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:58:47,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:58:47,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:58:47,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:58:47,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:58:47,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:58:47,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:58:47,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:58:47,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:58:47,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:58:47,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:58:47,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:58:47,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:58:47,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:58:47,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:58:47,312 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:58:47,313 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 12:58:47,375 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c70531b/83550e662a764c54b818052fff0ba235/FLAGfc7879c81 [2019-12-18 12:58:47,930 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:58:47,931 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_pso.opt.i [2019-12-18 12:58:47,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c70531b/83550e662a764c54b818052fff0ba235/FLAGfc7879c81 [2019-12-18 12:58:48,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1c70531b/83550e662a764c54b818052fff0ba235 [2019-12-18 12:58:48,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:58:48,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:58:48,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:58:48,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:58:48,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:58:48,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:48,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e76b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48, skipping insertion in model container [2019-12-18 12:58:48,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:48,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:58:48,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:58:48,776 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:58:48,793 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:58:48,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:58:48,962 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:58:48,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48 WrapperNode [2019-12-18 12:58:48,963 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:58:48,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:58:48,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:58:48,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:58:48,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:58:49,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:58:49,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:58:49,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:58:49,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... [2019-12-18 12:58:49,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:58:49,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:58:49,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:58:49,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:58:49,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:58:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:58:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:58:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:58:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:58:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:58:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:58:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:58:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:58:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:58:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:58:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:58:49,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:58:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:58:49,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:58:49,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:58:49,154 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:58:49,895 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:58:49,895 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:58:49,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:58:49 BoogieIcfgContainer [2019-12-18 12:58:49,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:58:49,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:58:49,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:58:49,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:58:49,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:58:48" (1/3) ... [2019-12-18 12:58:49,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325869c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:58:49, skipping insertion in model container [2019-12-18 12:58:49,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:58:48" (2/3) ... [2019-12-18 12:58:49,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325869c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:58:49, skipping insertion in model container [2019-12-18 12:58:49,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:58:49" (3/3) ... [2019-12-18 12:58:49,910 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt.i [2019-12-18 12:58:49,920 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:58:49,921 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:58:49,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:58:49,930 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:58:49,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,987 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,989 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,989 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:49,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,041 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,049 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,050 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,051 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,052 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,053 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,054 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,059 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,059 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,059 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,060 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,061 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,062 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,062 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,062 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,062 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,062 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,063 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,064 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,070 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,071 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,072 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,073 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,074 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,074 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,080 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,083 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,092 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,093 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:58:50,108 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:58:50,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:58:50,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:58:50,129 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:58:50,129 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:58:50,129 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:58:50,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:58:50,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:58:50,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:58:50,148 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 12:58:50,150 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:58:50,247 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:58:50,247 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:58:50,266 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:58:50,294 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:58:50,352 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:58:50,353 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:58:50,362 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 448 event pairs. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:58:50,384 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 12:58:50,385 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:58:56,312 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:58:56,492 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:58:56,519 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66604 [2019-12-18 12:58:56,519 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:58:56,522 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions [2019-12-18 12:59:25,481 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 154566 states. [2019-12-18 12:59:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 154566 states. [2019-12-18 12:59:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:59:25,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:25,491 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:25,492 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1218656403, now seen corresponding path program 1 times [2019-12-18 12:59:25,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:25,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377316840] [2019-12-18 12:59:25,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:25,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377316840] [2019-12-18 12:59:25,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:25,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:59:25,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876330990] [2019-12-18 12:59:25,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:59:25,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:59:25,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:25,755 INFO L87 Difference]: Start difference. First operand 154566 states. Second operand 3 states. [2019-12-18 12:59:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:29,772 INFO L93 Difference]: Finished difference Result 152486 states and 727020 transitions. [2019-12-18 12:59:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:59:29,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:59:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:30,819 INFO L225 Difference]: With dead ends: 152486 [2019-12-18 12:59:30,819 INFO L226 Difference]: Without dead ends: 143750 [2019-12-18 12:59:30,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:59:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143750 states. [2019-12-18 12:59:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143750 to 143750. [2019-12-18 12:59:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143750 states. [2019-12-18 12:59:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143750 states to 143750 states and 684484 transitions. [2019-12-18 12:59:46,178 INFO L78 Accepts]: Start accepts. Automaton has 143750 states and 684484 transitions. Word has length 7 [2019-12-18 12:59:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:59:46,179 INFO L462 AbstractCegarLoop]: Abstraction has 143750 states and 684484 transitions. [2019-12-18 12:59:46,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:59:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 143750 states and 684484 transitions. [2019-12-18 12:59:46,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:59:46,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:59:46,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:59:46,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:59:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:59:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1478379087, now seen corresponding path program 1 times [2019-12-18 12:59:46,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:59:46,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477780370] [2019-12-18 12:59:46,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:59:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:59:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:59:46,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477780370] [2019-12-18 12:59:46,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:59:46,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:59:46,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432404556] [2019-12-18 12:59:46,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:59:46,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:59:46,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:59:46,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:59:46,318 INFO L87 Difference]: Start difference. First operand 143750 states and 684484 transitions. Second operand 4 states. [2019-12-18 12:59:53,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:59:53,327 INFO L93 Difference]: Finished difference Result 226574 states and 1038112 transitions. [2019-12-18 12:59:53,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:59:53,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:59:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:59:55,018 INFO L225 Difference]: With dead ends: 226574 [2019-12-18 12:59:55,018 INFO L226 Difference]: Without dead ends: 226406 [2019-12-18 12:59:55,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226406 states. [2019-12-18 13:00:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226406 to 210054. [2019-12-18 13:00:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210054 states. [2019-12-18 13:00:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210054 states to 210054 states and 970358 transitions. [2019-12-18 13:00:16,431 INFO L78 Accepts]: Start accepts. Automaton has 210054 states and 970358 transitions. Word has length 15 [2019-12-18 13:00:16,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:16,431 INFO L462 AbstractCegarLoop]: Abstraction has 210054 states and 970358 transitions. [2019-12-18 13:00:16,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:00:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 210054 states and 970358 transitions. [2019-12-18 13:00:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 13:00:16,436 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:16,436 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:16,437 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:16,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:16,437 INFO L82 PathProgramCache]: Analyzing trace with hash -731927730, now seen corresponding path program 1 times [2019-12-18 13:00:16,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:16,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008077666] [2019-12-18 13:00:16,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:16,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008077666] [2019-12-18 13:00:16,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:16,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:00:16,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114880566] [2019-12-18 13:00:16,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:00:16,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:00:16,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:16,510 INFO L87 Difference]: Start difference. First operand 210054 states and 970358 transitions. Second operand 3 states. [2019-12-18 13:00:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:19,106 INFO L93 Difference]: Finished difference Result 131238 states and 546355 transitions. [2019-12-18 13:00:19,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:00:19,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 13:00:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:19,521 INFO L225 Difference]: With dead ends: 131238 [2019-12-18 13:00:19,521 INFO L226 Difference]: Without dead ends: 131238 [2019-12-18 13:00:19,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:30,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131238 states. [2019-12-18 13:00:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131238 to 131238. [2019-12-18 13:00:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131238 states. [2019-12-18 13:00:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131238 states to 131238 states and 546355 transitions. [2019-12-18 13:00:33,050 INFO L78 Accepts]: Start accepts. Automaton has 131238 states and 546355 transitions. Word has length 15 [2019-12-18 13:00:33,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:33,051 INFO L462 AbstractCegarLoop]: Abstraction has 131238 states and 546355 transitions. [2019-12-18 13:00:33,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:00:33,051 INFO L276 IsEmpty]: Start isEmpty. Operand 131238 states and 546355 transitions. [2019-12-18 13:00:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:00:33,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:33,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:33,056 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash 437045286, now seen corresponding path program 1 times [2019-12-18 13:00:33,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:33,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048584883] [2019-12-18 13:00:33,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:33,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048584883] [2019-12-18 13:00:33,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:33,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:33,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641873463] [2019-12-18 13:00:33,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:00:33,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:00:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:00:33,144 INFO L87 Difference]: Start difference. First operand 131238 states and 546355 transitions. Second operand 4 states. [2019-12-18 13:00:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:33,334 INFO L93 Difference]: Finished difference Result 35878 states and 126762 transitions. [2019-12-18 13:00:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:00:33,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 13:00:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:33,433 INFO L225 Difference]: With dead ends: 35878 [2019-12-18 13:00:33,433 INFO L226 Difference]: Without dead ends: 35878 [2019-12-18 13:00:33,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:00:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35878 states. [2019-12-18 13:00:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35878 to 35878. [2019-12-18 13:00:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35878 states. [2019-12-18 13:00:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35878 states to 35878 states and 126762 transitions. [2019-12-18 13:00:38,519 INFO L78 Accepts]: Start accepts. Automaton has 35878 states and 126762 transitions. Word has length 16 [2019-12-18 13:00:38,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:38,520 INFO L462 AbstractCegarLoop]: Abstraction has 35878 states and 126762 transitions. [2019-12-18 13:00:38,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:00:38,520 INFO L276 IsEmpty]: Start isEmpty. Operand 35878 states and 126762 transitions. [2019-12-18 13:00:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 13:00:38,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:38,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:38,522 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1917193142, now seen corresponding path program 1 times [2019-12-18 13:00:38,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:38,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931799536] [2019-12-18 13:00:38,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:38,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931799536] [2019-12-18 13:00:38,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:38,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:38,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559306191] [2019-12-18 13:00:38,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:00:38,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:00:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:38,617 INFO L87 Difference]: Start difference. First operand 35878 states and 126762 transitions. Second operand 5 states. [2019-12-18 13:00:39,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:39,108 INFO L93 Difference]: Finished difference Result 51872 states and 179890 transitions. [2019-12-18 13:00:39,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 13:00:39,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 13:00:39,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:39,208 INFO L225 Difference]: With dead ends: 51872 [2019-12-18 13:00:39,209 INFO L226 Difference]: Without dead ends: 51856 [2019-12-18 13:00:39,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:00:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51856 states. [2019-12-18 13:00:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51856 to 40170. [2019-12-18 13:00:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40170 states. [2019-12-18 13:00:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40170 states to 40170 states and 141309 transitions. [2019-12-18 13:00:40,018 INFO L78 Accepts]: Start accepts. Automaton has 40170 states and 141309 transitions. Word has length 16 [2019-12-18 13:00:40,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:40,018 INFO L462 AbstractCegarLoop]: Abstraction has 40170 states and 141309 transitions. [2019-12-18 13:00:40,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:00:40,018 INFO L276 IsEmpty]: Start isEmpty. Operand 40170 states and 141309 transitions. [2019-12-18 13:00:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 13:00:40,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:40,035 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] [2019-12-18 13:00:40,035 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1134773804, now seen corresponding path program 1 times [2019-12-18 13:00:40,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:40,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305667114] [2019-12-18 13:00:40,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:40,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305667114] [2019-12-18 13:00:40,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:40,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:00:40,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019848209] [2019-12-18 13:00:40,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:00:40,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:00:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:00:40,465 INFO L87 Difference]: Start difference. First operand 40170 states and 141309 transitions. Second operand 6 states. [2019-12-18 13:00:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:41,552 INFO L93 Difference]: Finished difference Result 61953 states and 212351 transitions. [2019-12-18 13:00:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:00:41,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 13:00:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:41,695 INFO L225 Difference]: With dead ends: 61953 [2019-12-18 13:00:41,695 INFO L226 Difference]: Without dead ends: 61925 [2019-12-18 13:00:41,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 13:00:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61925 states. [2019-12-18 13:00:42,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61925 to 41940. [2019-12-18 13:00:42,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41940 states. [2019-12-18 13:00:42,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41940 states to 41940 states and 146496 transitions. [2019-12-18 13:00:42,646 INFO L78 Accepts]: Start accepts. Automaton has 41940 states and 146496 transitions. Word has length 24 [2019-12-18 13:00:42,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:42,646 INFO L462 AbstractCegarLoop]: Abstraction has 41940 states and 146496 transitions. [2019-12-18 13:00:42,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:00:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 41940 states and 146496 transitions. [2019-12-18 13:00:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 13:00:43,110 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:43,110 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] [2019-12-18 13:00:43,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:43,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 324599252, now seen corresponding path program 1 times [2019-12-18 13:00:43,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:43,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040134829] [2019-12-18 13:00:43,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:43,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040134829] [2019-12-18 13:00:43,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:43,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 13:00:43,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35324022] [2019-12-18 13:00:43,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 13:00:43,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:43,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 13:00:43,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:43,188 INFO L87 Difference]: Start difference. First operand 41940 states and 146496 transitions. Second operand 5 states. [2019-12-18 13:00:43,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:43,303 INFO L93 Difference]: Finished difference Result 21549 states and 76131 transitions. [2019-12-18 13:00:43,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 13:00:43,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 13:00:43,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:43,343 INFO L225 Difference]: With dead ends: 21549 [2019-12-18 13:00:43,343 INFO L226 Difference]: Without dead ends: 21549 [2019-12-18 13:00:43,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21549 states. [2019-12-18 13:00:43,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21549 to 21357. [2019-12-18 13:00:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21357 states. [2019-12-18 13:00:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21357 states to 21357 states and 75475 transitions. [2019-12-18 13:00:43,703 INFO L78 Accepts]: Start accepts. Automaton has 21357 states and 75475 transitions. Word has length 28 [2019-12-18 13:00:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:43,703 INFO L462 AbstractCegarLoop]: Abstraction has 21357 states and 75475 transitions. [2019-12-18 13:00:43,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 13:00:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 21357 states and 75475 transitions. [2019-12-18 13:00:43,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 13:00:43,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:43,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:43,739 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:43,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:43,739 INFO L82 PathProgramCache]: Analyzing trace with hash 261118904, now seen corresponding path program 1 times [2019-12-18 13:00:43,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:43,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472778786] [2019-12-18 13:00:43,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:43,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:43,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472778786] [2019-12-18 13:00:43,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:43,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 13:00:43,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474206784] [2019-12-18 13:00:43,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 13:00:43,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 13:00:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:00:43,856 INFO L87 Difference]: Start difference. First operand 21357 states and 75475 transitions. Second operand 6 states. [2019-12-18 13:00:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:43,989 INFO L93 Difference]: Finished difference Result 20070 states and 72184 transitions. [2019-12-18 13:00:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 13:00:43,990 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 13:00:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:44,028 INFO L225 Difference]: With dead ends: 20070 [2019-12-18 13:00:44,028 INFO L226 Difference]: Without dead ends: 20070 [2019-12-18 13:00:44,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 13:00:44,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2019-12-18 13:00:44,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19446. [2019-12-18 13:00:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19446 states. [2019-12-18 13:00:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19446 states to 19446 states and 70120 transitions. [2019-12-18 13:00:44,378 INFO L78 Accepts]: Start accepts. Automaton has 19446 states and 70120 transitions. Word has length 42 [2019-12-18 13:00:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:44,378 INFO L462 AbstractCegarLoop]: Abstraction has 19446 states and 70120 transitions. [2019-12-18 13:00:44,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 13:00:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 19446 states and 70120 transitions. [2019-12-18 13:00:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:44,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:44,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:44,413 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:44,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:44,414 INFO L82 PathProgramCache]: Analyzing trace with hash -2124071368, now seen corresponding path program 1 times [2019-12-18 13:00:44,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:44,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030168888] [2019-12-18 13:00:44,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:44,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030168888] [2019-12-18 13:00:44,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:44,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:44,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992897237] [2019-12-18 13:00:44,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:00:44,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:00:44,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:44,479 INFO L87 Difference]: Start difference. First operand 19446 states and 70120 transitions. Second operand 3 states. [2019-12-18 13:00:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:44,696 INFO L93 Difference]: Finished difference Result 28624 states and 103119 transitions. [2019-12-18 13:00:44,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:00:44,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:00:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:44,789 INFO L225 Difference]: With dead ends: 28624 [2019-12-18 13:00:44,790 INFO L226 Difference]: Without dead ends: 28624 [2019-12-18 13:00:44,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28624 states. [2019-12-18 13:00:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28624 to 22286. [2019-12-18 13:00:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22286 states. [2019-12-18 13:00:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22286 states to 22286 states and 80860 transitions. [2019-12-18 13:00:45,598 INFO L78 Accepts]: Start accepts. Automaton has 22286 states and 80860 transitions. Word has length 56 [2019-12-18 13:00:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:45,598 INFO L462 AbstractCegarLoop]: Abstraction has 22286 states and 80860 transitions. [2019-12-18 13:00:45,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:00:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 22286 states and 80860 transitions. [2019-12-18 13:00:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:45,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:45,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:45,631 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:45,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:45,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1367478236, now seen corresponding path program 1 times [2019-12-18 13:00:45,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:45,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925358062] [2019-12-18 13:00:45,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:45,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925358062] [2019-12-18 13:00:45,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:45,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:45,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332950359] [2019-12-18 13:00:45,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:00:45,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:45,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:00:45,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:00:45,778 INFO L87 Difference]: Start difference. First operand 22286 states and 80860 transitions. Second operand 4 states. [2019-12-18 13:00:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:45,932 INFO L93 Difference]: Finished difference Result 31580 states and 109851 transitions. [2019-12-18 13:00:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:00:45,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 13:00:45,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:45,974 INFO L225 Difference]: With dead ends: 31580 [2019-12-18 13:00:45,974 INFO L226 Difference]: Without dead ends: 20426 [2019-12-18 13:00:45,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20426 states. [2019-12-18 13:00:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20426 to 20426. [2019-12-18 13:00:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20426 states. [2019-12-18 13:00:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20426 states to 20426 states and 73106 transitions. [2019-12-18 13:00:46,330 INFO L78 Accepts]: Start accepts. Automaton has 20426 states and 73106 transitions. Word has length 56 [2019-12-18 13:00:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:46,330 INFO L462 AbstractCegarLoop]: Abstraction has 20426 states and 73106 transitions. [2019-12-18 13:00:46,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:00:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 20426 states and 73106 transitions. [2019-12-18 13:00:46,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:46,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:46,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:46,359 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:46,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:46,359 INFO L82 PathProgramCache]: Analyzing trace with hash -409451146, now seen corresponding path program 2 times [2019-12-18 13:00:46,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:46,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210853459] [2019-12-18 13:00:46,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:46,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210853459] [2019-12-18 13:00:46,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:46,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:46,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102911443] [2019-12-18 13:00:46,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 13:00:46,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 13:00:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 13:00:46,463 INFO L87 Difference]: Start difference. First operand 20426 states and 73106 transitions. Second operand 4 states. [2019-12-18 13:00:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:46,598 INFO L93 Difference]: Finished difference Result 29468 states and 101361 transitions. [2019-12-18 13:00:46,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 13:00:46,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-18 13:00:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:46,613 INFO L225 Difference]: With dead ends: 29468 [2019-12-18 13:00:46,614 INFO L226 Difference]: Without dead ends: 9593 [2019-12-18 13:00:46,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 13:00:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9593 states. [2019-12-18 13:00:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9593 to 9593. [2019-12-18 13:00:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2019-12-18 13:00:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 29814 transitions. [2019-12-18 13:00:46,962 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 29814 transitions. Word has length 56 [2019-12-18 13:00:46,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:46,962 INFO L462 AbstractCegarLoop]: Abstraction has 9593 states and 29814 transitions. [2019-12-18 13:00:46,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 13:00:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 29814 transitions. [2019-12-18 13:00:46,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:46,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:46,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:46,976 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:46,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:46,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1090544788, now seen corresponding path program 1 times [2019-12-18 13:00:46,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:46,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650520531] [2019-12-18 13:00:46,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:47,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650520531] [2019-12-18 13:00:47,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:47,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 13:00:47,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781258666] [2019-12-18 13:00:47,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:00:47,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:47,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:00:47,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:47,035 INFO L87 Difference]: Start difference. First operand 9593 states and 29814 transitions. Second operand 3 states. [2019-12-18 13:00:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:47,124 INFO L93 Difference]: Finished difference Result 11649 states and 35156 transitions. [2019-12-18 13:00:47,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:00:47,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:00:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:47,145 INFO L225 Difference]: With dead ends: 11649 [2019-12-18 13:00:47,145 INFO L226 Difference]: Without dead ends: 11325 [2019-12-18 13:00:47,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11325 states. [2019-12-18 13:00:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11325 to 9701. [2019-12-18 13:00:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9701 states. [2019-12-18 13:00:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9701 states to 9701 states and 29512 transitions. [2019-12-18 13:00:47,353 INFO L78 Accepts]: Start accepts. Automaton has 9701 states and 29512 transitions. Word has length 56 [2019-12-18 13:00:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:47,353 INFO L462 AbstractCegarLoop]: Abstraction has 9701 states and 29512 transitions. [2019-12-18 13:00:47,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:00:47,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9701 states and 29512 transitions. [2019-12-18 13:00:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:47,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:47,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:47,364 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:47,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1851629426, now seen corresponding path program 3 times [2019-12-18 13:00:47,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:47,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772441754] [2019-12-18 13:00:47,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:47,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772441754] [2019-12-18 13:00:47,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:47,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:00:47,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861110382] [2019-12-18 13:00:47,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:00:47,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:47,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:00:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:00:47,449 INFO L87 Difference]: Start difference. First operand 9701 states and 29512 transitions. Second operand 7 states. [2019-12-18 13:00:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:47,883 INFO L93 Difference]: Finished difference Result 26685 states and 80710 transitions. [2019-12-18 13:00:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 13:00:47,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 13:00:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:47,923 INFO L225 Difference]: With dead ends: 26685 [2019-12-18 13:00:47,923 INFO L226 Difference]: Without dead ends: 20531 [2019-12-18 13:00:47,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 13:00:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20531 states. [2019-12-18 13:00:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20531 to 12175. [2019-12-18 13:00:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12175 states. [2019-12-18 13:00:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 37257 transitions. [2019-12-18 13:00:48,289 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 37257 transitions. Word has length 56 [2019-12-18 13:00:48,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:48,290 INFO L462 AbstractCegarLoop]: Abstraction has 12175 states and 37257 transitions. [2019-12-18 13:00:48,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:00:48,290 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 37257 transitions. [2019-12-18 13:00:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:48,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:48,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:48,308 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:48,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1882211558, now seen corresponding path program 4 times [2019-12-18 13:00:48,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:48,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246062508] [2019-12-18 13:00:48,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:48,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:48,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246062508] [2019-12-18 13:00:48,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:48,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:00:48,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459316903] [2019-12-18 13:00:48,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:00:48,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:48,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:00:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:00:48,389 INFO L87 Difference]: Start difference. First operand 12175 states and 37257 transitions. Second operand 7 states. [2019-12-18 13:00:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:48,827 INFO L93 Difference]: Finished difference Result 33792 states and 100998 transitions. [2019-12-18 13:00:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 13:00:48,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 13:00:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:48,863 INFO L225 Difference]: With dead ends: 33792 [2019-12-18 13:00:48,863 INFO L226 Difference]: Without dead ends: 24259 [2019-12-18 13:00:48,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 13:00:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24259 states. [2019-12-18 13:00:49,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24259 to 14950. [2019-12-18 13:00:49,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14950 states. [2019-12-18 13:00:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14950 states to 14950 states and 45664 transitions. [2019-12-18 13:00:49,177 INFO L78 Accepts]: Start accepts. Automaton has 14950 states and 45664 transitions. Word has length 56 [2019-12-18 13:00:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:49,177 INFO L462 AbstractCegarLoop]: Abstraction has 14950 states and 45664 transitions. [2019-12-18 13:00:49,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:00:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 14950 states and 45664 transitions. [2019-12-18 13:00:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:49,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:49,193 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:49,193 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1708028504, now seen corresponding path program 5 times [2019-12-18 13:00:49,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:49,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143531225] [2019-12-18 13:00:49,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:49,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143531225] [2019-12-18 13:00:49,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:49,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 13:00:49,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569161224] [2019-12-18 13:00:49,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:00:49,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:49,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:00:49,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:00:49,288 INFO L87 Difference]: Start difference. First operand 14950 states and 45664 transitions. Second operand 7 states. [2019-12-18 13:00:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:49,711 INFO L93 Difference]: Finished difference Result 29762 states and 88396 transitions. [2019-12-18 13:00:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 13:00:49,711 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 13:00:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:49,748 INFO L225 Difference]: With dead ends: 29762 [2019-12-18 13:00:49,748 INFO L226 Difference]: Without dead ends: 24890 [2019-12-18 13:00:49,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 13:00:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24890 states. [2019-12-18 13:00:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24890 to 15160. [2019-12-18 13:00:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15160 states. [2019-12-18 13:00:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15160 states to 15160 states and 46251 transitions. [2019-12-18 13:00:50,050 INFO L78 Accepts]: Start accepts. Automaton has 15160 states and 46251 transitions. Word has length 56 [2019-12-18 13:00:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:50,050 INFO L462 AbstractCegarLoop]: Abstraction has 15160 states and 46251 transitions. [2019-12-18 13:00:50,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:00:50,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15160 states and 46251 transitions. [2019-12-18 13:00:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:50,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:50,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:50,066 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -373595762, now seen corresponding path program 6 times [2019-12-18 13:00:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:50,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304826540] [2019-12-18 13:00:50,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:50,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304826540] [2019-12-18 13:00:50,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:50,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 13:00:50,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509051439] [2019-12-18 13:00:50,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 13:00:50,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 13:00:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 13:00:50,179 INFO L87 Difference]: Start difference. First operand 15160 states and 46251 transitions. Second operand 7 states. [2019-12-18 13:00:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:51,251 INFO L93 Difference]: Finished difference Result 25062 states and 73716 transitions. [2019-12-18 13:00:51,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 13:00:51,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-18 13:00:51,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:51,288 INFO L225 Difference]: With dead ends: 25062 [2019-12-18 13:00:51,288 INFO L226 Difference]: Without dead ends: 24936 [2019-12-18 13:00:51,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 13:00:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24936 states. [2019-12-18 13:00:51,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24936 to 16054. [2019-12-18 13:00:51,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16054 states. [2019-12-18 13:00:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16054 states to 16054 states and 48825 transitions. [2019-12-18 13:00:51,598 INFO L78 Accepts]: Start accepts. Automaton has 16054 states and 48825 transitions. Word has length 56 [2019-12-18 13:00:51,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:51,598 INFO L462 AbstractCegarLoop]: Abstraction has 16054 states and 48825 transitions. [2019-12-18 13:00:51,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 13:00:51,598 INFO L276 IsEmpty]: Start isEmpty. Operand 16054 states and 48825 transitions. [2019-12-18 13:00:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 13:00:51,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:51,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 13:00:51,616 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:51,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1994896084, now seen corresponding path program 7 times [2019-12-18 13:00:51,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:51,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4777601] [2019-12-18 13:00:51,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:51,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4777601] [2019-12-18 13:00:51,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:51,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:00:51,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001995183] [2019-12-18 13:00:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:00:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:00:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:51,725 INFO L87 Difference]: Start difference. First operand 16054 states and 48825 transitions. Second operand 3 states. [2019-12-18 13:00:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:51,800 INFO L93 Difference]: Finished difference Result 16052 states and 48820 transitions. [2019-12-18 13:00:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:00:51,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 13:00:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:51,832 INFO L225 Difference]: With dead ends: 16052 [2019-12-18 13:00:51,832 INFO L226 Difference]: Without dead ends: 16052 [2019-12-18 13:00:51,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16052 states. [2019-12-18 13:00:52,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16052 to 14388. [2019-12-18 13:00:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14388 states. [2019-12-18 13:00:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14388 states to 14388 states and 44292 transitions. [2019-12-18 13:00:52,342 INFO L78 Accepts]: Start accepts. Automaton has 14388 states and 44292 transitions. Word has length 56 [2019-12-18 13:00:52,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:52,342 INFO L462 AbstractCegarLoop]: Abstraction has 14388 states and 44292 transitions. [2019-12-18 13:00:52,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:00:52,342 INFO L276 IsEmpty]: Start isEmpty. Operand 14388 states and 44292 transitions. [2019-12-18 13:00:52,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 13:00:52,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:52,365 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] [2019-12-18 13:00:52,365 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:52,366 INFO L82 PathProgramCache]: Analyzing trace with hash 423913779, now seen corresponding path program 1 times [2019-12-18 13:00:52,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:52,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162629049] [2019-12-18 13:00:52,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 13:00:52,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 13:00:52,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162629049] [2019-12-18 13:00:52,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 13:00:52,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 13:00:52,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104788408] [2019-12-18 13:00:52,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 13:00:52,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 13:00:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 13:00:52,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:52,467 INFO L87 Difference]: Start difference. First operand 14388 states and 44292 transitions. Second operand 3 states. [2019-12-18 13:00:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 13:00:52,525 INFO L93 Difference]: Finished difference Result 11370 states and 34226 transitions. [2019-12-18 13:00:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 13:00:52,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 13:00:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 13:00:52,545 INFO L225 Difference]: With dead ends: 11370 [2019-12-18 13:00:52,545 INFO L226 Difference]: Without dead ends: 11370 [2019-12-18 13:00:52,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 13:00:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11370 states. [2019-12-18 13:00:52,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11370 to 10841. [2019-12-18 13:00:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10841 states. [2019-12-18 13:00:52,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10841 states to 10841 states and 32624 transitions. [2019-12-18 13:00:52,713 INFO L78 Accepts]: Start accepts. Automaton has 10841 states and 32624 transitions. Word has length 57 [2019-12-18 13:00:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 13:00:52,713 INFO L462 AbstractCegarLoop]: Abstraction has 10841 states and 32624 transitions. [2019-12-18 13:00:52,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 13:00:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10841 states and 32624 transitions. [2019-12-18 13:00:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 13:00:52,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 13:00:52,725 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] [2019-12-18 13:00:52,725 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 13:00:52,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 13:00:52,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1370986964, now seen corresponding path program 1 times [2019-12-18 13:00:52,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 13:00:52,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570436442] [2019-12-18 13:00:52,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 13:00:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:00:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 13:00:52,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 13:00:52,845 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 13:00:52,850 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [854] [854] ULTIMATE.startENTRY-->L843: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= 0 v_~y$r_buff0_thd2~0_398) (= 0 v_~y$read_delayed_var~0.base_4) (= v_~y$w_buff1_used~0_631 0) (= v_~y$r_buff1_thd0~0_221 0) (= 0 v_~y$read_delayed_var~0.offset_4) (= 0 v_~y$r_buff1_thd2~0_382) (= 0 v_~__unbuffered_p0_EAX~0_56) (< 0 |v_#StackHeapBarrier_22|) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_46 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32|)) (= 0 v_~y$r_buff0_thd4~0_132) (= 0 v_~__unbuffered_p3_EAX~0_43) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~y$r_buff1_thd4~0_217) (= v_~main$tmp_guard1~0_34 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_52) (= 0 v_~y$w_buff0~0_506) (= v_~z~0_169 0) (= 0 v_~weak$$choice0~0_18) (= v_~y$w_buff0_used~0_913 0) (= v_~weak$$choice2~0_212 0) (= 0 v_~y$r_buff0_thd3~0_241) (= 0 |v_#NULL.base_6|) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t693~0.base_32| 1)) (= 0 v_~y$r_buff1_thd3~0_210) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t693~0.base_32|) (= v_~y~0_184 0) (= 0 v_~y$flush_delayed~0_45) (= v_~y$mem_tmp~0_20 0) (= v_~y$w_buff1~0_341 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t693~0.base_32|) |v_ULTIMATE.start_main_~#t693~0.offset_23| 0)) |v_#memory_int_25|) (= v_~y$r_buff0_thd0~0_136 0) (= v_~x~0_40 0) (= 0 |v_ULTIMATE.start_main_~#t693~0.offset_23|) (= v_~y$r_buff1_thd1~0_134 0) (= v_~a~0_41 0) (= 0 v_~__unbuffered_p3_EBX~0_43) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t693~0.base_32| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_77|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_45|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~a~0=v_~a~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_20, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_210, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, ULTIMATE.start_main_~#t693~0.offset=|v_ULTIMATE.start_main_~#t693~0.offset_23|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_46, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_43, #length=|v_#length_31|, ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_16|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_27|, ~weak$$choice0~0=v_~weak$$choice0~0_18, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_217, ~y$w_buff1~0=v_~y$w_buff1~0_341, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_4, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_16|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_398, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ULTIMATE.start_main_~#t693~0.base=|v_ULTIMATE.start_main_~#t693~0.base_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_221, ~x~0=v_~x~0_40, ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_34|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_4, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_24|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_45|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_77|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_134, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y~0=v_~y~0_184, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_43, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_26|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_382, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_10|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_19|, ~z~0=v_~z~0_169, ~weak$$choice2~0=v_~weak$$choice2~0_212, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t693~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t695~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t693~0.base, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t694~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t694~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t695~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t696~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:00:52,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L843-1-->L845: Formula: (and (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13| 1) |v_#valid_46|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t694~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t694~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t694~0.base_13| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t694~0.base_13|) |v_ULTIMATE.start_main_~#t694~0.offset_11| 1)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t694~0.base_13|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t694~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t694~0.base=|v_ULTIMATE.start_main_~#t694~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t694~0.offset=|v_ULTIMATE.start_main_~#t694~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t694~0.base, ULTIMATE.start_main_~#t694~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 13:00:52,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L845-1-->L847: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t695~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t695~0.offset_9| 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t695~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t695~0.base_11|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t695~0.base_11|) |v_ULTIMATE.start_main_~#t695~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t695~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t695~0.offset=|v_ULTIMATE.start_main_~#t695~0.offset_9|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t695~0.base=|v_ULTIMATE.start_main_~#t695~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t695~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t695~0.base] because there is no mapped edge [2019-12-18 13:00:52,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L4-->L797: Formula: (and (= v_~y$r_buff0_thd3~0_37 v_~y$r_buff1_thd3~0_33) (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_36 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42 0)) (= v_~y$r_buff0_thd4~0_29 v_~y$r_buff1_thd4~0_26) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd0~0_35 v_~y$r_buff1_thd0~0_25) (= v_~z~0_14 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_37, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_36, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_35, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_42, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 13:00:52,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t696~0.base_9| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t696~0.base_9|)) (not (= 0 |v_ULTIMATE.start_main_~#t696~0.base_9|)) (= |v_ULTIMATE.start_main_~#t696~0.offset_8| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t696~0.base_9|) |v_ULTIMATE.start_main_~#t696~0.offset_8| 3)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t696~0.offset=|v_ULTIMATE.start_main_~#t696~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t696~0.base=|v_ULTIMATE.start_main_~#t696~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t696~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, #length, ULTIMATE.start_main_~#t696~0.base] because there is no mapped edge [2019-12-18 13:00:52,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_27 v_~__unbuffered_p0_EAX~0_27) (= v_~a~0_26 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_118 (+ v_~__unbuffered_cnt~0_119 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27} OutVars{~a~0=v_~a~0_26, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_27, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_27, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 13:00:52,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2048295246 256)))) (or (and .cse0 (= ~y$w_buff1~0_In2048295246 |P1Thread1of1ForFork2_#t~ite11_Out2048295246|) (= |P1Thread1of1ForFork2_#t~ite12_Out2048295246| |P1Thread1of1ForFork2_#t~ite11_Out2048295246|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In2048295246 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In2048295246 256)) (and (= 0 (mod ~y$w_buff1_used~0_In2048295246 256)) .cse1) (and (= (mod ~y$r_buff1_thd2~0_In2048295246 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out2048295246| ~y$w_buff1~0_In2048295246) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In2048295246| |P1Thread1of1ForFork2_#t~ite11_Out2048295246|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048295246, ~y$w_buff1~0=~y$w_buff1~0_In2048295246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048295246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048295246, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In2048295246|, ~weak$$choice2~0=~weak$$choice2~0_In2048295246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048295246} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2048295246, ~y$w_buff1~0=~y$w_buff1~0_In2048295246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2048295246, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2048295246, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2048295246|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out2048295246|, ~weak$$choice2~0=~weak$$choice2~0_In2048295246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048295246} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 13:00:52,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1018574144 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In-1018574144| |P1Thread1of1ForFork2_#t~ite14_Out-1018574144|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite15_Out-1018574144| ~y$w_buff0_used~0_In-1018574144)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1018574144| ~y$w_buff0_used~0_In-1018574144) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1018574144 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1018574144 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1018574144 256)) (and (= (mod ~y$w_buff1_used~0_In-1018574144 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-1018574144| |P1Thread1of1ForFork2_#t~ite14_Out-1018574144|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1018574144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018574144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1018574144, ~weak$$choice2~0=~weak$$choice2~0_In-1018574144, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1018574144|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018574144} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1018574144, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1018574144, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1018574144, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1018574144|, ~weak$$choice2~0=~weak$$choice2~0_In-1018574144, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1018574144|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1018574144} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 13:00:52,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L764-->L764-8: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2004956924 256))) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In2004956924 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2004956924 256))) (.cse0 (= |P1Thread1of1ForFork2_#t~ite17_Out2004956924| |P1Thread1of1ForFork2_#t~ite18_Out2004956924|)) (.cse5 (= (mod ~weak$$choice2~0_In2004956924 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In2004956924 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite16_In2004956924| |P1Thread1of1ForFork2_#t~ite16_Out2004956924|) (or (and (= ~y$w_buff1_used~0_In2004956924 |P1Thread1of1ForFork2_#t~ite17_Out2004956924|) .cse0 (or .cse1 (and .cse2 .cse3) (and .cse2 .cse4)) .cse5) (and (= |P1Thread1of1ForFork2_#t~ite17_Out2004956924| |P1Thread1of1ForFork2_#t~ite17_In2004956924|) (not .cse5) (= ~y$w_buff1_used~0_In2004956924 |P1Thread1of1ForFork2_#t~ite18_Out2004956924|)))) (let ((.cse6 (not .cse2))) (and (or (not .cse3) .cse6) (= |P1Thread1of1ForFork2_#t~ite16_Out2004956924| 0) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork2_#t~ite16_Out2004956924| |P1Thread1of1ForFork2_#t~ite17_Out2004956924|) (not .cse1) .cse0 .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2004956924, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_In2004956924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2004956924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004956924, ~weak$$choice2~0=~weak$$choice2~0_In2004956924, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_In2004956924|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2004956924} OutVars{P1Thread1of1ForFork2_#t~ite18=|P1Thread1of1ForFork2_#t~ite18_Out2004956924|, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2004956924, P1Thread1of1ForFork2_#t~ite17=|P1Thread1of1ForFork2_#t~ite17_Out2004956924|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2004956924, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2004956924, ~weak$$choice2~0=~weak$$choice2~0_In2004956924, P1Thread1of1ForFork2_#t~ite16=|P1Thread1of1ForFork2_#t~ite16_Out2004956924|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2004956924} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 13:00:52,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L764-8-->L766: Formula: (and (= v_~y$r_buff0_thd2~0_378 v_~y$r_buff0_thd2~0_377) (not (= 0 (mod v_~weak$$choice2~0_200 256))) (= v_~y$w_buff1_used~0_614 |v_P1Thread1of1ForFork2_#t~ite18_33|)) InVars {P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_33|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_378, ~weak$$choice2~0=v_~weak$$choice2~0_200} OutVars{P1Thread1of1ForFork2_#t~ite18=|v_P1Thread1of1ForFork2_#t~ite18_32|, P1Thread1of1ForFork2_#t~ite17=|v_P1Thread1of1ForFork2_#t~ite17_30|, P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_25|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_377, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_37|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_15|, ~weak$$choice2~0=v_~weak$$choice2~0_200, P1Thread1of1ForFork2_#t~ite16=|v_P1Thread1of1ForFork2_#t~ite16_30|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_614} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite18, P1Thread1of1ForFork2_#t~ite17, P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21, P1Thread1of1ForFork2_#t~ite16, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 13:00:52,865 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1935342428 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-1935342428| |P1Thread1of1ForFork2_#t~ite23_Out-1935342428|) .cse0 (= ~y$r_buff1_thd2~0_In-1935342428 |P1Thread1of1ForFork2_#t~ite23_Out-1935342428|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1935342428 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1935342428 256))) (= (mod ~y$w_buff0_used~0_In-1935342428 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1935342428 256)) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite23_In-1935342428| |P1Thread1of1ForFork2_#t~ite23_Out-1935342428|) (= |P1Thread1of1ForFork2_#t~ite24_Out-1935342428| ~y$r_buff1_thd2~0_In-1935342428) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1935342428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1935342428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1935342428, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-1935342428|, ~weak$$choice2~0=~weak$$choice2~0_In-1935342428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1935342428} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1935342428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1935342428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1935342428, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-1935342428|, ~weak$$choice2~0=~weak$$choice2~0_In-1935342428, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-1935342428|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1935342428} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 13:00:52,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L768-->L776: Formula: (and (= v_~y~0_60 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_15) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, ~y~0=v_~y~0_60, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 13:00:52,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L820-2-->L820-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In930712794 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In930712794 256) 0)) (.cse2 (= |P3Thread1of1ForFork0_#t~ite33_Out930712794| |P3Thread1of1ForFork0_#t~ite32_Out930712794|))) (or (and (= ~y~0_In930712794 |P3Thread1of1ForFork0_#t~ite32_Out930712794|) (or .cse0 .cse1) .cse2) (and (not .cse1) (not .cse0) .cse2 (= ~y$w_buff1~0_In930712794 |P3Thread1of1ForFork0_#t~ite32_Out930712794|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In930712794, ~y$w_buff1~0=~y$w_buff1~0_In930712794, ~y~0=~y~0_In930712794, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In930712794, ~y$w_buff1~0=~y$w_buff1~0_In930712794, ~y~0=~y~0_In930712794, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out930712794|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out930712794|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In930712794} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 13:00:52,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In489222260 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In489222260 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out489222260| 0)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out489222260| ~y$w_buff0_used~0_In489222260) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In489222260, ~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In489222260, ~y$w_buff0_used~0=~y$w_buff0_used~0_In489222260, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out489222260|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 13:00:52,869 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd4~0_In-56705953 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-56705953 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd4~0_In-56705953 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-56705953 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out-56705953| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite35_Out-56705953| ~y$w_buff1_used~0_In-56705953) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-56705953, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-56705953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56705953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56705953} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-56705953, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-56705953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-56705953, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-56705953|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-56705953} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 13:00:52,870 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-1515598709 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1515598709 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1515598709|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out-1515598709| ~y$r_buff0_thd4~0_In-1515598709)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1515598709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1515598709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1515598709, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1515598709|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 13:00:52,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd4~0_In-264998810 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-264998810 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-264998810 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd4~0_In-264998810 256) 0))) (or (and (= |P3Thread1of1ForFork0_#t~ite37_Out-264998810| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite37_Out-264998810| ~y$r_buff1_thd4~0_In-264998810)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-264998810, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-264998810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264998810} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-264998810, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-264998810, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-264998810, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-264998810|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-264998810} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 13:00:52,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L824-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_130 (+ v_~__unbuffered_cnt~0_131 1)) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_54| v_~y$r_buff1_thd4~0_148)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_148, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_53|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 13:00:52,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1522336652 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1522336652 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out-1522336652| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1522336652 |P2Thread1of1ForFork3_#t~ite28_Out-1522336652|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1522336652, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1522336652} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1522336652, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1522336652, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1522336652|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 13:00:52,875 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1110952591 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1110952591 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-1110952591 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1110952591 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out-1110952591| 0)) (and (= |P2Thread1of1ForFork3_#t~ite29_Out-1110952591| ~y$w_buff1_used~0_In-1110952591) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110952591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110952591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110952591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110952591, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110952591, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1110952591|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110952591} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 13:00:52,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L800-->L801: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1461261522 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1461261522 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-1461261522 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_In-1461261522 ~y$r_buff0_thd3~0_Out-1461261522)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1461261522} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1461261522|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461261522, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1461261522} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 13:00:52,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1350213856 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1350213856 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1350213856 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In1350213856 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out1350213856| ~y$r_buff1_thd3~0_In1350213856) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out1350213856| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1350213856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350213856, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1350213856, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350213856} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1350213856, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1350213856, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1350213856, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1350213856|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1350213856} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 13:00:52,876 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L801-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= |v_P2Thread1of1ForFork3_#t~ite31_48| v_~y$r_buff1_thd3~0_83) (= v_~__unbuffered_cnt~0_104 (+ v_~__unbuffered_cnt~0_105 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_105} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_83, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_47|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 13:00:52,877 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L849-1-->L855: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 13:00:52,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L855-2-->L855-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-726133103 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-726133103 256)))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-726133103| ~y~0_In-726133103) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-726133103| ~y$w_buff1~0_In-726133103) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-726133103, ~y~0=~y~0_In-726133103, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-726133103, ~y~0=~y~0_In-726133103, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-726133103|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-726133103, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-726133103} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:00:52,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L855-4-->L856: Formula: (= v_~y~0_21 |v_ULTIMATE.start_main_#t~ite42_12|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_17|, ~y~0=v_~y~0_21, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 13:00:52,878 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1309111617 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1309111617 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1309111617| ~y$w_buff0_used~0_In1309111617) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1309111617| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1309111617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309111617} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1309111617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1309111617, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1309111617|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 13:00:52,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L857-->L857-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-1025738865 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1025738865 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1025738865 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1025738865 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1025738865|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1025738865 |ULTIMATE.start_main_#t~ite45_Out-1025738865|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025738865, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025738865} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1025738865, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1025738865, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1025738865, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1025738865|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1025738865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 13:00:52,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L858-->L858-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-232602318 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-232602318 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-232602318| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-232602318 |ULTIMATE.start_main_#t~ite46_Out-232602318|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232602318} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-232602318, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232602318, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-232602318|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 13:00:52,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-882846577 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-882846577 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-882846577 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-882846577 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out-882846577| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-882846577| ~y$r_buff1_thd0~0_In-882846577) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-882846577, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-882846577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-882846577, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-882846577, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-882846577|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-882846577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-882846577} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 13:00:52,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_155 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_207 |v_ULTIMATE.start_main_#t~ite47_57|) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 2 v_~__unbuffered_p3_EAX~0_33) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_33) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_24 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_57|, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~z~0=v_~z~0_155, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_207, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 13:00:52,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:00:52 BasicIcfg [2019-12-18 13:00:52,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 13:00:52,975 INFO L168 Benchmark]: Toolchain (without parser) took 124760.03 ms. Allocated memory was 138.4 MB in the beginning and 3.6 GB in the end (delta: 3.5 GB). Free memory was 101.6 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,976 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.26 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,977 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.69 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,977 INFO L168 Benchmark]: Boogie Preprocessor took 39.52 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,978 INFO L168 Benchmark]: RCFGBuilder took 813.93 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 101.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,979 INFO L168 Benchmark]: TraceAbstraction took 123074.99 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 13:00:52,982 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.25 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.26 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 101.4 MB in the beginning and 155.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.69 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.52 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.93 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 101.5 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123074.99 ms. Allocated memory was 202.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 181 ProgramPointsBefore, 87 ProgramPointsAfterwards, 209 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 7916 VarBasedMoverChecksPositive, 275 VarBasedMoverChecksNegative, 100 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66604 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L843] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L845] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L847] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L781] 3 y$w_buff1 = y$w_buff0 [L782] 3 y$w_buff0 = 1 [L783] 3 y$w_buff1_used = y$w_buff0_used [L784] 3 y$w_buff0_used = (_Bool)1 [L849] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 4 z = 2 [L814] 4 __unbuffered_p3_EAX = z [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 1 [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L821] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L822] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L823] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L797] EXPR 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L797] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L798] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L799] 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 [L855] 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=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 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 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 122.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2973 SDtfs, 3016 SDslu, 6412 SDs, 0 SdLazy, 2586 SolverSat, 123 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210054occurred 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: 61.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 95271 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 782 NumberOfCodeBlocks, 782 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 120646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...